./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 8be7027f 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-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:52:20,312 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:52:20,379 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 07:52:20,382 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:52:20,383 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:52:20,411 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:52:20,413 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:52:20,413 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:52:20,414 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:52:20,415 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:52:20,416 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:52:20,416 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:52:20,417 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:52:20,417 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:52:20,419 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:52:20,420 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:52:20,420 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:52:20,420 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:52:20,420 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 07:52:20,420 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:52:20,421 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:52:20,421 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:52:20,421 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:52:20,421 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:52:20,421 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:52:20,422 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:52:20,422 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:52:20,422 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:52:20,422 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:52:20,422 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:52:20,423 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:52:20,423 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:52:20,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:52:20,423 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:52:20,423 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:52:20,424 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:52:20,425 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 07:52:20,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 07:52:20,425 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:52:20,426 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:52:20,426 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:52:20,426 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:52:20,426 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-12 07:52:20,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:52:20,654 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:52:20,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:52:20,657 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:52:20,658 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:52:20,659 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-12 07:52:21,901 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:52:22,073 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:52:22,073 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-47.i [2024-11-12 07:52:22,082 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb667217e/ab0fe18124124fb180823cc1f65790a2/FLAG69de75c3b [2024-11-12 07:52:22,093 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb667217e/ab0fe18124124fb180823cc1f65790a2 [2024-11-12 07:52:22,095 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:52:22,096 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:52:22,098 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:52:22,099 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:52:22,103 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:52:22,103 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:52:22" (1/1) ... [2024-11-12 07:52:22,104 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60cc6e29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:22, skipping insertion in model container [2024-11-12 07:52:22,104 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:52:22" (1/1) ... [2024-11-12 07:52:22,129 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:52:22,274 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-12 07:52:22,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:52:22,330 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:52:22,341 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-12 07:52:22,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:52:22,385 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:52:22,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:22 WrapperNode [2024-11-12 07:52:22,387 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:52:22,388 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:52:22,388 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:52:22,388 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:52:22,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:22" (1/1) ... [2024-11-12 07:52:22,405 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:22" (1/1) ... [2024-11-12 07:52:22,435 INFO L138 Inliner]: procedures = 29, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 460 [2024-11-12 07:52:22,436 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:52:22,436 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:52:22,436 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:52:22,437 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:52:22,446 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:22" (1/1) ... [2024-11-12 07:52:22,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:22" (1/1) ... [2024-11-12 07:52:22,450 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:22" (1/1) ... [2024-11-12 07:52:22,470 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-12 07:52:22,470 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:22" (1/1) ... [2024-11-12 07:52:22,470 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:22" (1/1) ... [2024-11-12 07:52:22,481 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:22" (1/1) ... [2024-11-12 07:52:22,487 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:22" (1/1) ... [2024-11-12 07:52:22,491 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:22" (1/1) ... [2024-11-12 07:52:22,494 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:22" (1/1) ... [2024-11-12 07:52:22,499 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:52:22,500 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:52:22,501 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:52:22,501 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:52:22,501 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:22" (1/1) ... [2024-11-12 07:52:22,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:52:22,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:52:22,533 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-12 07:52:22,537 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-12 07:52:22,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:52:22,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-12 07:52:22,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-12 07:52:22,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 07:52:22,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 07:52:22,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-12 07:52:22,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-12 07:52:22,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 07:52:22,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 07:52:22,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-12 07:52:22,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-12 07:52:22,568 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:52:22,568 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:52:22,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 07:52:22,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 07:52:22,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:52:22,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:52:22,653 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:52:22,655 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:52:23,038 INFO L? ?]: Removed 130 outVars from TransFormulas that were not future-live. [2024-11-12 07:52:23,038 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:52:23,052 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:52:23,052 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:52:23,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:52:23 BoogieIcfgContainer [2024-11-12 07:52:23,052 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:52:23,054 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:52:23,054 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:52:23,056 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:52:23,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:52:22" (1/3) ... [2024-11-12 07:52:23,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6afe849c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:52:23, skipping insertion in model container [2024-11-12 07:52:23,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:22" (2/3) ... [2024-11-12 07:52:23,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6afe849c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:52:23, skipping insertion in model container [2024-11-12 07:52:23,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:52:23" (3/3) ... [2024-11-12 07:52:23,058 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-47.i [2024-11-12 07:52:23,072 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:52:23,072 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:52:23,118 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:52:23,122 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;@1eef77f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:52:23,122 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:52:23,125 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-12 07:52:23,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-12 07:52:23,132 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:52:23,133 INFO L218 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-12 07:52:23,134 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:52:23,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:52:23,138 INFO L85 PathProgramCache]: Analyzing trace with hash -766083450, now seen corresponding path program 1 times [2024-11-12 07:52:23,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:52:23,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520854469] [2024-11-12 07:52:23,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:52:23,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:52:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:23,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:52:23,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:23,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-12 07:52:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:23,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:52:23,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:23,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:52:23,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:23,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:52:23,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:23,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:52:23,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:23,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:52:23,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:23,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:52:23,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:23,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:52:23,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:23,392 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-12 07:52:23,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:52:23,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520854469] [2024-11-12 07:52:23,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520854469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:52:23,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:52:23,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:52:23,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009315060] [2024-11-12 07:52:23,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:52:23,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:52:23,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:52:23,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:52:23,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:52:23,423 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-12 07:52:23,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:52:23,443 INFO L93 Difference]: Finished difference Result 185 states and 285 transitions. [2024-11-12 07:52:23,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:52:23,445 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-12 07:52:23,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:52:23,450 INFO L225 Difference]: With dead ends: 185 [2024-11-12 07:52:23,451 INFO L226 Difference]: Without dead ends: 92 [2024-11-12 07:52:23,453 INFO L434 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-12 07:52:23,456 INFO L435 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-12 07:52:23,456 INFO L436 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-12 07:52:23,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-12 07:52:23,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-12 07:52:23,487 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-12 07:52:23,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-11-12 07:52:23,489 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 84 [2024-11-12 07:52:23,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:52:23,489 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-11-12 07:52:23,490 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-12 07:52:23,490 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-11-12 07:52:23,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-12 07:52:23,492 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:52:23,492 INFO L218 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-12 07:52:23,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 07:52:23,493 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:52:23,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:52:23,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1428001612, now seen corresponding path program 1 times [2024-11-12 07:52:23,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:52:23,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321103924] [2024-11-12 07:52:23,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:52:23,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:52:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:23,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:52:23,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:23,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-12 07:52:23,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:23,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:52:23,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:23,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:52:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:23,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:52:23,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:23,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:52:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:23,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:52:23,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:23,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:52:23,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:23,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:52:23,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:23,689 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-12 07:52:23,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:52:23,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321103924] [2024-11-12 07:52:23,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321103924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:52:23,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:52:23,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:52:23,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189688560] [2024-11-12 07:52:23,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:52:23,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:52:23,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:52:23,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:52:23,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:52:23,694 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-12 07:52:23,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:52:23,721 INFO L93 Difference]: Finished difference Result 182 states and 267 transitions. [2024-11-12 07:52:23,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:52:23,722 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-12 07:52:23,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:52:23,723 INFO L225 Difference]: With dead ends: 182 [2024-11-12 07:52:23,723 INFO L226 Difference]: Without dead ends: 93 [2024-11-12 07:52:23,724 INFO L434 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-12 07:52:23,725 INFO L435 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-12 07:52:23,725 INFO L436 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-12 07:52:23,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-12 07:52:23,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-12 07:52:23,733 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-12 07:52:23,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2024-11-12 07:52:23,735 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 84 [2024-11-12 07:52:23,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:52:23,736 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2024-11-12 07:52:23,737 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-12 07:52:23,737 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2024-11-12 07:52:23,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-12 07:52:23,740 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:52:23,741 INFO L218 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-12 07:52:23,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 07:52:23,742 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:52:23,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:52:23,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1178021942, now seen corresponding path program 1 times [2024-11-12 07:52:23,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:52:23,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852509332] [2024-11-12 07:52:23,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:52:23,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:52:23,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:52:24,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-12 07:52:24,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:52:24,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:52:24,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:52:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:52:24,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:52:24,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:52:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:52:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,035 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-12 07:52:24,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:52:24,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852509332] [2024-11-12 07:52:24,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852509332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:52:24,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:52:24,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:52:24,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208516277] [2024-11-12 07:52:24,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:52:24,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:52:24,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:52:24,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:52:24,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:52:24,041 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-12 07:52:24,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:52:24,091 INFO L93 Difference]: Finished difference Result 186 states and 271 transitions. [2024-11-12 07:52:24,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:52:24,092 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-12 07:52:24,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:52:24,093 INFO L225 Difference]: With dead ends: 186 [2024-11-12 07:52:24,093 INFO L226 Difference]: Without dead ends: 96 [2024-11-12 07:52:24,094 INFO L434 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-12 07:52:24,094 INFO L435 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-12 07:52:24,095 INFO L436 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-12 07:52:24,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-12 07:52:24,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-12 07:52:24,106 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-12 07:52:24,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2024-11-12 07:52:24,109 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 84 [2024-11-12 07:52:24,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:52:24,110 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2024-11-12 07:52:24,110 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-12 07:52:24,110 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2024-11-12 07:52:24,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-12 07:52:24,114 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:52:24,114 INFO L218 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-12 07:52:24,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 07:52:24,114 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:52:24,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:52:24,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1605540184, now seen corresponding path program 1 times [2024-11-12 07:52:24,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:52:24,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717467706] [2024-11-12 07:52:24,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:52:24,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:52:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:52:24,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-12 07:52:24,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:52:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:52:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:52:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:52:24,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:52:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:52:24,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:52:24,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:24,276 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-12 07:52:24,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:52:24,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717467706] [2024-11-12 07:52:24,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717467706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:52:24,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:52:24,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:52:24,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918405735] [2024-11-12 07:52:24,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:52:24,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:52:24,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:52:24,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:52:24,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:52:24,278 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-12 07:52:24,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:52:24,302 INFO L93 Difference]: Finished difference Result 192 states and 277 transitions. [2024-11-12 07:52:24,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:52:24,302 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-12 07:52:24,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:52:24,304 INFO L225 Difference]: With dead ends: 192 [2024-11-12 07:52:24,304 INFO L226 Difference]: Without dead ends: 99 [2024-11-12 07:52:24,304 INFO L434 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-12 07:52:24,305 INFO L435 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-12 07:52:24,305 INFO L436 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-12 07:52:24,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-12 07:52:24,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2024-11-12 07:52:24,310 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-12 07:52:24,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2024-11-12 07:52:24,311 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 84 [2024-11-12 07:52:24,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:52:24,311 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2024-11-12 07:52:24,311 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-12 07:52:24,311 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2024-11-12 07:52:24,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-12 07:52:24,312 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:52:24,312 INFO L218 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-12 07:52:24,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 07:52:24,313 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:52:24,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:52:24,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1603693142, now seen corresponding path program 1 times [2024-11-12 07:52:24,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:52:24,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449209182] [2024-11-12 07:52:24,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:52:24,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:52:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:52:24,402 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 07:52:24,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:52:24,480 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 07:52:24,480 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 07:52:24,482 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 07:52:24,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 07:52:24,486 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-12 07:52:24,566 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 07:52:24,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 07:52:24 BoogieIcfgContainer [2024-11-12 07:52:24,569 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 07:52:24,570 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 07:52:24,570 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 07:52:24,570 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 07:52:24,570 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:52:23" (3/4) ... [2024-11-12 07:52:24,574 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 07:52:24,575 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 07:52:24,575 INFO L158 Benchmark]: Toolchain (without parser) took 2479.15ms. Allocated memory was 163.6MB in the beginning and 230.7MB in the end (delta: 67.1MB). Free memory was 108.7MB in the beginning and 74.6MB in the end (delta: 34.1MB). Peak memory consumption was 101.6MB. Max. memory is 16.1GB. [2024-11-12 07:52:24,576 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 163.6MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:52:24,577 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.18ms. Allocated memory is still 163.6MB. Free memory was 108.3MB in the beginning and 92.5MB in the end (delta: 15.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 07:52:24,577 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.45ms. Allocated memory is still 163.6MB. Free memory was 92.5MB in the beginning and 89.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 07:52:24,578 INFO L158 Benchmark]: Boogie Preprocessor took 63.44ms. Allocated memory is still 163.6MB. Free memory was 89.1MB in the beginning and 85.3MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 07:52:24,578 INFO L158 Benchmark]: RCFGBuilder took 552.05ms. Allocated memory is still 163.6MB. Free memory was 85.3MB in the beginning and 115.3MB in the end (delta: -30.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-12 07:52:24,578 INFO L158 Benchmark]: TraceAbstraction took 1515.47ms. Allocated memory was 163.6MB in the beginning and 230.7MB in the end (delta: 67.1MB). Free memory was 115.3MB in the beginning and 75.6MB in the end (delta: 39.6MB). Peak memory consumption was 108.6MB. Max. memory is 16.1GB. [2024-11-12 07:52:24,578 INFO L158 Benchmark]: Witness Printer took 5.17ms. Allocated memory is still 230.7MB. Free memory was 75.6MB in the beginning and 74.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:52:24,579 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.13ms. Allocated memory is still 163.6MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 289.18ms. Allocated memory is still 163.6MB. Free memory was 108.3MB in the beginning and 92.5MB in the end (delta: 15.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.45ms. Allocated memory is still 163.6MB. Free memory was 92.5MB in the beginning and 89.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.44ms. Allocated memory is still 163.6MB. Free memory was 89.1MB in the beginning and 85.3MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 552.05ms. Allocated memory is still 163.6MB. Free memory was 85.3MB in the beginning and 115.3MB in the end (delta: -30.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1515.47ms. Allocated memory was 163.6MB in the beginning and 230.7MB in the end (delta: 67.1MB). Free memory was 115.3MB in the beginning and 75.6MB in the end (delta: 39.6MB). Peak memory consumption was 108.6MB. Max. memory is 16.1GB. * Witness Printer took 5.17ms. Allocated memory is still 230.7MB. Free memory was 75.6MB in the beginning and 74.6MB in the end (delta: 1.0MB). There was no memory consumed. 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.4s, 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.6s 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-12 07:52:24,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:52:26,422 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:52:26,487 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 07:52:26,493 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:52:26,495 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:52:26,520 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:52:26,525 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:52:26,525 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:52:26,526 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:52:26,527 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:52:26,527 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:52:26,527 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:52:26,528 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:52:26,528 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:52:26,530 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:52:26,530 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:52:26,530 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:52:26,531 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:52:26,531 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:52:26,531 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:52:26,531 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:52:26,532 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:52:26,532 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:52:26,533 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 07:52:26,533 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 07:52:26,536 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:52:26,536 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 07:52:26,536 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:52:26,536 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:52:26,537 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:52:26,537 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:52:26,537 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:52:26,537 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:52:26,537 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:52:26,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:52:26,538 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:52:26,538 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:52:26,538 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:52:26,538 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 07:52:26,539 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 07:52:26,539 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:52:26,539 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:52:26,540 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:52:26,540 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:52:26,540 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-12 07:52:26,812 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:52:26,828 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:52:26,831 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:52:26,832 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:52:26,832 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:52:26,833 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-12 07:52:28,152 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:52:28,339 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:52:28,340 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-47.i [2024-11-12 07:52:28,347 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b8234465/c1c05abd42ca4983945aa1c2a07320a9/FLAGf17c6a46c [2024-11-12 07:52:28,729 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b8234465/c1c05abd42ca4983945aa1c2a07320a9 [2024-11-12 07:52:28,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:52:28,732 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:52:28,733 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:52:28,734 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:52:28,737 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:52:28,738 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:52:28" (1/1) ... [2024-11-12 07:52:28,739 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61d23e0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:28, skipping insertion in model container [2024-11-12 07:52:28,739 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:52:28" (1/1) ... [2024-11-12 07:52:28,755 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:52:28,906 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-12 07:52:28,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:52:29,009 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:52:29,019 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-12 07:52:29,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:52:29,076 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:52:29,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:29 WrapperNode [2024-11-12 07:52:29,076 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:52:29,077 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:52:29,077 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:52:29,078 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:52:29,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:29" (1/1) ... [2024-11-12 07:52:29,101 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:29" (1/1) ... [2024-11-12 07:52:29,134 INFO L138 Inliner]: procedures = 33, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 458 [2024-11-12 07:52:29,134 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:52:29,135 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:52:29,135 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:52:29,135 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:52:29,151 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:29" (1/1) ... [2024-11-12 07:52:29,151 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:29" (1/1) ... [2024-11-12 07:52:29,158 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:29" (1/1) ... [2024-11-12 07:52:29,181 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-12 07:52:29,182 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:29" (1/1) ... [2024-11-12 07:52:29,182 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:29" (1/1) ... [2024-11-12 07:52:29,193 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:29" (1/1) ... [2024-11-12 07:52:29,196 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:29" (1/1) ... [2024-11-12 07:52:29,198 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:29" (1/1) ... [2024-11-12 07:52:29,200 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:29" (1/1) ... [2024-11-12 07:52:29,203 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:52:29,204 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:52:29,204 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:52:29,204 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:52:29,205 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:29" (1/1) ... [2024-11-12 07:52:29,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:52:29,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:52:29,236 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-12 07:52:29,239 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-12 07:52:29,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:52:29,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-12 07:52:29,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-12 07:52:29,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-12 07:52:29,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-12 07:52:29,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-12 07:52:29,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-12 07:52:29,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 07:52:29,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-12 07:52:29,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-12 07:52:29,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-12 07:52:29,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-12 07:52:29,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-12 07:52:29,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-12 07:52:29,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-12 07:52:29,280 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:52:29,280 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:52:29,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:52:29,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:52:29,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-12 07:52:29,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-12 07:52:29,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-12 07:52:29,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-12 07:52:29,398 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:52:29,400 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:52:29,884 INFO L? ?]: Removed 132 outVars from TransFormulas that were not future-live. [2024-11-12 07:52:29,885 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:52:29,897 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:52:29,897 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:52:29,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:52:29 BoogieIcfgContainer [2024-11-12 07:52:29,898 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:52:29,899 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:52:29,900 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:52:29,902 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:52:29,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:52:28" (1/3) ... [2024-11-12 07:52:29,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21944c78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:52:29, skipping insertion in model container [2024-11-12 07:52:29,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:52:29" (2/3) ... [2024-11-12 07:52:29,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21944c78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:52:29, skipping insertion in model container [2024-11-12 07:52:29,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:52:29" (3/3) ... [2024-11-12 07:52:29,904 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-47.i [2024-11-12 07:52:29,915 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:52:29,915 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:52:29,974 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:52:29,979 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;@4133cf99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:52:29,979 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:52:29,983 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-12 07:52:29,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-12 07:52:29,992 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:52:29,993 INFO L218 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-12 07:52:29,993 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:52:29,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:52:29,998 INFO L85 PathProgramCache]: Analyzing trace with hash -766083450, now seen corresponding path program 1 times [2024-11-12 07:52:30,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:52:30,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1056414476] [2024-11-12 07:52:30,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:52:30,010 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-12 07:52:30,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:52:30,013 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-12 07:52:30,014 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-12 07:52:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:30,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 07:52:30,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:52:30,269 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-12 07:52:30,270 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:52:30,270 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:52:30,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1056414476] [2024-11-12 07:52:30,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1056414476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:52:30,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:52:30,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:52:30,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718610116] [2024-11-12 07:52:30,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:52:30,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:52:30,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:52:30,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:52:30,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:52:30,299 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-12 07:52:30,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:52:30,321 INFO L93 Difference]: Finished difference Result 185 states and 285 transitions. [2024-11-12 07:52:30,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:52:30,323 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-12 07:52:30,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:52:30,330 INFO L225 Difference]: With dead ends: 185 [2024-11-12 07:52:30,331 INFO L226 Difference]: Without dead ends: 92 [2024-11-12 07:52:30,333 INFO L434 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-12 07:52:30,338 INFO L435 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-12 07:52:30,339 INFO L436 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-12 07:52:30,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-12 07:52:30,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-12 07:52:30,369 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-12 07:52:30,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-11-12 07:52:30,372 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 84 [2024-11-12 07:52:30,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:52:30,372 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-11-12 07:52:30,372 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-12 07:52:30,373 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-11-12 07:52:30,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-12 07:52:30,375 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:52:30,375 INFO L218 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-12 07:52:30,383 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-12 07:52:30,575 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-12 07:52:30,576 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:52:30,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:52:30,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1428001612, now seen corresponding path program 1 times [2024-11-12 07:52:30,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:52:30,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2074597761] [2024-11-12 07:52:30,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:52:30,578 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-12 07:52:30,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:52:30,581 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-12 07:52:30,582 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-12 07:52:30,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:30,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 07:52:30,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:52:30,813 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-12 07:52:30,814 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:52:30,814 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:52:30,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2074597761] [2024-11-12 07:52:30,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2074597761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:52:30,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:52:30,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:52:30,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616740025] [2024-11-12 07:52:30,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:52:30,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:52:30,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:52:30,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:52:30,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:52:30,817 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-12 07:52:30,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:52:30,964 INFO L93 Difference]: Finished difference Result 182 states and 267 transitions. [2024-11-12 07:52:30,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:52:30,965 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-12 07:52:30,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:52:30,966 INFO L225 Difference]: With dead ends: 182 [2024-11-12 07:52:30,966 INFO L226 Difference]: Without dead ends: 93 [2024-11-12 07:52:30,967 INFO L434 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-12 07:52:30,968 INFO L435 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-12 07:52:30,968 INFO L436 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-12 07:52:30,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-12 07:52:30,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-12 07:52:30,975 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-12 07:52:30,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2024-11-12 07:52:30,976 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 84 [2024-11-12 07:52:30,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:52:30,978 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2024-11-12 07:52:30,978 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-12 07:52:30,978 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2024-11-12 07:52:30,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-12 07:52:30,980 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:52:30,980 INFO L218 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-12 07:52:30,987 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 (3)] Forceful destruction successful, exit code 0 [2024-11-12 07:52:31,180 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-12 07:52:31,181 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:52:31,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:52:31,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1178021942, now seen corresponding path program 1 times [2024-11-12 07:52:31,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:52:31,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1569130398] [2024-11-12 07:52:31,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:52:31,183 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-12 07:52:31,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:52:31,184 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-12 07:52:31,185 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-12 07:52:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:31,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 07:52:31,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:52:31,427 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-12 07:52:31,427 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:52:31,427 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:52:31,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1569130398] [2024-11-12 07:52:31,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1569130398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:52:31,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:52:31,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:52:31,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575197543] [2024-11-12 07:52:31,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:52:31,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:52:31,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:52:31,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:52:31,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:52:31,429 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-12 07:52:31,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:52:31,941 INFO L93 Difference]: Finished difference Result 186 states and 271 transitions. [2024-11-12 07:52:31,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:52:31,942 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-12 07:52:31,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:52:31,943 INFO L225 Difference]: With dead ends: 186 [2024-11-12 07:52:31,943 INFO L226 Difference]: Without dead ends: 96 [2024-11-12 07:52:31,943 INFO L434 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-12 07:52:31,944 INFO L435 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-12 07:52:31,944 INFO L436 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-12 07:52:31,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-12 07:52:31,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-12 07:52:31,951 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-12 07:52:31,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2024-11-12 07:52:31,952 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 84 [2024-11-12 07:52:31,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:52:31,952 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2024-11-12 07:52:31,955 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-12 07:52:31,955 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2024-11-12 07:52:31,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-12 07:52:31,958 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:52:31,958 INFO L218 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-12 07:52:31,967 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-12 07:52:32,162 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-12 07:52:32,163 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:52:32,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:52:32,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1605540184, now seen corresponding path program 1 times [2024-11-12 07:52:32,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:52:32,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [777819843] [2024-11-12 07:52:32,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:52:32,166 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-12 07:52:32,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:52:32,168 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-12 07:52:32,169 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-12 07:52:32,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:32,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 07:52:32,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:52:32,375 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-12 07:52:32,375 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:52:32,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:52:32,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [777819843] [2024-11-12 07:52:32,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [777819843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:52:32,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:52:32,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:52:32,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909434045] [2024-11-12 07:52:32,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:52:32,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:52:32,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:52:32,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:52:32,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:52:32,377 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-12 07:52:33,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 07:52:33,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:52:33,946 INFO L93 Difference]: Finished difference Result 194 states and 280 transitions. [2024-11-12 07:52:33,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:52:33,947 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-12 07:52:33,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:52:33,948 INFO L225 Difference]: With dead ends: 194 [2024-11-12 07:52:33,948 INFO L226 Difference]: Without dead ends: 101 [2024-11-12 07:52:33,949 INFO L434 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-12 07:52:33,950 INFO L435 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.6s IncrementalHoareTripleChecker+Time [2024-11-12 07:52:33,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 503 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-12 07:52:33,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-12 07:52:33,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-11-12 07:52:33,959 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-12 07:52:33,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2024-11-12 07:52:33,960 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 84 [2024-11-12 07:52:33,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:52:33,960 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2024-11-12 07:52:33,961 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-12 07:52:33,961 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2024-11-12 07:52:33,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-12 07:52:33,966 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:52:33,966 INFO L218 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-12 07:52:33,976 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-12 07:52:34,166 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-12 07:52:34,167 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:52:34,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:52:34,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1603693142, now seen corresponding path program 1 times [2024-11-12 07:52:34,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:52:34,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [575663102] [2024-11-12 07:52:34,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:52:34,168 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-12 07:52:34,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:52:34,171 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-12 07:52:34,172 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-12 07:52:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:34,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-12 07:52:34,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:52:34,654 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-12 07:52:35,283 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-12 07:52:35,625 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-12 07:52:36,122 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-12 07:52:36,681 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-12 07:52:37,265 INFO L349 Elim1Store]: treesize reduction 79, result has 16.0 percent of original size [2024-11-12 07:52:37,266 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-12 07:52:37,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:52:37,521 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-12 07:52:37,604 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-12 07:52:37,604 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:52:37,923 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:52:37,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [575663102] [2024-11-12 07:52:37,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [575663102] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:52:37,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [441102036] [2024-11-12 07:52:37,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:52:37,923 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 07:52:37,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 07:52:37,926 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-12 07:52:37,927 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-12 07:52:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:39,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-12 07:52:39,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:52:39,366 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-12 07:52:40,293 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-12 07:52:40,932 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-12 07:52:41,513 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-12 07:52:42,145 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-12 07:52:42,839 INFO L349 Elim1Store]: treesize reduction 91, result has 14.2 percent of original size [2024-11-12 07:52:42,840 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-12 07:52:43,122 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-12 07:52:47,319 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-12 07:52:47,319 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:52:47,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [441102036] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:52:47,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 07:52:47,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2024-11-12 07:52:47,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511163803] [2024-11-12 07:52:47,455 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 07:52:47,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-12 07:52:47,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:52:47,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-12 07:52:47,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=544, Unknown=1, NotChecked=0, Total=650 [2024-11-12 07:52:47,456 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-12 07:52:53,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:52:53,060 INFO L93 Difference]: Finished difference Result 370 states and 516 transitions. [2024-11-12 07:52:53,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 07:52:53,061 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-12 07:52:53,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:52:53,062 INFO L225 Difference]: With dead ends: 370 [2024-11-12 07:52:53,062 INFO L226 Difference]: Without dead ends: 273 [2024-11-12 07:52:53,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=271, Invalid=1060, Unknown=1, NotChecked=0, Total=1332 [2024-11-12 07:52:53,064 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 1361 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.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, 4.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:52:53,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1361 Valid, 822 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1118 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-12 07:52:53,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-12 07:52:53,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 150. [2024-11-12 07:52:53,082 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-12 07:52:53,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 202 transitions. [2024-11-12 07:52:53,083 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 202 transitions. Word has length 84 [2024-11-12 07:52:53,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:52:53,083 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 202 transitions. [2024-11-12 07:52:53,084 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-12 07:52:53,084 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 202 transitions. [2024-11-12 07:52:53,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-12 07:52:53,085 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:52:53,085 INFO L218 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-12 07:52:53,100 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-12 07:52:53,295 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 (6)] Forceful destruction successful, exit code 0 [2024-11-12 07:52:53,487 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-12 07:52:53,487 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:52:53,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:52:53,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1303975955, now seen corresponding path program 1 times [2024-11-12 07:52:53,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:52:53,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [489883039] [2024-11-12 07:52:53,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:52:53,488 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-12 07:52:53,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:52:53,491 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-12 07:52:53,491 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-12 07:52:53,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:53,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 07:52:53,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:52:53,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:52:53,766 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-12 07:52:53,871 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-12 07:52:53,872 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:52:53,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:52:53,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [489883039] [2024-11-12 07:52:53,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [489883039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:52:53,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:52:53,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:52:53,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092727583] [2024-11-12 07:52:53,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:52:53,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:52:53,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:52:53,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:52:53,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:52:53,873 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-12 07:52:56,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:52:56,071 INFO L93 Difference]: Finished difference Result 342 states and 462 transitions. [2024-11-12 07:52:56,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:52:56,071 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-12 07:52:56,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:52:56,073 INFO L225 Difference]: With dead ends: 342 [2024-11-12 07:52:56,073 INFO L226 Difference]: Without dead ends: 195 [2024-11-12 07:52:56,074 INFO L434 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-12 07:52:56,075 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 57 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:52:56,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 366 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-12 07:52:56,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-12 07:52:56,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 152. [2024-11-12 07:52:56,088 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-12 07:52:56,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 204 transitions. [2024-11-12 07:52:56,089 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 204 transitions. Word has length 84 [2024-11-12 07:52:56,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:52:56,089 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 204 transitions. [2024-11-12 07:52:56,089 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-12 07:52:56,090 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 204 transitions. [2024-11-12 07:52:56,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-12 07:52:56,091 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:52:56,091 INFO L218 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-12 07:52:56,100 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-12 07:52:56,291 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-12 07:52:56,292 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:52:56,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:52:56,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1363453396, now seen corresponding path program 1 times [2024-11-12 07:52:56,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:52:56,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1637509098] [2024-11-12 07:52:56,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:52:56,293 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-12 07:52:56,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:52:56,295 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-12 07:52:56,296 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-12 07:52:56,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:56,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 07:52:56,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:52:56,451 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-12 07:52:56,451 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:52:56,451 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:52:56,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1637509098] [2024-11-12 07:52:56,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1637509098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:52:56,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:52:56,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:52:56,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540936440] [2024-11-12 07:52:56,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:52:56,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:52:56,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:52:56,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:52:56,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:52:56,453 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-12 07:52:56,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:52:56,501 INFO L93 Difference]: Finished difference Result 301 states and 405 transitions. [2024-11-12 07:52:56,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:52:56,502 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-12 07:52:56,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:52:56,503 INFO L225 Difference]: With dead ends: 301 [2024-11-12 07:52:56,503 INFO L226 Difference]: Without dead ends: 152 [2024-11-12 07:52:56,503 INFO L434 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-12 07:52:56,504 INFO L435 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-12 07:52:56,504 INFO L436 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-12 07:52:56,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-12 07:52:56,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2024-11-12 07:52:56,518 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-12 07:52:56,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 203 transitions. [2024-11-12 07:52:56,520 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 203 transitions. Word has length 84 [2024-11-12 07:52:56,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:52:56,521 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 203 transitions. [2024-11-12 07:52:56,521 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-12 07:52:56,521 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 203 transitions. [2024-11-12 07:52:56,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-12 07:52:56,523 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:52:56,523 INFO L218 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-12 07:52:56,530 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-12 07:52:56,724 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-12 07:52:56,724 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:52:56,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:52:56,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1802536291, now seen corresponding path program 1 times [2024-11-12 07:52:56,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:52:56,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1242344034] [2024-11-12 07:52:56,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:52:56,725 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-12 07:52:56,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:52:56,726 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-12 07:52:56,727 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-12 07:52:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:52:56,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-12 07:52:56,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:52:57,096 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-12 07:52:57,657 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-12 07:52:58,067 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-12 07:52:58,474 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-12 07:52:58,865 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-12 07:52:59,307 INFO L349 Elim1Store]: treesize reduction 55, result has 21.4 percent of original size [2024-11-12 07:52:59,307 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-12 07:52:59,460 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-12 07:52:59,564 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:52:59,564 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-12 07:52:59,634 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-12 07:52:59,634 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:53:00,274 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:53:00,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1242344034] [2024-11-12 07:53:00,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1242344034] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:53:00,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [311136657] [2024-11-12 07:53:00,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:53:00,275 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 07:53:00,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 07:53:00,276 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-12 07:53:00,277 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-12 07:53:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:53:01,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-12 07:53:01,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:53:01,818 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-12 07:53:02,875 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-12 07:53:03,699 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-12 07:53:04,379 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-12 07:53:05,021 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-12 07:53:05,763 INFO L349 Elim1Store]: treesize reduction 55, result has 21.4 percent of original size [2024-11-12 07:53:05,764 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-12 07:53:06,041 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-12 07:53:06,193 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-12 07:53:06,468 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-12 07:53:06,469 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:53:07,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [311136657] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:53:07,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 07:53:07,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2024-11-12 07:53:07,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500800257] [2024-11-12 07:53:07,727 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 07:53:07,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-12 07:53:07,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:53:07,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-12 07:53:07,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2024-11-12 07:53:07,729 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-12 07:53:12,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:53:12,858 INFO L93 Difference]: Finished difference Result 432 states and 586 transitions. [2024-11-12 07:53:12,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 07:53:12,859 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-12 07:53:12,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:53:12,861 INFO L225 Difference]: With dead ends: 432 [2024-11-12 07:53:12,861 INFO L226 Difference]: Without dead ends: 283 [2024-11-12 07:53:12,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 189 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=244, Invalid=1162, Unknown=0, NotChecked=0, Total=1406 [2024-11-12 07:53:12,862 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 1020 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 1131 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.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, 3.5s IncrementalHoareTripleChecker+Time [2024-11-12 07:53:12,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1020 Valid, 701 Invalid, 1206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1131 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-12 07:53:12,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-12 07:53:12,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 161. [2024-11-12 07:53:12,877 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-12 07:53:12,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 217 transitions. [2024-11-12 07:53:12,878 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 217 transitions. Word has length 85 [2024-11-12 07:53:12,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:53:12,878 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 217 transitions. [2024-11-12 07:53:12,878 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-12 07:53:12,878 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 217 transitions. [2024-11-12 07:53:12,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-12 07:53:12,879 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:53:12,879 INFO L218 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-12 07:53:12,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2024-11-12 07:53:13,088 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-12 07:53:13,280 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-12 07:53:13,280 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:53:13,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:53:13,281 INFO L85 PathProgramCache]: Analyzing trace with hash -760820634, now seen corresponding path program 1 times [2024-11-12 07:53:13,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:53:13,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1528640187] [2024-11-12 07:53:13,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:53:13,281 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-12 07:53:13,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:53:13,282 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-12 07:53:13,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 (12)] Waiting until timeout for monitored process [2024-11-12 07:53:13,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:53:13,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 07:53:13,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:53:13,500 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:53:13,500 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-12 07:53:13,555 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-12 07:53:13,555 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:53:13,555 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:53:13,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1528640187] [2024-11-12 07:53:13,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1528640187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:53:13,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:53:13,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:53:13,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042631823] [2024-11-12 07:53:13,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:53:13,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:53:13,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:53:13,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:53:13,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:53:13,557 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-12 07:53:14,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:53:14,005 INFO L93 Difference]: Finished difference Result 355 states and 480 transitions. [2024-11-12 07:53:14,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:53:14,005 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-12 07:53:14,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:53:14,006 INFO L225 Difference]: With dead ends: 355 [2024-11-12 07:53:14,007 INFO L226 Difference]: Without dead ends: 197 [2024-11-12 07:53:14,007 INFO L434 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-12 07:53:14,007 INFO L435 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-12 07:53:14,007 INFO L436 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-12 07:53:14,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-12 07:53:14,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 162. [2024-11-12 07:53:14,024 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-12 07:53:14,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 218 transitions. [2024-11-12 07:53:14,025 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 218 transitions. Word has length 86 [2024-11-12 07:53:14,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:53:14,026 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 218 transitions. [2024-11-12 07:53:14,026 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-12 07:53:14,026 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 218 transitions. [2024-11-12 07:53:14,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-12 07:53:14,027 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:53:14,027 INFO L218 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-12 07:53:14,035 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 (12)] Ended with exit code 0 [2024-11-12 07:53:14,227 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-12 07:53:14,228 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:53:14,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:53:14,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1522767668, now seen corresponding path program 1 times [2024-11-12 07:53:14,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:53:14,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1539591447] [2024-11-12 07:53:14,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:53:14,228 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-12 07:53:14,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:53:14,230 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-12 07:53:14,230 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-12 07:53:14,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:53:14,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-12 07:53:14,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:53:14,661 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-12 07:53:15,215 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-12 07:53:15,556 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-12 07:53:15,904 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-12 07:53:16,191 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-12 07:53:16,326 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-12 07:53:16,509 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:53:16,509 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-12 07:53:16,566 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-12 07:53:16,567 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:53:16,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:53:16,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1539591447] [2024-11-12 07:53:16,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1539591447] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:53:16,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1712565287] [2024-11-12 07:53:16,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:53:16,970 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 07:53:16,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 07:53:16,971 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-12 07:53:16,973 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-12 07:53:17,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:53:17,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-12 07:53:17,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:53:17,987 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-12 07:53:20,096 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-12 07:53:21,527 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-12 07:53:22,248 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-12 07:53:23,041 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-12 07:53:23,829 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-12 07:53:24,142 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-12 07:53:27,917 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-12 07:53:27,928 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-12 07:53:27,928 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:53:37,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1712565287] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:53:37,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 07:53:37,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 25] total 38 [2024-11-12 07:53:37,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752595259] [2024-11-12 07:53:37,447 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 07:53:37,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-12 07:53:37,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:53:37,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-12 07:53:37,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1921, Unknown=4, NotChecked=0, Total=2256 [2024-11-12 07:53:37,450 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-12 07:53:45,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 07:53:51,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 07:53:55,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.51s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 07:53:58,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]