./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-47.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-47.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 221b5a6bbea2d3affa28d277422c6c16e25871b0f2e6dd0968bfbdc5b5eb82af --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:13:27,862 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:13:27,916 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 02:13:27,921 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:13:27,923 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:13:27,942 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:13:27,942 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:13:27,944 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:13:27,944 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:13:27,947 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:13:27,947 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:13:27,947 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:13:27,948 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:13:27,949 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:13:27,949 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:13:27,949 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:13:27,950 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:13:27,950 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:13:27,950 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 02:13:27,950 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:13:27,950 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:13:27,951 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:13:27,951 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:13:27,951 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:13:27,952 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:13:27,952 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:13:27,952 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:13:27,952 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:13:27,952 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:13:27,953 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:13:27,953 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:13:27,953 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:13:27,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:13:27,953 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:13:27,954 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:13:27,954 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:13:27,954 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 02:13:27,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 02:13:27,955 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:13:27,955 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:13:27,955 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:13:27,956 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:13:27,956 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 221b5a6bbea2d3affa28d277422c6c16e25871b0f2e6dd0968bfbdc5b5eb82af [2024-11-09 02:13:28,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:13:28,178 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:13:28,180 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:13:28,181 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:13:28,182 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:13:28,182 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-47.i [2024-11-09 02:13:29,380 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:13:29,537 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:13:29,538 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-47.i [2024-11-09 02:13:29,545 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00fa5c553/538db870a18942e0bde0a20cba3dfcf1/FLAGf4959d289 [2024-11-09 02:13:29,941 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00fa5c553/538db870a18942e0bde0a20cba3dfcf1 [2024-11-09 02:13:29,943 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:13:29,944 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:13:29,948 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:13:29,948 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:13:29,952 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:13:29,952 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:13:29" (1/1) ... [2024-11-09 02:13:29,955 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a447777 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:29, skipping insertion in model container [2024-11-09 02:13:29,955 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:13:29" (1/1) ... [2024-11-09 02:13:29,974 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:13:30,107 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-47.i[917,930] [2024-11-09 02:13:30,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:13:30,175 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:13:30,186 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-47.i[917,930] [2024-11-09 02:13:30,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:13:30,233 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:13:30,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:30 WrapperNode [2024-11-09 02:13:30,234 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:13:30,235 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:13:30,235 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:13:30,235 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:13:30,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:30" (1/1) ... [2024-11-09 02:13:30,253 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:30" (1/1) ... [2024-11-09 02:13:30,279 INFO L138 Inliner]: procedures = 29, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 460 [2024-11-09 02:13:30,279 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:13:30,280 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:13:30,280 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:13:30,280 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:13:30,292 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:30" (1/1) ... [2024-11-09 02:13:30,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:30" (1/1) ... [2024-11-09 02:13:30,296 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:30" (1/1) ... [2024-11-09 02:13:30,317 INFO L175 MemorySlicer]: Split 115 memory accesses to 2 slices as follows [2, 113]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 12 writes are split as follows [0, 12]. [2024-11-09 02:13:30,317 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:30" (1/1) ... [2024-11-09 02:13:30,317 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:30" (1/1) ... [2024-11-09 02:13:30,341 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:30" (1/1) ... [2024-11-09 02:13:30,345 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:30" (1/1) ... [2024-11-09 02:13:30,346 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:30" (1/1) ... [2024-11-09 02:13:30,348 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:30" (1/1) ... [2024-11-09 02:13:30,350 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:13:30,351 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:13:30,351 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:13:30,351 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:13:30,352 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:30" (1/1) ... [2024-11-09 02:13:30,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:13:30,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:13:30,395 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 02:13:30,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 02:13:30,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:13:30,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-09 02:13:30,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-09 02:13:30,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 02:13:30,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 02:13:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-09 02:13:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-09 02:13:30,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 02:13:30,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 02:13:30,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-09 02:13:30,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-09 02:13:30,446 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 02:13:30,447 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 02:13:30,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 02:13:30,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 02:13:30,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:13:30,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:13:30,552 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:13:30,553 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:13:30,961 INFO L? ?]: Removed 130 outVars from TransFormulas that were not future-live. [2024-11-09 02:13:30,962 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:13:30,972 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:13:30,972 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 02:13:30,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:13:30 BoogieIcfgContainer [2024-11-09 02:13:30,973 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:13:30,974 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:13:30,975 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:13:30,977 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:13:30,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:13:29" (1/3) ... [2024-11-09 02:13:30,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5efbea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:13:30, skipping insertion in model container [2024-11-09 02:13:30,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:30" (2/3) ... [2024-11-09 02:13:30,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5efbea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:13:30, skipping insertion in model container [2024-11-09 02:13:30,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:13:30" (3/3) ... [2024-11-09 02:13:30,979 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-47.i [2024-11-09 02:13:30,994 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:13:30,994 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:13:31,041 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:13:31,045 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1a095881, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:13:31,046 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 02:13:31,049 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 02:13:31,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-09 02:13:31,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:31,057 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:13:31,057 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:13:31,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:13:31,061 INFO L85 PathProgramCache]: Analyzing trace with hash -766083450, now seen corresponding path program 1 times [2024-11-09 02:13:31,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:13:31,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667414809] [2024-11-09 02:13:31,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:31,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:13:31,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:31,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 02:13:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:31,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 02:13:31,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:31,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 02:13:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:31,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 02:13:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:31,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:13:31,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:31,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 02:13:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:31,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 02:13:31,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:31,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:13:31,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:31,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:13:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:31,315 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 02:13:31,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:13:31,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667414809] [2024-11-09 02:13:31,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667414809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:13:31,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:13:31,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:13:31,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257827687] [2024-11-09 02:13:31,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:13:31,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 02:13:31,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:13:31,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 02:13:31,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:13:31,345 INFO L87 Difference]: Start difference. First operand has 96 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 02:13:31,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:13:31,363 INFO L93 Difference]: Finished difference Result 185 states and 285 transitions. [2024-11-09 02:13:31,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 02:13:31,365 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2024-11-09 02:13:31,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:13:31,370 INFO L225 Difference]: With dead ends: 185 [2024-11-09 02:13:31,370 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 02:13:31,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:13:31,375 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:13:31,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:13:31,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 02:13:31,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-09 02:13:31,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 81 states have internal predecessors, (116), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 02:13:31,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-11-09 02:13:31,403 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 84 [2024-11-09 02:13:31,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:13:31,403 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-11-09 02:13:31,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 02:13:31,404 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-11-09 02:13:31,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-09 02:13:31,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:31,409 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:13:31,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 02:13:31,409 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:13:31,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:13:31,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1428001612, now seen corresponding path program 1 times [2024-11-09 02:13:31,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:13:31,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151450117] [2024-11-09 02:13:31,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:31,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:13:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:31,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 02:13:31,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:31,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 02:13:31,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:31,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 02:13:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:31,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 02:13:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:31,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:13:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:31,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 02:13:31,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:31,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 02:13:31,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:31,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:13:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:31,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:13:31,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:31,602 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 02:13:31,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:13:31,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151450117] [2024-11-09 02:13:31,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151450117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:13:31,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:13:31,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:13:31,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861504111] [2024-11-09 02:13:31,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:13:31,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:13:31,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:13:31,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:13:31,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:13:31,610 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:13:31,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:13:31,639 INFO L93 Difference]: Finished difference Result 182 states and 267 transitions. [2024-11-09 02:13:31,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:13:31,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-09 02:13:31,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:13:31,643 INFO L225 Difference]: With dead ends: 182 [2024-11-09 02:13:31,643 INFO L226 Difference]: Without dead ends: 93 [2024-11-09 02:13:31,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:13:31,645 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:13:31,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 260 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:13:31,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-09 02:13:31,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-09 02:13:31,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.4268292682926829) internal successors, (117), 82 states have internal predecessors, (117), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 02:13:31,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2024-11-09 02:13:31,656 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 84 [2024-11-09 02:13:31,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:13:31,657 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2024-11-09 02:13:31,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:13:31,658 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2024-11-09 02:13:31,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-09 02:13:31,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:31,659 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:13:31,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 02:13:31,659 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:13:31,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:13:31,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1178021942, now seen corresponding path program 1 times [2024-11-09 02:13:31,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:13:31,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930230562] [2024-11-09 02:13:31,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:31,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:13:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:31,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 02:13:31,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:31,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 02:13:31,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:31,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 02:13:31,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:31,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 02:13:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:31,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:13:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:31,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 02:13:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:31,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 02:13:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:31,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:13:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:31,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:13:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:31,891 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 02:13:31,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:13:31,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930230562] [2024-11-09 02:13:31,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930230562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:13:31,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:13:31,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:13:31,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720999562] [2024-11-09 02:13:31,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:13:31,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:13:31,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:13:31,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:13:31,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:13:31,895 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:13:31,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:13:31,939 INFO L93 Difference]: Finished difference Result 186 states and 271 transitions. [2024-11-09 02:13:31,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:13:31,941 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-09 02:13:31,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:13:31,942 INFO L225 Difference]: With dead ends: 186 [2024-11-09 02:13:31,943 INFO L226 Difference]: Without dead ends: 96 [2024-11-09 02:13:31,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:13:31,944 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:13:31,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 509 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:13:31,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-09 02:13:31,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-09 02:13:31,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 85 states have (on average 1.411764705882353) internal successors, (120), 85 states have internal predecessors, (120), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 02:13:31,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2024-11-09 02:13:31,956 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 84 [2024-11-09 02:13:31,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:13:31,956 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2024-11-09 02:13:31,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:13:31,957 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2024-11-09 02:13:31,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-09 02:13:31,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:31,958 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:13:31,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 02:13:31,959 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:13:31,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:13:31,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1605540184, now seen corresponding path program 1 times [2024-11-09 02:13:31,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:13:31,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412469092] [2024-11-09 02:13:31,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:31,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:13:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:32,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 02:13:32,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:32,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 02:13:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:32,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 02:13:32,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:32,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 02:13:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:32,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:13:32,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:32,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 02:13:32,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:32,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 02:13:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:32,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:13:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:32,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:13:32,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:32,089 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 02:13:32,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:13:32,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412469092] [2024-11-09 02:13:32,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412469092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:13:32,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:13:32,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:13:32,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846667320] [2024-11-09 02:13:32,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:13:32,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:13:32,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:13:32,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:13:32,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:13:32,091 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:13:32,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:13:32,114 INFO L93 Difference]: Finished difference Result 192 states and 277 transitions. [2024-11-09 02:13:32,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:13:32,115 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-09 02:13:32,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:13:32,116 INFO L225 Difference]: With dead ends: 192 [2024-11-09 02:13:32,116 INFO L226 Difference]: Without dead ends: 99 [2024-11-09 02:13:32,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:13:32,118 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 1 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:13:32,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 384 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:13:32,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-09 02:13:32,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2024-11-09 02:13:32,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 87 states have internal predecessors, (122), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 02:13:32,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2024-11-09 02:13:32,124 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 84 [2024-11-09 02:13:32,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:13:32,124 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2024-11-09 02:13:32,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:13:32,125 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2024-11-09 02:13:32,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-09 02:13:32,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:32,125 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:13:32,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 02:13:32,126 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:13:32,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:13:32,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1603693142, now seen corresponding path program 1 times [2024-11-09 02:13:32,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:13:32,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479160616] [2024-11-09 02:13:32,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:32,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:13:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:13:32,192 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 02:13:32,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:13:32,259 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 02:13:32,260 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 02:13:32,260 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 02:13:32,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 02:13:32,264 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-09 02:13:32,338 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 02:13:32,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 02:13:32 BoogieIcfgContainer [2024-11-09 02:13:32,340 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 02:13:32,340 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 02:13:32,341 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 02:13:32,341 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 02:13:32,341 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:13:30" (3/4) ... [2024-11-09 02:13:32,345 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 02:13:32,346 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 02:13:32,346 INFO L158 Benchmark]: Toolchain (without parser) took 2402.22ms. Allocated memory was 146.8MB in the beginning and 190.8MB in the end (delta: 44.0MB). Free memory was 91.5MB in the beginning and 89.8MB in the end (delta: 1.7MB). Peak memory consumption was 48.5MB. Max. memory is 16.1GB. [2024-11-09 02:13:32,346 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 146.8MB. Free memory was 84.2MB in the beginning and 84.0MB in the end (delta: 151.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 02:13:32,348 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.17ms. Allocated memory is still 146.8MB. Free memory was 91.5MB in the beginning and 75.5MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 02:13:32,352 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.61ms. Allocated memory is still 146.8MB. Free memory was 75.5MB in the beginning and 72.2MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 02:13:32,353 INFO L158 Benchmark]: Boogie Preprocessor took 70.28ms. Allocated memory was 146.8MB in the beginning and 190.8MB in the end (delta: 44.0MB). Free memory was 72.2MB in the beginning and 159.6MB in the end (delta: -87.4MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2024-11-09 02:13:32,353 INFO L158 Benchmark]: RCFGBuilder took 621.61ms. Allocated memory is still 190.8MB. Free memory was 159.5MB in the beginning and 130.4MB in the end (delta: 29.2MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. [2024-11-09 02:13:32,355 INFO L158 Benchmark]: TraceAbstraction took 1365.58ms. Allocated memory is still 190.8MB. Free memory was 129.4MB in the beginning and 90.8MB in the end (delta: 38.6MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. [2024-11-09 02:13:32,355 INFO L158 Benchmark]: Witness Printer took 5.16ms. Allocated memory is still 190.8MB. Free memory was 90.8MB in the beginning and 89.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 02:13:32,356 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 146.8MB. Free memory was 84.2MB in the beginning and 84.0MB in the end (delta: 151.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 286.17ms. Allocated memory is still 146.8MB. Free memory was 91.5MB in the beginning and 75.5MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.61ms. Allocated memory is still 146.8MB. Free memory was 75.5MB in the beginning and 72.2MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.28ms. Allocated memory was 146.8MB in the beginning and 190.8MB in the end (delta: 44.0MB). Free memory was 72.2MB in the beginning and 159.6MB in the end (delta: -87.4MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * RCFGBuilder took 621.61ms. Allocated memory is still 190.8MB. Free memory was 159.5MB in the beginning and 130.4MB in the end (delta: 29.2MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1365.58ms. Allocated memory is still 190.8MB. Free memory was 129.4MB in the beginning and 90.8MB in the end (delta: 38.6MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. * Witness Printer took 5.16ms. Allocated memory is still 190.8MB. Free memory was 90.8MB in the beginning and 89.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 104. Possible FailurePath: [L33] unsigned char isInitial = 0; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L45] double* WrapperStruct0_var_1_1_Pointer = &(WrapperStruct0.var_1_1); [L46] double* WrapperStruct0_var_1_8_Pointer = &(WrapperStruct0.var_1_8); [L47] signed char* WrapperStruct0_var_1_9_Pointer = &(WrapperStruct0.var_1_9); [L48] signed char* WrapperStruct0_var_1_10_Pointer = &(WrapperStruct0.var_1_10); [L49] signed char* WrapperStruct0_var_1_11_Pointer = &(WrapperStruct0.var_1_11); [L50] signed long int* WrapperStruct0_var_1_12_Pointer = &(WrapperStruct0.var_1_12); [L51] unsigned char* WrapperStruct0_var_1_13_Pointer = &(WrapperStruct0.var_1_13); [L52] unsigned char* WrapperStruct0_var_1_14_Pointer = &(WrapperStruct0.var_1_14); [L53] double* WrapperStruct0_var_1_15_Pointer = &(WrapperStruct0.var_1_15); [L54] signed long int last_1_WrapperStruct0_var_1_12 = 8; VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=0, last_1_WrapperStruct0_var_1_12=8] [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] CALL updateLastVariables() [L101] EXPR WrapperStruct0.var_1_12 [L101] last_1_WrapperStruct0_var_1_12 = WrapperStruct0.var_1_12 [L111] RET updateLastVariables() [L112] CALL updateVariables() [L85] WrapperStruct0.var_1_8 = __VERIFIER_nondet_double() [L86] EXPR WrapperStruct0.var_1_8 [L86] EXPR WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L86] EXPR WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F [L86] EXPR WrapperStruct0.var_1_8 [L86] EXPR WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L86] EXPR (WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L86] EXPR (WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L86] CALL assume_abort_if_not((WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L86] RET assume_abort_if_not((WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L87] WrapperStruct0.var_1_10 = __VERIFIER_nondet_char() [L88] EXPR WrapperStruct0.var_1_10 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L88] CALL assume_abort_if_not(WrapperStruct0.var_1_10 >= -63) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L88] RET assume_abort_if_not(WrapperStruct0.var_1_10 >= -63) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L89] EXPR WrapperStruct0.var_1_10 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L89] CALL assume_abort_if_not(WrapperStruct0.var_1_10 <= 63) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L89] RET assume_abort_if_not(WrapperStruct0.var_1_10 <= 63) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L90] WrapperStruct0.var_1_11 = __VERIFIER_nondet_char() [L91] EXPR WrapperStruct0.var_1_11 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L91] CALL assume_abort_if_not(WrapperStruct0.var_1_11 >= -63) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L91] RET assume_abort_if_not(WrapperStruct0.var_1_11 >= -63) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L92] EXPR WrapperStruct0.var_1_11 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L92] CALL assume_abort_if_not(WrapperStruct0.var_1_11 <= 63) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L92] RET assume_abort_if_not(WrapperStruct0.var_1_11 <= 63) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L93] WrapperStruct0.var_1_13 = __VERIFIER_nondet_uchar() [L94] EXPR WrapperStruct0.var_1_13 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L94] CALL assume_abort_if_not(WrapperStruct0.var_1_13 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L94] RET assume_abort_if_not(WrapperStruct0.var_1_13 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] EXPR WrapperStruct0.var_1_13 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] CALL assume_abort_if_not(WrapperStruct0.var_1_13 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] RET assume_abort_if_not(WrapperStruct0.var_1_13 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L96] WrapperStruct0.var_1_14 = __VERIFIER_nondet_uchar() [L97] EXPR WrapperStruct0.var_1_14 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L97] CALL assume_abort_if_not(WrapperStruct0.var_1_14 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L97] RET assume_abort_if_not(WrapperStruct0.var_1_14 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L98] EXPR WrapperStruct0.var_1_14 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L98] CALL assume_abort_if_not(WrapperStruct0.var_1_14 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L98] RET assume_abort_if_not(WrapperStruct0.var_1_14 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L112] RET updateVariables() [L113] CALL step() [L58] COND FALSE !(-4 > last_1_WrapperStruct0_var_1_12) [L63] EXPR \read(*WrapperStruct0_var_1_10_Pointer) [L63] (*(WrapperStruct0_var_1_9_Pointer)) = (*(WrapperStruct0_var_1_10_Pointer)) [L65] EXPR \read(*WrapperStruct0_var_1_13_Pointer) [L65] unsigned char stepLocal_0 = ! (*(WrapperStruct0_var_1_13_Pointer)); [L66] stepLocal_0 || (*(WrapperStruct0_var_1_14_Pointer)) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L66] stepLocal_0 || (*(WrapperStruct0_var_1_14_Pointer)) [L66] EXPR \read(*WrapperStruct0_var_1_14_Pointer) [L66] stepLocal_0 || (*(WrapperStruct0_var_1_14_Pointer)) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L66] COND FALSE !(stepLocal_0 || (*(WrapperStruct0_var_1_14_Pointer))) [L73] EXPR \read(*WrapperStruct0_var_1_8_Pointer) [L73] (*(WrapperStruct0_var_1_15_Pointer)) = (*(WrapperStruct0_var_1_8_Pointer)) [L74] EXPR \read(*WrapperStruct0_var_1_15_Pointer) [L74] EXPR \read(*WrapperStruct0_var_1_15_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L74] COND FALSE !((*(WrapperStruct0_var_1_15_Pointer)) <= (*(WrapperStruct0_var_1_15_Pointer))) [L79] EXPR \read(*WrapperStruct0_var_1_12_Pointer) [L79] EXPR \read(*WrapperStruct0_var_1_9_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L79] COND TRUE (*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer)) [L80] EXPR \read(*WrapperStruct0_var_1_8_Pointer) [L80] (*(WrapperStruct0_var_1_1_Pointer)) = (*(WrapperStruct0_var_1_8_Pointer)) [L113] RET step() [L114] CALL, EXPR property() [L104] EXPR \read(*WrapperStruct0_var_1_15_Pointer) [L104] EXPR \read(*WrapperStruct0_var_1_15_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L104] EXPR ((*(WrapperStruct0_var_1_15_Pointer)) <= (*(WrapperStruct0_var_1_15_Pointer))) ? ((((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_12_Pointer))) >= ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct0_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_8_Pointer))))))) : 1) : (((*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) : 1) [L104] EXPR \read(*WrapperStruct0_var_1_12_Pointer) [L104] EXPR \read(*WrapperStruct0_var_1_9_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L104] EXPR ((*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) : 1 [L104] EXPR \read(*WrapperStruct0_var_1_1_Pointer) [L104] EXPR \read(*WrapperStruct0_var_1_8_Pointer) [L104] EXPR ((*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) : 1 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L104] EXPR ((*(WrapperStruct0_var_1_15_Pointer)) <= (*(WrapperStruct0_var_1_15_Pointer))) ? ((((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_12_Pointer))) >= ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct0_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_8_Pointer))))))) : 1) : (((*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L104] EXPR (((*(WrapperStruct0_var_1_15_Pointer)) <= (*(WrapperStruct0_var_1_15_Pointer))) ? ((((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_12_Pointer))) >= ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct0_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_8_Pointer))))))) : 1) : (((*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (*(WrapperStruct0_var_1_10_Pointer))))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L104] EXPR (((*(WrapperStruct0_var_1_15_Pointer)) <= (*(WrapperStruct0_var_1_15_Pointer))) ? ((((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_12_Pointer))) >= ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct0_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_8_Pointer))))))) : 1) : (((*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (*(WrapperStruct0_var_1_10_Pointer))))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L104] EXPR ((((*(WrapperStruct0_var_1_15_Pointer)) <= (*(WrapperStruct0_var_1_15_Pointer))) ? ((((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_12_Pointer))) >= ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct0_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_8_Pointer))))))) : 1) : (((*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (*(WrapperStruct0_var_1_10_Pointer)))))) && (((! (*(WrapperStruct0_var_1_13_Pointer))) || (*(WrapperStruct0_var_1_14_Pointer))) ? ((! (*(WrapperStruct0_var_1_14_Pointer))) ? ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed long int) ((((((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) < 0 ) ? -(((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) : (((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))))))) : ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct0_var_1_9_Pointer))))) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L104] EXPR ((((*(WrapperStruct0_var_1_15_Pointer)) <= (*(WrapperStruct0_var_1_15_Pointer))) ? ((((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_12_Pointer))) >= ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct0_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_8_Pointer))))))) : 1) : (((*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (*(WrapperStruct0_var_1_10_Pointer)))))) && (((! (*(WrapperStruct0_var_1_13_Pointer))) || (*(WrapperStruct0_var_1_14_Pointer))) ? ((! (*(WrapperStruct0_var_1_14_Pointer))) ? ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed long int) ((((((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) < 0 ) ? -(((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) : (((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))))))) : ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct0_var_1_9_Pointer))))) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L104] EXPR (((((*(WrapperStruct0_var_1_15_Pointer)) <= (*(WrapperStruct0_var_1_15_Pointer))) ? ((((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_12_Pointer))) >= ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct0_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_8_Pointer))))))) : 1) : (((*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (*(WrapperStruct0_var_1_10_Pointer)))))) && (((! (*(WrapperStruct0_var_1_13_Pointer))) || (*(WrapperStruct0_var_1_14_Pointer))) ? ((! (*(WrapperStruct0_var_1_14_Pointer))) ? ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed long int) ((((((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) < 0 ) ? -(((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) : (((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))))))) : ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct0_var_1_9_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_15_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L104] EXPR (((((*(WrapperStruct0_var_1_15_Pointer)) <= (*(WrapperStruct0_var_1_15_Pointer))) ? ((((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_12_Pointer))) >= ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct0_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_8_Pointer))))))) : 1) : (((*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (*(WrapperStruct0_var_1_10_Pointer)))))) && (((! (*(WrapperStruct0_var_1_13_Pointer))) || (*(WrapperStruct0_var_1_14_Pointer))) ? ((! (*(WrapperStruct0_var_1_14_Pointer))) ? ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed long int) ((((((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) < 0 ) ? -(((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) : (((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))))))) : ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct0_var_1_9_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_15_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L104-L105] return (((((*(WrapperStruct0_var_1_15_Pointer)) <= (*(WrapperStruct0_var_1_15_Pointer))) ? ((((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_12_Pointer))) >= ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct0_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_8_Pointer))))))) : 1) : (((*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (*(WrapperStruct0_var_1_10_Pointer)))))) && (((! (*(WrapperStruct0_var_1_13_Pointer))) || (*(WrapperStruct0_var_1_14_Pointer))) ? ((! (*(WrapperStruct0_var_1_14_Pointer))) ? ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed long int) ((((((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) < 0 ) ? -(((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) : (((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))))))) : ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct0_var_1_9_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_15_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) ; [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L19] reach_error() VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 5, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 1287 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 758 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 49 IncrementalHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 529 mSDtfsCounter, 49 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=4, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 420 NumberOfCodeBlocks, 420 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 332 ConstructedInterpolants, 0 QuantifiedInterpolants, 340 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 576/576 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 02:13:32,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-47.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 221b5a6bbea2d3affa28d277422c6c16e25871b0f2e6dd0968bfbdc5b5eb82af --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:13:34,107 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:13:34,169 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 02:13:34,175 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:13:34,175 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:13:34,197 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:13:34,201 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:13:34,201 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:13:34,202 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:13:34,202 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:13:34,202 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:13:34,202 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:13:34,203 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:13:34,204 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:13:34,205 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:13:34,205 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:13:34,205 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:13:34,205 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:13:34,205 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:13:34,206 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:13:34,206 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:13:34,209 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:13:34,209 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:13:34,209 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 02:13:34,209 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 02:13:34,209 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:13:34,209 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 02:13:34,209 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:13:34,209 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:13:34,210 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:13:34,210 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:13:34,210 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:13:34,210 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:13:34,210 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:13:34,210 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:13:34,217 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:13:34,218 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:13:34,218 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:13:34,218 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 02:13:34,218 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 02:13:34,218 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:13:34,219 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:13:34,220 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:13:34,220 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:13:34,220 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 221b5a6bbea2d3affa28d277422c6c16e25871b0f2e6dd0968bfbdc5b5eb82af [2024-11-09 02:13:34,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:13:34,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:13:34,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:13:34,478 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:13:34,478 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:13:34,479 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-47.i [2024-11-09 02:13:35,708 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:13:35,871 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:13:35,871 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-47.i [2024-11-09 02:13:35,879 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d62f59e9/c7f9c4b657c540c0b4430edd62d92243/FLAG7244625cf [2024-11-09 02:13:35,899 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d62f59e9/c7f9c4b657c540c0b4430edd62d92243 [2024-11-09 02:13:35,901 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:13:35,902 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:13:35,903 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:13:35,903 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:13:35,906 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:13:35,907 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:13:35" (1/1) ... [2024-11-09 02:13:35,908 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e4a7656 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:35, skipping insertion in model container [2024-11-09 02:13:35,908 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:13:35" (1/1) ... [2024-11-09 02:13:35,931 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:13:36,072 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-47.i[917,930] [2024-11-09 02:13:36,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:13:36,150 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:13:36,161 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-47.i[917,930] [2024-11-09 02:13:36,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:13:36,219 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:13:36,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:36 WrapperNode [2024-11-09 02:13:36,219 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:13:36,220 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:13:36,221 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:13:36,221 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:13:36,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:36" (1/1) ... [2024-11-09 02:13:36,244 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:36" (1/1) ... [2024-11-09 02:13:36,278 INFO L138 Inliner]: procedures = 33, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 458 [2024-11-09 02:13:36,280 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:13:36,281 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:13:36,281 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:13:36,282 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:13:36,297 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:36" (1/1) ... [2024-11-09 02:13:36,297 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:36" (1/1) ... [2024-11-09 02:13:36,306 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:36" (1/1) ... [2024-11-09 02:13:36,327 INFO L175 MemorySlicer]: Split 115 memory accesses to 2 slices as follows [2, 113]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 12 writes are split as follows [0, 12]. [2024-11-09 02:13:36,327 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:36" (1/1) ... [2024-11-09 02:13:36,328 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:36" (1/1) ... [2024-11-09 02:13:36,339 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:36" (1/1) ... [2024-11-09 02:13:36,342 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:36" (1/1) ... [2024-11-09 02:13:36,346 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:36" (1/1) ... [2024-11-09 02:13:36,352 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:36" (1/1) ... [2024-11-09 02:13:36,357 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:13:36,358 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:13:36,358 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:13:36,358 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:13:36,359 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:36" (1/1) ... [2024-11-09 02:13:36,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:13:36,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:13:36,386 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 02:13:36,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 02:13:36,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:13:36,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-09 02:13:36,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-09 02:13:36,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-09 02:13:36,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-09 02:13:36,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 02:13:36,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 02:13:36,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 02:13:36,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 02:13:36,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-09 02:13:36,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-09 02:13:36,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-09 02:13:36,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-09 02:13:36,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 02:13:36,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 02:13:36,421 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 02:13:36,421 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 02:13:36,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:13:36,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:13:36,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-09 02:13:36,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-09 02:13:36,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 02:13:36,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 02:13:36,511 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:13:36,512 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:13:36,988 INFO L? ?]: Removed 132 outVars from TransFormulas that were not future-live. [2024-11-09 02:13:36,988 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:13:37,001 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:13:37,002 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 02:13:37,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:13:37 BoogieIcfgContainer [2024-11-09 02:13:37,002 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:13:37,004 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:13:37,004 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:13:37,007 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:13:37,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:13:35" (1/3) ... [2024-11-09 02:13:37,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ca42d8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:13:37, skipping insertion in model container [2024-11-09 02:13:37,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:36" (2/3) ... [2024-11-09 02:13:37,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ca42d8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:13:37, skipping insertion in model container [2024-11-09 02:13:37,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:13:37" (3/3) ... [2024-11-09 02:13:37,009 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-47.i [2024-11-09 02:13:37,021 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:13:37,022 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:13:37,066 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:13:37,070 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@c6e4495, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:13:37,070 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 02:13:37,073 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 02:13:37,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-09 02:13:37,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:37,082 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:13:37,082 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:13:37,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:13:37,086 INFO L85 PathProgramCache]: Analyzing trace with hash -766083450, now seen corresponding path program 1 times [2024-11-09 02:13:37,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:13:37,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1994533066] [2024-11-09 02:13:37,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:37,099 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:13:37,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:13:37,101 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:13:37,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 02:13:37,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:37,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 02:13:37,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:13:37,377 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-09 02:13:37,378 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:13:37,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:13:37,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1994533066] [2024-11-09 02:13:37,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1994533066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:13:37,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:13:37,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:13:37,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578636150] [2024-11-09 02:13:37,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:13:37,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 02:13:37,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:13:37,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 02:13:37,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:13:37,408 INFO L87 Difference]: Start difference. First operand has 96 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 02:13:37,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:13:37,427 INFO L93 Difference]: Finished difference Result 185 states and 285 transitions. [2024-11-09 02:13:37,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 02:13:37,429 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2024-11-09 02:13:37,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:13:37,434 INFO L225 Difference]: With dead ends: 185 [2024-11-09 02:13:37,434 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 02:13:37,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:13:37,442 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:13:37,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:13:37,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 02:13:37,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-09 02:13:37,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 81 states have internal predecessors, (116), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 02:13:37,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-11-09 02:13:37,476 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 84 [2024-11-09 02:13:37,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:13:37,476 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-11-09 02:13:37,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 02:13:37,477 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-11-09 02:13:37,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-09 02:13:37,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:37,489 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:13:37,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 02:13:37,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:13:37,691 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:13:37,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:13:37,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1428001612, now seen corresponding path program 1 times [2024-11-09 02:13:37,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:13:37,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1398249863] [2024-11-09 02:13:37,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:37,693 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:13:37,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:13:37,696 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:13:37,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 02:13:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:37,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 02:13:37,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:13:37,914 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 02:13:37,915 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:13:37,915 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:13:37,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1398249863] [2024-11-09 02:13:37,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1398249863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:13:37,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:13:37,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:13:37,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758656159] [2024-11-09 02:13:37,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:13:37,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:13:37,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:13:37,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:13:37,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:13:37,919 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:13:38,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:13:38,062 INFO L93 Difference]: Finished difference Result 182 states and 267 transitions. [2024-11-09 02:13:38,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:13:38,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-09 02:13:38,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:13:38,068 INFO L225 Difference]: With dead ends: 182 [2024-11-09 02:13:38,068 INFO L226 Difference]: Without dead ends: 93 [2024-11-09 02:13:38,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:13:38,069 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:13:38,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 260 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 02:13:38,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-09 02:13:38,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-09 02:13:38,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.4268292682926829) internal successors, (117), 82 states have internal predecessors, (117), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 02:13:38,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2024-11-09 02:13:38,076 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 84 [2024-11-09 02:13:38,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:13:38,078 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2024-11-09 02:13:38,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:13:38,078 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2024-11-09 02:13:38,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-09 02:13:38,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:38,080 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:13:38,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 02:13:38,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:13:38,281 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:13:38,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:13:38,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1178021942, now seen corresponding path program 1 times [2024-11-09 02:13:38,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:13:38,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2061236095] [2024-11-09 02:13:38,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:38,283 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:13:38,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:13:38,285 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:13:38,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 02:13:38,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:38,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 02:13:38,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:13:38,518 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 02:13:38,519 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:13:38,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:13:38,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2061236095] [2024-11-09 02:13:38,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2061236095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:13:38,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:13:38,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:13:38,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523363149] [2024-11-09 02:13:38,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:13:38,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:13:38,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:13:38,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:13:38,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:13:38,524 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:13:39,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:13:39,053 INFO L93 Difference]: Finished difference Result 186 states and 271 transitions. [2024-11-09 02:13:39,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:13:39,054 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-09 02:13:39,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:13:39,055 INFO L225 Difference]: With dead ends: 186 [2024-11-09 02:13:39,055 INFO L226 Difference]: Without dead ends: 96 [2024-11-09 02:13:39,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:13:39,056 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 02:13:39,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 509 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 02:13:39,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-09 02:13:39,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-09 02:13:39,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 85 states have (on average 1.411764705882353) internal successors, (120), 85 states have internal predecessors, (120), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 02:13:39,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2024-11-09 02:13:39,067 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 84 [2024-11-09 02:13:39,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:13:39,068 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2024-11-09 02:13:39,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:13:39,068 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2024-11-09 02:13:39,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-09 02:13:39,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:39,070 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:13:39,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 02:13:39,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:13:39,276 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:13:39,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:13:39,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1605540184, now seen corresponding path program 1 times [2024-11-09 02:13:39,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:13:39,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [276270149] [2024-11-09 02:13:39,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:39,279 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:13:39,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:13:39,282 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:13:39,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 02:13:39,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:39,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 02:13:39,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:13:39,490 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 02:13:39,490 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:13:39,490 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:13:39,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [276270149] [2024-11-09 02:13:39,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [276270149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:13:39,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:13:39,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:13:39,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759643871] [2024-11-09 02:13:39,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:13:39,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:13:39,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:13:39,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:13:39,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:13:39,496 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:13:40,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 02:13:41,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:13:41,048 INFO L93 Difference]: Finished difference Result 194 states and 280 transitions. [2024-11-09 02:13:41,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:13:41,049 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-09 02:13:41,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:13:41,053 INFO L225 Difference]: With dead ends: 194 [2024-11-09 02:13:41,053 INFO L226 Difference]: Without dead ends: 101 [2024-11-09 02:13:41,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:13:41,054 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 02:13:41,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 503 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 02:13:41,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-09 02:13:41,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-11-09 02:13:41,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 89 states have internal predecessors, (124), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 02:13:41,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2024-11-09 02:13:41,066 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 84 [2024-11-09 02:13:41,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:13:41,067 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2024-11-09 02:13:41,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:13:41,067 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2024-11-09 02:13:41,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-09 02:13:41,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:41,068 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:13:41,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-09 02:13:41,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:13:41,275 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:13:41,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:13:41,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1603693142, now seen corresponding path program 1 times [2024-11-09 02:13:41,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:13:41,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [276415360] [2024-11-09 02:13:41,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:41,276 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:13:41,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:13:41,278 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:13:41,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 02:13:41,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:41,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-09 02:13:41,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:13:41,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2024-11-09 02:13:42,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 55 [2024-11-09 02:13:42,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 63 [2024-11-09 02:13:43,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 74 [2024-11-09 02:13:43,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 85 [2024-11-09 02:13:44,232 INFO L349 Elim1Store]: treesize reduction 79, result has 16.0 percent of original size [2024-11-09 02:13:44,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 130 treesize of output 112 [2024-11-09 02:13:44,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:13:44,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 167 treesize of output 79 [2024-11-09 02:13:44,484 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 64 proven. 56 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 02:13:44,485 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:13:44,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:13:44,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [276415360] [2024-11-09 02:13:44,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [276415360] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:13:44,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [316173318] [2024-11-09 02:13:44,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:44,799 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 02:13:44,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 02:13:44,801 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 02:13:44,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-09 02:13:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:45,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-09 02:13:45,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:13:46,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-09 02:13:47,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 71 [2024-11-09 02:13:47,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 82 [2024-11-09 02:13:48,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 99 [2024-11-09 02:13:48,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 110 [2024-11-09 02:13:49,718 INFO L349 Elim1Store]: treesize reduction 91, result has 14.2 percent of original size [2024-11-09 02:13:49,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 136 treesize of output 137 [2024-11-09 02:13:50,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 51 [2024-11-09 02:13:54,180 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 56 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 02:13:54,180 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:13:54,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [316173318] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:13:54,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 02:13:54,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2024-11-09 02:13:54,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659963372] [2024-11-09 02:13:54,313 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 02:13:54,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 02:13:54,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:13:54,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 02:13:54,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=544, Unknown=1, NotChecked=0, Total=650 [2024-11-09 02:13:54,314 INFO L87 Difference]: Start difference. First operand 100 states and 142 transitions. Second operand has 23 states, 23 states have (on average 3.9130434782608696) internal successors, (90), 22 states have internal predecessors, (90), 9 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-09 02:13:58,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 02:14:01,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:14:01,792 INFO L93 Difference]: Finished difference Result 370 states and 516 transitions. [2024-11-09 02:14:01,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 02:14:01,793 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.9130434782608696) internal successors, (90), 22 states have internal predecessors, (90), 9 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) Word has length 84 [2024-11-09 02:14:01,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:14:01,794 INFO L225 Difference]: With dead ends: 370 [2024-11-09 02:14:01,794 INFO L226 Difference]: Without dead ends: 273 [2024-11-09 02:14:01,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=271, Invalid=1060, Unknown=1, NotChecked=0, Total=1332 [2024-11-09 02:14:01,795 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 1361 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1361 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-11-09 02:14:01,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1361 Valid, 822 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1118 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2024-11-09 02:14:01,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-09 02:14:01,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 150. [2024-11-09 02:14:01,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 125 states have (on average 1.328) internal successors, (166), 125 states have internal predecessors, (166), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 02:14:01,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 202 transitions. [2024-11-09 02:14:01,818 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 202 transitions. Word has length 84 [2024-11-09 02:14:01,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:14:01,819 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 202 transitions. [2024-11-09 02:14:01,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.9130434782608696) internal successors, (90), 22 states have internal predecessors, (90), 9 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-09 02:14:01,819 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 202 transitions. [2024-11-09 02:14:01,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-09 02:14:01,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:14:01,820 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:14:01,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-11-09 02:14:02,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-09 02:14:02,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:14:02,221 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:14:02,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:14:02,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1303975955, now seen corresponding path program 1 times [2024-11-09 02:14:02,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:14:02,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1783721783] [2024-11-09 02:14:02,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:14:02,222 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:14:02,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:14:02,224 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:14:02,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 02:14:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:02,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 02:14:02,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:14:02,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:14:02,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 46 [2024-11-09 02:14:02,556 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 02:14:02,556 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:14:02,556 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:14:02,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1783721783] [2024-11-09 02:14:02,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1783721783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:14:02,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:14:02,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:14:02,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151620272] [2024-11-09 02:14:02,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:14:02,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:14:02,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:14:02,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:14:02,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:14:02,558 INFO L87 Difference]: Start difference. First operand 150 states and 202 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:14:04,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:14:04,647 INFO L93 Difference]: Finished difference Result 342 states and 462 transitions. [2024-11-09 02:14:04,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:14:04,648 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-09 02:14:04,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:14:04,651 INFO L225 Difference]: With dead ends: 342 [2024-11-09 02:14:04,651 INFO L226 Difference]: Without dead ends: 195 [2024-11-09 02:14:04,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:14:04,652 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 57 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:14:04,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 366 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 02:14:04,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-09 02:14:04,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 152. [2024-11-09 02:14:04,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 127 states have (on average 1.3228346456692914) internal successors, (168), 127 states have internal predecessors, (168), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 02:14:04,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 204 transitions. [2024-11-09 02:14:04,670 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 204 transitions. Word has length 84 [2024-11-09 02:14:04,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:14:04,670 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 204 transitions. [2024-11-09 02:14:04,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:14:04,670 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 204 transitions. [2024-11-09 02:14:04,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-09 02:14:04,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:14:04,672 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:14:04,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-09 02:14:04,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:14:04,873 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:14:04,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:14:04,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1363453396, now seen corresponding path program 1 times [2024-11-09 02:14:04,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:14:04,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [904725483] [2024-11-09 02:14:04,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:14:04,874 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:14:04,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:14:04,875 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:14:04,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-09 02:14:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:05,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 02:14:05,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:14:05,029 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 02:14:05,029 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:14:05,029 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:14:05,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [904725483] [2024-11-09 02:14:05,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [904725483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:14:05,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:14:05,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:14:05,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441494183] [2024-11-09 02:14:05,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:14:05,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:14:05,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:14:05,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:14:05,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:14:05,031 INFO L87 Difference]: Start difference. First operand 152 states and 204 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:14:05,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:14:05,076 INFO L93 Difference]: Finished difference Result 301 states and 405 transitions. [2024-11-09 02:14:05,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:14:05,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-09 02:14:05,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:14:05,077 INFO L225 Difference]: With dead ends: 301 [2024-11-09 02:14:05,077 INFO L226 Difference]: Without dead ends: 152 [2024-11-09 02:14:05,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:14:05,078 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:14:05,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 389 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:14:05,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-09 02:14:05,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2024-11-09 02:14:05,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 127 states have (on average 1.31496062992126) internal successors, (167), 127 states have internal predecessors, (167), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 02:14:05,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 203 transitions. [2024-11-09 02:14:05,093 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 203 transitions. Word has length 84 [2024-11-09 02:14:05,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:14:05,093 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 203 transitions. [2024-11-09 02:14:05,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:14:05,093 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 203 transitions. [2024-11-09 02:14:05,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-09 02:14:05,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:14:05,094 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:14:05,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-09 02:14:05,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:14:05,295 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:14:05,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:14:05,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1802536291, now seen corresponding path program 1 times [2024-11-09 02:14:05,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:14:05,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1248955761] [2024-11-09 02:14:05,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:14:05,296 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:14:05,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:14:05,297 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:14:05,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-09 02:14:05,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:05,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-09 02:14:05,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:14:05,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 02:14:06,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 55 [2024-11-09 02:14:06,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 55 [2024-11-09 02:14:07,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 55 [2024-11-09 02:14:07,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 63 [2024-11-09 02:14:07,943 INFO L349 Elim1Store]: treesize reduction 55, result has 21.4 percent of original size [2024-11-09 02:14:07,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 114 treesize of output 90 [2024-11-09 02:14:08,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 78 [2024-11-09 02:14:08,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:14:08,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 151 treesize of output 71 [2024-11-09 02:14:08,274 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-09 02:14:08,275 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:14:08,768 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:14:08,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1248955761] [2024-11-09 02:14:08,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1248955761] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:14:08,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [80698566] [2024-11-09 02:14:08,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:14:08,769 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 02:14:08,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 02:14:08,770 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 02:14:08,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-09 02:14:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:10,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-09 02:14:10,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:14:10,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2024-11-09 02:14:11,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 63 [2024-11-09 02:14:12,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 66 [2024-11-09 02:14:12,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 66 [2024-11-09 02:14:13,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 66 [2024-11-09 02:14:14,239 INFO L349 Elim1Store]: treesize reduction 55, result has 21.4 percent of original size [2024-11-09 02:14:14,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 114 treesize of output 90 [2024-11-09 02:14:14,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 78 [2024-11-09 02:14:14,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 115 [2024-11-09 02:14:14,929 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-09 02:14:14,930 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:14:16,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [80698566] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:14:16,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 02:14:16,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2024-11-09 02:14:16,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674131182] [2024-11-09 02:14:16,379 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 02:14:16,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 02:14:16,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:14:16,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 02:14:16,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2024-11-09 02:14:16,380 INFO L87 Difference]: Start difference. First operand 152 states and 203 transitions. Second operand has 21 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 20 states have internal predecessors, (80), 5 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2024-11-09 02:14:22,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.97s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 02:14:26,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 02:14:28,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:14:28,285 INFO L93 Difference]: Finished difference Result 432 states and 586 transitions. [2024-11-09 02:14:28,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 02:14:28,285 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 20 states have internal predecessors, (80), 5 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 85 [2024-11-09 02:14:28,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:14:28,287 INFO L225 Difference]: With dead ends: 432 [2024-11-09 02:14:28,287 INFO L226 Difference]: Without dead ends: 283 [2024-11-09 02:14:28,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 189 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=244, Invalid=1162, Unknown=0, NotChecked=0, Total=1406 [2024-11-09 02:14:28,288 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 1020 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 1131 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1020 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2024-11-09 02:14:28,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1020 Valid, 701 Invalid, 1206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1131 Invalid, 0 Unknown, 0 Unchecked, 10.5s Time] [2024-11-09 02:14:28,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-09 02:14:28,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 161. [2024-11-09 02:14:28,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 136 states have (on average 1.3308823529411764) internal successors, (181), 136 states have internal predecessors, (181), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 02:14:28,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 217 transitions. [2024-11-09 02:14:28,302 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 217 transitions. Word has length 85 [2024-11-09 02:14:28,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:14:28,302 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 217 transitions. [2024-11-09 02:14:28,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 20 states have internal predecessors, (80), 5 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2024-11-09 02:14:28,303 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 217 transitions. [2024-11-09 02:14:28,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-09 02:14:28,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:14:28,304 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:14:28,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2024-11-09 02:14:28,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-09 02:14:28,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:14:28,704 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:14:28,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:14:28,705 INFO L85 PathProgramCache]: Analyzing trace with hash -760820634, now seen corresponding path program 1 times [2024-11-09 02:14:28,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:14:28,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [340862061] [2024-11-09 02:14:28,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:14:28,705 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:14:28,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:14:28,706 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:14:28,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-09 02:14:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:28,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 02:14:28,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:14:28,954 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:14:28,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 36 [2024-11-09 02:14:28,996 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 02:14:28,996 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:14:28,996 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:14:28,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [340862061] [2024-11-09 02:14:28,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [340862061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:14:28,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:14:28,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:14:28,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527058170] [2024-11-09 02:14:28,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:14:28,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:14:28,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:14:28,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:14:28,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:14:28,998 INFO L87 Difference]: Start difference. First operand 161 states and 217 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:14:29,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:14:29,443 INFO L93 Difference]: Finished difference Result 355 states and 480 transitions. [2024-11-09 02:14:29,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:14:29,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 86 [2024-11-09 02:14:29,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:14:29,445 INFO L225 Difference]: With dead ends: 355 [2024-11-09 02:14:29,445 INFO L226 Difference]: Without dead ends: 197 [2024-11-09 02:14:29,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:14:29,445 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 48 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 02:14:29,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 345 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 02:14:29,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-09 02:14:29,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 162. [2024-11-09 02:14:29,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 137 states have (on average 1.3284671532846715) internal successors, (182), 137 states have internal predecessors, (182), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 02:14:29,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 218 transitions. [2024-11-09 02:14:29,470 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 218 transitions. Word has length 86 [2024-11-09 02:14:29,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:14:29,471 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 218 transitions. [2024-11-09 02:14:29,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 02:14:29,471 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 218 transitions. [2024-11-09 02:14:29,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-09 02:14:29,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:14:29,472 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:14:29,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-09 02:14:29,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:14:29,672 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:14:29,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:14:29,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1522767668, now seen corresponding path program 1 times [2024-11-09 02:14:29,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:14:29,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [821818690] [2024-11-09 02:14:29,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:14:29,673 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:14:29,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:14:29,674 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:14:29,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-09 02:14:29,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:29,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-09 02:14:29,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:14:30,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-09 02:14:30,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2024-11-09 02:14:31,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2024-11-09 02:14:31,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2024-11-09 02:14:31,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2024-11-09 02:14:31,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2024-11-09 02:14:32,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:14:32,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 35 [2024-11-09 02:14:32,191 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 36 proven. 80 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 02:14:32,191 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:14:32,609 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:14:32,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [821818690] [2024-11-09 02:14:32,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [821818690] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:14:32,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [254361852] [2024-11-09 02:14:32,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:14:32,611 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 02:14:32,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 02:14:32,612 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 02:14:32,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-11-09 02:14:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:33,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-09 02:14:33,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:14:33,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-11-09 02:14:35,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2024-11-09 02:14:37,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 51 [2024-11-09 02:14:37,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 62 [2024-11-09 02:14:38,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 63 [2024-11-09 02:14:39,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 75 [2024-11-09 02:14:39,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 36 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 86 [2024-11-09 02:14:43,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 65 [2024-11-09 02:14:44,007 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 52 proven. 80 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 02:14:44,007 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:14:53,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [254361852] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:14:53,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 02:14:53,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 25] total 38 [2024-11-09 02:14:53,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146941070] [2024-11-09 02:14:53,481 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 02:14:53,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-09 02:14:53,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:14:53,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-09 02:14:53,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1921, Unknown=4, NotChecked=0, Total=2256 [2024-11-09 02:14:53,483 INFO L87 Difference]: Start difference. First operand 162 states and 218 transitions. Second operand has 39 states, 35 states have (on average 3.0285714285714285) internal successors, (106), 33 states have internal predecessors, (106), 11 states have call successors, (18), 11 states have call predecessors, (18), 11 states have return successors, (18), 10 states have call predecessors, (18), 11 states have call successors, (18) [2024-11-09 02:15:01,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]