./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-55.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-55.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 f20e9f2923b6fcf76854633fa4b44cb969c28b9197113751a22d94911b3dd6da --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 12:00:22,365 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 12:00:22,443 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 12:00:22,452 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 12:00:22,455 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 12:00:22,492 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 12:00:22,495 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 12:00:22,495 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 12:00:22,496 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 12:00:22,496 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 12:00:22,497 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 12:00:22,497 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 12:00:22,498 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 12:00:22,499 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 12:00:22,500 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 12:00:22,500 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 12:00:22,501 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 12:00:22,501 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 12:00:22,504 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 12:00:22,505 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 12:00:22,505 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 12:00:22,506 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 12:00:22,506 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 12:00:22,506 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 12:00:22,506 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 12:00:22,507 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 12:00:22,507 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 12:00:22,507 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 12:00:22,507 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 12:00:22,508 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 12:00:22,508 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 12:00:22,509 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 12:00:22,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:00:22,510 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 12:00:22,510 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 12:00:22,511 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 12:00:22,511 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 12:00:22,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 12:00:22,511 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 12:00:22,511 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 12:00:22,512 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 12:00:22,512 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 12:00:22,512 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 -> f20e9f2923b6fcf76854633fa4b44cb969c28b9197113751a22d94911b3dd6da [2024-10-24 12:00:22,822 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 12:00:22,853 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 12:00:22,858 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 12:00:22,860 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 12:00:22,860 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 12:00:22,862 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-55.i [2024-10-24 12:00:24,473 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 12:00:24,713 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 12:00:24,714 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-55.i [2024-10-24 12:00:24,730 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05f3ad361/e859de4ee9a14d92988f46569717f51b/FLAGa63fb3911 [2024-10-24 12:00:24,744 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05f3ad361/e859de4ee9a14d92988f46569717f51b [2024-10-24 12:00:24,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 12:00:24,748 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 12:00:24,750 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 12:00:24,750 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 12:00:24,758 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 12:00:24,759 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:00:24" (1/1) ... [2024-10-24 12:00:24,760 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@414ba4ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:24, skipping insertion in model container [2024-10-24 12:00:24,760 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:00:24" (1/1) ... [2024-10-24 12:00:24,795 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 12:00:24,980 WARN L248 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-55.i[917,930] [2024-10-24 12:00:25,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:00:25,092 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 12:00:25,106 WARN L248 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-55.i[917,930] [2024-10-24 12:00:25,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:00:25,188 INFO L204 MainTranslator]: Completed translation [2024-10-24 12:00:25,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:25 WrapperNode [2024-10-24 12:00:25,189 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 12:00:25,191 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 12:00:25,191 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 12:00:25,192 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 12:00:25,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:25" (1/1) ... [2024-10-24 12:00:25,217 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:25" (1/1) ... [2024-10-24 12:00:25,298 INFO L138 Inliner]: procedures = 29, calls = 132, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 455 [2024-10-24 12:00:25,299 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 12:00:25,303 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 12:00:25,303 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 12:00:25,303 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 12:00:25,332 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:25" (1/1) ... [2024-10-24 12:00:25,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:25" (1/1) ... [2024-10-24 12:00:25,342 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:25" (1/1) ... [2024-10-24 12:00:25,380 INFO L175 MemorySlicer]: Split 108 memory accesses to 2 slices as follows [2, 106]. 98 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 14]. The 17 writes are split as follows [0, 17]. [2024-10-24 12:00:25,384 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:25" (1/1) ... [2024-10-24 12:00:25,385 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:25" (1/1) ... [2024-10-24 12:00:25,407 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:25" (1/1) ... [2024-10-24 12:00:25,415 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:25" (1/1) ... [2024-10-24 12:00:25,422 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:25" (1/1) ... [2024-10-24 12:00:25,425 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:25" (1/1) ... [2024-10-24 12:00:25,435 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 12:00:25,440 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 12:00:25,440 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 12:00:25,440 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 12:00:25,442 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:25" (1/1) ... [2024-10-24 12:00:25,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:00:25,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:00:25,486 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-10-24 12:00:25,490 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-10-24 12:00:25,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 12:00:25,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 12:00:25,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 12:00:25,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 12:00:25,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 12:00:25,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 12:00:25,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 12:00:25,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 12:00:25,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 12:00:25,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 12:00:25,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 12:00:25,552 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 12:00:25,552 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 12:00:25,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 12:00:25,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 12:00:25,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 12:00:25,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 12:00:25,716 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 12:00:25,719 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 12:00:26,330 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2024-10-24 12:00:26,330 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 12:00:26,372 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 12:00:26,372 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 12:00:26,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:00:26 BoogieIcfgContainer [2024-10-24 12:00:26,373 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 12:00:26,375 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 12:00:26,375 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 12:00:26,379 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 12:00:26,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:00:24" (1/3) ... [2024-10-24 12:00:26,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6abde1fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:00:26, skipping insertion in model container [2024-10-24 12:00:26,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:25" (2/3) ... [2024-10-24 12:00:26,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6abde1fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:00:26, skipping insertion in model container [2024-10-24 12:00:26,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:00:26" (3/3) ... [2024-10-24 12:00:26,382 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-55.i [2024-10-24 12:00:26,398 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 12:00:26,398 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 12:00:26,479 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 12:00:26,487 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;@65912184, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 12:00:26,488 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 12:00:26,494 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 89 states have (on average 1.4719101123595506) internal successors, (131), 90 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 12:00:26,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-24 12:00:26,510 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:00:26,511 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 12:00:26,516 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:00:26,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:00:26,523 INFO L85 PathProgramCache]: Analyzing trace with hash -521798446, now seen corresponding path program 1 times [2024-10-24 12:00:26,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:00:26,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607038588] [2024-10-24 12:00:26,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:00:26,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:00:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:26,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:00:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:26,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:00:26,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:26,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:00:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:26,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:00:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:26,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 12:00:26,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:26,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:00:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:26,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:00:26,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:26,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:00:26,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:26,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:00:26,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:26,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:00:26,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:26,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:00:26,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:26,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:00:26,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:26,979 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 12:00:26,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:00:26,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607038588] [2024-10-24 12:00:26,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607038588] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:00:26,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:00:26,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 12:00:26,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826425650] [2024-10-24 12:00:26,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:00:26,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 12:00:26,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:00:27,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 12:00:27,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 12:00:27,023 INFO L87 Difference]: Start difference. First operand has 104 states, 89 states have (on average 1.4719101123595506) internal successors, (131), 90 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 12:00:27,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:00:27,078 INFO L93 Difference]: Finished difference Result 205 states and 320 transitions. [2024-10-24 12:00:27,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 12:00:27,084 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2024-10-24 12:00:27,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:00:27,112 INFO L225 Difference]: With dead ends: 205 [2024-10-24 12:00:27,112 INFO L226 Difference]: Without dead ends: 102 [2024-10-24 12:00:27,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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-10-24 12:00:27,130 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:00:27,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:00:27,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-24 12:00:27,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-10-24 12:00:27,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 88 states have (on average 1.4318181818181819) internal successors, (126), 88 states have internal predecessors, (126), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 12:00:27,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 150 transitions. [2024-10-24 12:00:27,216 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 150 transitions. Word has length 110 [2024-10-24 12:00:27,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:00:27,216 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 150 transitions. [2024-10-24 12:00:27,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 12:00:27,217 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 150 transitions. [2024-10-24 12:00:27,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-24 12:00:27,220 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:00:27,220 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 12:00:27,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 12:00:27,221 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:00:27,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:00:27,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1590369346, now seen corresponding path program 1 times [2024-10-24 12:00:27,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:00:27,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983908326] [2024-10-24 12:00:27,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:00:27,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:00:27,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:27,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:00:27,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:27,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:00:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:27,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:00:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:27,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:00:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:27,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 12:00:27,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:27,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:00:27,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:27,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:00:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:27,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:00:27,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:27,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:00:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:27,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:00:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:27,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:00:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:27,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:00:27,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:27,631 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 12:00:27,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:00:27,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983908326] [2024-10-24 12:00:27,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983908326] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:00:27,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:00:27,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 12:00:27,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393905158] [2024-10-24 12:00:27,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:00:27,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:00:27,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:00:27,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:00:27,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:00:27,636 INFO L87 Difference]: Start difference. First operand 102 states and 150 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 12:00:27,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:00:27,699 INFO L93 Difference]: Finished difference Result 205 states and 302 transitions. [2024-10-24 12:00:27,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:00:27,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2024-10-24 12:00:27,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:00:27,702 INFO L225 Difference]: With dead ends: 205 [2024-10-24 12:00:27,702 INFO L226 Difference]: Without dead ends: 104 [2024-10-24 12:00:27,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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-10-24 12:00:27,704 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:00:27,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 425 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:00:27,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-24 12:00:27,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-24 12:00:27,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 90 states have (on average 1.4222222222222223) internal successors, (128), 90 states have internal predecessors, (128), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 12:00:27,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 152 transitions. [2024-10-24 12:00:27,723 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 152 transitions. Word has length 110 [2024-10-24 12:00:27,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:00:27,724 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 152 transitions. [2024-10-24 12:00:27,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 12:00:27,724 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 152 transitions. [2024-10-24 12:00:27,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-24 12:00:27,727 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:00:27,727 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 12:00:27,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 12:00:27,727 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:00:27,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:00:27,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1972630524, now seen corresponding path program 1 times [2024-10-24 12:00:27,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:00:27,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244619762] [2024-10-24 12:00:27,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:00:27,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:00:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:27,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:00:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:27,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:00:27,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:27,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:00:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:27,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:00:27,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:27,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 12:00:27,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:27,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:00:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:27,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:00:27,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:27,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:00:27,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:27,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:00:27,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:27,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:00:27,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:27,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:00:28,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:28,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:00:28,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:28,009 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 12:00:28,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:00:28,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244619762] [2024-10-24 12:00:28,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244619762] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:00:28,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:00:28,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 12:00:28,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274477804] [2024-10-24 12:00:28,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:00:28,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:00:28,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:00:28,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:00:28,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:00:28,013 INFO L87 Difference]: Start difference. First operand 104 states and 152 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 12:00:28,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:00:28,092 INFO L93 Difference]: Finished difference Result 210 states and 307 transitions. [2024-10-24 12:00:28,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:00:28,096 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-10-24 12:00:28,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:00:28,097 INFO L225 Difference]: With dead ends: 210 [2024-10-24 12:00:28,098 INFO L226 Difference]: Without dead ends: 107 [2024-10-24 12:00:28,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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-10-24 12:00:28,099 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 12:00:28,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 422 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 12:00:28,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-24 12:00:28,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2024-10-24 12:00:28,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 92 states have internal predecessors, (130), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 12:00:28,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 154 transitions. [2024-10-24 12:00:28,109 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 154 transitions. Word has length 110 [2024-10-24 12:00:28,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:00:28,109 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 154 transitions. [2024-10-24 12:00:28,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 12:00:28,110 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 154 transitions. [2024-10-24 12:00:28,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-24 12:00:28,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:00:28,113 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 12:00:28,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 12:00:28,113 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:00:28,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:00:28,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1512990146, now seen corresponding path program 1 times [2024-10-24 12:00:28,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:00:28,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672817088] [2024-10-24 12:00:28,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:00:28,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:00:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:28,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:00:28,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:28,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:00:28,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:28,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:00:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:28,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:00:28,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:28,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 12:00:28,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:28,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:00:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:28,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:00:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:28,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:00:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:28,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:00:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:28,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:00:28,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:28,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:00:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:28,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:00:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:28,357 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 12:00:28,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:00:28,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672817088] [2024-10-24 12:00:28,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672817088] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:00:28,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:00:28,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 12:00:28,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532161332] [2024-10-24 12:00:28,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:00:28,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:00:28,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:00:28,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:00:28,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:00:28,364 INFO L87 Difference]: Start difference. First operand 106 states and 154 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 12:00:28,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:00:28,408 INFO L93 Difference]: Finished difference Result 214 states and 311 transitions. [2024-10-24 12:00:28,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:00:28,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-10-24 12:00:28,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:00:28,411 INFO L225 Difference]: With dead ends: 214 [2024-10-24 12:00:28,411 INFO L226 Difference]: Without dead ends: 109 [2024-10-24 12:00:28,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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-10-24 12:00:28,413 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:00:28,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 423 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:00:28,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-24 12:00:28,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2024-10-24 12:00:28,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.4042553191489362) internal successors, (132), 94 states have internal predecessors, (132), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 12:00:28,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 156 transitions. [2024-10-24 12:00:28,425 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 156 transitions. Word has length 110 [2024-10-24 12:00:28,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:00:28,426 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 156 transitions. [2024-10-24 12:00:28,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 12:00:28,431 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 156 transitions. [2024-10-24 12:00:28,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-24 12:00:28,433 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:00:28,433 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 12:00:28,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 12:00:28,434 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:00:28,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:00:28,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1570248448, now seen corresponding path program 1 times [2024-10-24 12:00:28,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:00:28,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765841322] [2024-10-24 12:00:28,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:00:28,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:00:28,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:28,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:00:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:28,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:00:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:28,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:00:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:28,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:00:28,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:28,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 12:00:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:28,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:00:28,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:28,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:00:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:28,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:00:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:28,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:00:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:28,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:00:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:28,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:00:28,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:28,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:00:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:28,603 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 12:00:28,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:00:28,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765841322] [2024-10-24 12:00:28,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765841322] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:00:28,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:00:28,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 12:00:28,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488486905] [2024-10-24 12:00:28,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:00:28,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:00:28,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:00:28,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:00:28,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:00:28,608 INFO L87 Difference]: Start difference. First operand 108 states and 156 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 12:00:28,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:00:28,644 INFO L93 Difference]: Finished difference Result 218 states and 315 transitions. [2024-10-24 12:00:28,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:00:28,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-10-24 12:00:28,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:00:28,648 INFO L225 Difference]: With dead ends: 218 [2024-10-24 12:00:28,648 INFO L226 Difference]: Without dead ends: 111 [2024-10-24 12:00:28,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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-10-24 12:00:28,654 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 1 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:00:28,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 426 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:00:28,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-24 12:00:28,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-10-24 12:00:28,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.3958333333333333) internal successors, (134), 96 states have internal predecessors, (134), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 12:00:28,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2024-10-24 12:00:28,666 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 110 [2024-10-24 12:00:28,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:00:28,666 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2024-10-24 12:00:28,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 12:00:28,667 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2024-10-24 12:00:28,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-24 12:00:28,671 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:00:28,672 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 12:00:28,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 12:00:28,672 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:00:28,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:00:28,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1570308030, now seen corresponding path program 1 times [2024-10-24 12:00:28,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:00:28,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464518647] [2024-10-24 12:00:28,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:00:28,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:00:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:28,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:00:28,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:28,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:00:28,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:28,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:00:28,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:28,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:00:28,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:28,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 12:00:28,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:28,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:00:28,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:28,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:00:28,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:28,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:00:28,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:28,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:00:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:28,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:00:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:28,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:00:28,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:28,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:00:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:28,883 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 12:00:28,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:00:28,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464518647] [2024-10-24 12:00:28,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464518647] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:00:28,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:00:28,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 12:00:28,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557704122] [2024-10-24 12:00:28,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:00:28,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 12:00:28,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:00:28,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 12:00:28,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 12:00:28,888 INFO L87 Difference]: Start difference. First operand 110 states and 158 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 12:00:28,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:00:28,913 INFO L93 Difference]: Finished difference Result 219 states and 315 transitions. [2024-10-24 12:00:28,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 12:00:28,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-10-24 12:00:28,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:00:28,915 INFO L225 Difference]: With dead ends: 219 [2024-10-24 12:00:28,915 INFO L226 Difference]: Without dead ends: 110 [2024-10-24 12:00:28,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-10-24 12:00:28,918 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:00:28,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 283 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:00:28,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-24 12:00:28,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-10-24 12:00:28,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.3854166666666667) internal successors, (133), 96 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 12:00:28,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 157 transitions. [2024-10-24 12:00:28,933 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 157 transitions. Word has length 110 [2024-10-24 12:00:28,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:00:28,934 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 157 transitions. [2024-10-24 12:00:28,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 12:00:28,934 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 157 transitions. [2024-10-24 12:00:28,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-24 12:00:28,936 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:00:28,936 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 12:00:28,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 12:00:28,937 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:00:28,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:00:28,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1803983619, now seen corresponding path program 1 times [2024-10-24 12:00:28,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:00:28,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14668445] [2024-10-24 12:00:28,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:00:28,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:00:29,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:30,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:00:30,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:30,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:00:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:30,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:00:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:30,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:00:30,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:30,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 12:00:30,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:30,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:00:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:30,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:00:30,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:30,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:00:30,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:30,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:00:30,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:30,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:00:30,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:30,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:00:30,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:30,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:00:30,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:30,608 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 12:00:30,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:00:30,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14668445] [2024-10-24 12:00:30,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14668445] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:00:30,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:00:30,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 12:00:30,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920602416] [2024-10-24 12:00:30,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:00:30,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 12:00:30,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:00:30,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 12:00:30,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 12:00:30,611 INFO L87 Difference]: Start difference. First operand 110 states and 157 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 12:00:30,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:00:30,992 INFO L93 Difference]: Finished difference Result 272 states and 385 transitions. [2024-10-24 12:00:30,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 12:00:30,993 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2024-10-24 12:00:30,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:00:30,994 INFO L225 Difference]: With dead ends: 272 [2024-10-24 12:00:30,995 INFO L226 Difference]: Without dead ends: 163 [2024-10-24 12:00:30,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-10-24 12:00:30,996 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 305 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:00:30,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 478 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 12:00:30,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-24 12:00:31,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 123. [2024-10-24 12:00:31,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 109 states have (on average 1.3761467889908257) internal successors, (150), 109 states have internal predecessors, (150), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 12:00:31,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 174 transitions. [2024-10-24 12:00:31,007 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 174 transitions. Word has length 112 [2024-10-24 12:00:31,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:00:31,007 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 174 transitions. [2024-10-24 12:00:31,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 12:00:31,008 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 174 transitions. [2024-10-24 12:00:31,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-24 12:00:31,009 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:00:31,009 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 12:00:31,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 12:00:31,009 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:00:31,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:00:31,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1669970113, now seen corresponding path program 1 times [2024-10-24 12:00:31,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:00:31,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431005812] [2024-10-24 12:00:31,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:00:31,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:00:31,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:31,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:00:31,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:31,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:00:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:31,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:00:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:31,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:00:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:31,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 12:00:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:31,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:00:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:31,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:00:31,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:31,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:00:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:32,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:00:32,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:32,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:00:32,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:32,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:00:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:32,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:00:32,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:32,033 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 12:00:32,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:00:32,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431005812] [2024-10-24 12:00:32,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431005812] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:00:32,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:00:32,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 12:00:32,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908992538] [2024-10-24 12:00:32,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:00:32,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 12:00:32,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:00:32,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 12:00:32,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 12:00:32,036 INFO L87 Difference]: Start difference. First operand 123 states and 174 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 12:00:32,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:00:32,634 INFO L93 Difference]: Finished difference Result 426 states and 600 transitions. [2024-10-24 12:00:32,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 12:00:32,635 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2024-10-24 12:00:32,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:00:32,637 INFO L225 Difference]: With dead ends: 426 [2024-10-24 12:00:32,637 INFO L226 Difference]: Without dead ends: 304 [2024-10-24 12:00:32,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-24 12:00:32,639 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 208 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 12:00:32,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 558 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 12:00:32,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-10-24 12:00:32,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 182. [2024-10-24 12:00:32,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 155 states have (on average 1.3741935483870968) internal successors, (213), 155 states have internal predecessors, (213), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 12:00:32,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 261 transitions. [2024-10-24 12:00:32,664 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 261 transitions. Word has length 112 [2024-10-24 12:00:32,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:00:32,665 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 261 transitions. [2024-10-24 12:00:32,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 12:00:32,665 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 261 transitions. [2024-10-24 12:00:32,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-24 12:00:32,666 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:00:32,667 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 12:00:32,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 12:00:32,667 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:00:32,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:00:32,667 INFO L85 PathProgramCache]: Analyzing trace with hash 487028504, now seen corresponding path program 1 times [2024-10-24 12:00:32,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:00:32,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821847493] [2024-10-24 12:00:32,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:00:32,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:00:32,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:32,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:00:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:32,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:00:32,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:32,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:00:32,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:32,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:00:32,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:32,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 12:00:32,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:32,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:00:32,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:32,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:00:32,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:32,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:00:32,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:32,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:00:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:32,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:00:32,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:32,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:00:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:32,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:00:32,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:32,899 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 12:00:32,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:00:32,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821847493] [2024-10-24 12:00:32,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821847493] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:00:32,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:00:32,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 12:00:32,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867711582] [2024-10-24 12:00:32,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:00:32,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 12:00:32,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:00:32,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 12:00:32,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 12:00:32,902 INFO L87 Difference]: Start difference. First operand 182 states and 261 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 12:00:33,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:00:33,097 INFO L93 Difference]: Finished difference Result 370 states and 523 transitions. [2024-10-24 12:00:33,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 12:00:33,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2024-10-24 12:00:33,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:00:33,099 INFO L225 Difference]: With dead ends: 370 [2024-10-24 12:00:33,099 INFO L226 Difference]: Without dead ends: 248 [2024-10-24 12:00:33,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 12:00:33,100 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 58 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 12:00:33,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 465 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 12:00:33,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-10-24 12:00:33,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 188. [2024-10-24 12:00:33,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 161 states have (on average 1.360248447204969) internal successors, (219), 161 states have internal predecessors, (219), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 12:00:33,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 267 transitions. [2024-10-24 12:00:33,135 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 267 transitions. Word has length 113 [2024-10-24 12:00:33,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:00:33,138 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 267 transitions. [2024-10-24 12:00:33,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 12:00:33,138 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 267 transitions. [2024-10-24 12:00:33,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 12:00:33,139 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:00:33,140 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 12:00:33,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 12:00:33,140 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:00:33,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:00:33,140 INFO L85 PathProgramCache]: Analyzing trace with hash 149976487, now seen corresponding path program 1 times [2024-10-24 12:00:33,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:00:33,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724519351] [2024-10-24 12:00:33,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:00:33,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:00:33,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:34,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:00:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:34,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:00:34,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:34,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:00:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:34,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:00:34,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:34,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 12:00:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:34,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:00:34,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:34,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:00:34,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:34,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:00:34,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:34,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:00:34,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:34,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:00:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:34,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:00:34,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:34,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:00:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:34,496 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 12:00:34,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:00:34,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724519351] [2024-10-24 12:00:34,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724519351] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:00:34,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:00:34,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 12:00:34,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799348063] [2024-10-24 12:00:34,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:00:34,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 12:00:34,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:00:34,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 12:00:34,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-24 12:00:34,498 INFO L87 Difference]: Start difference. First operand 188 states and 267 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-24 12:00:34,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:00:34,904 INFO L93 Difference]: Finished difference Result 425 states and 601 transitions. [2024-10-24 12:00:34,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:00:34,904 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 114 [2024-10-24 12:00:34,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:00:34,906 INFO L225 Difference]: With dead ends: 425 [2024-10-24 12:00:34,906 INFO L226 Difference]: Without dead ends: 297 [2024-10-24 12:00:34,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 12:00:34,909 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 106 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:00:34,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 555 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 12:00:34,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-10-24 12:00:34,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 294. [2024-10-24 12:00:34,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 254 states have (on average 1.3622047244094488) internal successors, (346), 254 states have internal predecessors, (346), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 12:00:34,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 418 transitions. [2024-10-24 12:00:34,945 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 418 transitions. Word has length 114 [2024-10-24 12:00:34,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:00:34,945 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 418 transitions. [2024-10-24 12:00:34,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-24 12:00:34,947 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 418 transitions. [2024-10-24 12:00:34,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 12:00:34,948 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:00:34,948 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 12:00:34,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 12:00:34,949 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:00:34,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:00:34,949 INFO L85 PathProgramCache]: Analyzing trace with hash 551353342, now seen corresponding path program 1 times [2024-10-24 12:00:34,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:00:34,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131579017] [2024-10-24 12:00:34,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:00:34,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:00:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:35,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:00:35,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:35,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:00:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:35,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:00:35,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:35,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:00:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:35,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 12:00:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:35,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:00:35,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:35,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:00:35,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:35,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:00:35,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:35,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:00:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:35,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:00:35,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:35,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:00:35,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:35,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:00:35,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:35,905 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 12:00:35,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:00:35,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131579017] [2024-10-24 12:00:35,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131579017] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:00:35,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:00:35,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 12:00:35,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663531257] [2024-10-24 12:00:35,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:00:35,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 12:00:35,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:00:35,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 12:00:35,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 12:00:35,908 INFO L87 Difference]: Start difference. First operand 294 states and 418 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 12:00:36,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:00:36,276 INFO L93 Difference]: Finished difference Result 486 states and 683 transitions. [2024-10-24 12:00:36,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 12:00:36,276 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2024-10-24 12:00:36,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:00:36,279 INFO L225 Difference]: With dead ends: 486 [2024-10-24 12:00:36,279 INFO L226 Difference]: Without dead ends: 358 [2024-10-24 12:00:36,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-10-24 12:00:36,280 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 181 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:00:36,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 616 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 12:00:36,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-10-24 12:00:36,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 318. [2024-10-24 12:00:36,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 278 states have (on average 1.356115107913669) internal successors, (377), 278 states have internal predecessors, (377), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 12:00:36,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 449 transitions. [2024-10-24 12:00:36,326 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 449 transitions. Word has length 114 [2024-10-24 12:00:36,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:00:36,326 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 449 transitions. [2024-10-24 12:00:36,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 12:00:36,327 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 449 transitions. [2024-10-24 12:00:36,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 12:00:36,328 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:00:36,328 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 12:00:36,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 12:00:36,329 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:00:36,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:00:36,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1281220432, now seen corresponding path program 1 times [2024-10-24 12:00:36,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:00:36,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276730365] [2024-10-24 12:00:36,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:00:36,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:00:36,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:36,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:00:36,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:36,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:00:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:36,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:00:36,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:36,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:00:36,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:36,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 12:00:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:36,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:00:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:36,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:00:36,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:36,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:00:36,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:36,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:00:36,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:36,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:00:36,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:36,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:00:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:36,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:00:36,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:36,481 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 12:00:36,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:00:36,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276730365] [2024-10-24 12:00:36,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276730365] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:00:36,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:00:36,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 12:00:36,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937801521] [2024-10-24 12:00:36,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:00:36,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 12:00:36,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:00:36,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 12:00:36,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 12:00:36,485 INFO L87 Difference]: Start difference. First operand 318 states and 449 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 12:00:36,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:00:36,570 INFO L93 Difference]: Finished difference Result 578 states and 813 transitions. [2024-10-24 12:00:36,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 12:00:36,571 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-10-24 12:00:36,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:00:36,573 INFO L225 Difference]: With dead ends: 578 [2024-10-24 12:00:36,573 INFO L226 Difference]: Without dead ends: 324 [2024-10-24 12:00:36,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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-10-24 12:00:36,576 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:00:36,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 564 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:00:36,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-10-24 12:00:36,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 322. [2024-10-24 12:00:36,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 282 states have (on average 1.351063829787234) internal successors, (381), 282 states have internal predecessors, (381), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 12:00:36,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 453 transitions. [2024-10-24 12:00:36,613 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 453 transitions. Word has length 115 [2024-10-24 12:00:36,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:00:36,614 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 453 transitions. [2024-10-24 12:00:36,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 12:00:36,614 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 453 transitions. [2024-10-24 12:00:36,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 12:00:36,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:00:36,616 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 12:00:36,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 12:00:36,616 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:00:36,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:00:36,616 INFO L85 PathProgramCache]: Analyzing trace with hash 126359396, now seen corresponding path program 1 times [2024-10-24 12:00:36,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:00:36,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769569358] [2024-10-24 12:00:36,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:00:36,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:00:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:36,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:00:36,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:36,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:00:36,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:36,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:00:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:36,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:00:36,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:36,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 12:00:36,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:36,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:00:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:36,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:00:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:36,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:00:36,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:36,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:00:36,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:36,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:00:36,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:36,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:00:36,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:36,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:00:36,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:36,873 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 12:00:36,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:00:36,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769569358] [2024-10-24 12:00:36,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769569358] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:00:36,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:00:36,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 12:00:36,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729911094] [2024-10-24 12:00:36,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:00:36,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 12:00:36,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:00:36,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 12:00:36,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 12:00:36,876 INFO L87 Difference]: Start difference. First operand 322 states and 453 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 12:00:37,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:00:37,170 INFO L93 Difference]: Finished difference Result 726 states and 1007 transitions. [2024-10-24 12:00:37,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 12:00:37,170 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2024-10-24 12:00:37,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:00:37,173 INFO L225 Difference]: With dead ends: 726 [2024-10-24 12:00:37,173 INFO L226 Difference]: Without dead ends: 462 [2024-10-24 12:00:37,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-24 12:00:37,176 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 179 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 12:00:37,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 578 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 12:00:37,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-10-24 12:00:37,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 369. [2024-10-24 12:00:37,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 329 states have (on average 1.337386018237082) internal successors, (440), 329 states have internal predecessors, (440), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 12:00:37,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 512 transitions. [2024-10-24 12:00:37,221 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 512 transitions. Word has length 116 [2024-10-24 12:00:37,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:00:37,222 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 512 transitions. [2024-10-24 12:00:37,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 12:00:37,222 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 512 transitions. [2024-10-24 12:00:37,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 12:00:37,223 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:00:37,223 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 12:00:37,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 12:00:37,223 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:00:37,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:00:37,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1512562790, now seen corresponding path program 1 times [2024-10-24 12:00:37,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:00:37,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009816782] [2024-10-24 12:00:37,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:00:37,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:00:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:37,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:00:37,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:37,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:00:37,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:37,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:00:37,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:37,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:00:37,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:37,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 12:00:37,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:37,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:00:37,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:37,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:00:37,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:37,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:00:37,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:37,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:00:37,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:37,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:00:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:37,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:00:37,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:37,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:00:37,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:37,447 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 12:00:37,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:00:37,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009816782] [2024-10-24 12:00:37,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009816782] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:00:37,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:00:37,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 12:00:37,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599396703] [2024-10-24 12:00:37,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:00:37,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 12:00:37,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:00:37,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 12:00:37,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 12:00:37,450 INFO L87 Difference]: Start difference. First operand 369 states and 512 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 12:00:37,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:00:37,594 INFO L93 Difference]: Finished difference Result 524 states and 727 transitions. [2024-10-24 12:00:37,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 12:00:37,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2024-10-24 12:00:37,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:00:37,597 INFO L225 Difference]: With dead ends: 524 [2024-10-24 12:00:37,597 INFO L226 Difference]: Without dead ends: 243 [2024-10-24 12:00:37,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 12:00:37,598 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 3 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 12:00:37,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 483 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 12:00:37,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-10-24 12:00:37,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2024-10-24 12:00:37,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 216 states have (on average 1.3240740740740742) internal successors, (286), 216 states have internal predecessors, (286), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 12:00:37,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 334 transitions. [2024-10-24 12:00:37,627 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 334 transitions. Word has length 116 [2024-10-24 12:00:37,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:00:37,628 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 334 transitions. [2024-10-24 12:00:37,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 12:00:37,628 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 334 transitions. [2024-10-24 12:00:37,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 12:00:37,629 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:00:37,629 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 12:00:37,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 12:00:37,630 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:00:37,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:00:37,630 INFO L85 PathProgramCache]: Analyzing trace with hash -2017246109, now seen corresponding path program 1 times [2024-10-24 12:00:37,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:00:37,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220439208] [2024-10-24 12:00:37,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:00:37,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:00:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:37,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:00:37,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:37,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:00:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:37,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:00:37,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:37,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:00:37,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:37,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 12:00:37,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:37,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:00:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:37,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:00:37,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:37,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:00:37,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:37,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:00:37,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:37,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:00:37,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:37,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:00:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:37,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:00:37,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:37,840 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 12:00:37,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:00:37,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220439208] [2024-10-24 12:00:37,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220439208] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:00:37,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:00:37,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 12:00:37,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231581057] [2024-10-24 12:00:37,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:00:37,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 12:00:37,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:00:37,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 12:00:37,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 12:00:37,842 INFO L87 Difference]: Start difference. First operand 243 states and 334 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 12:00:37,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:00:37,980 INFO L93 Difference]: Finished difference Result 432 states and 591 transitions. [2024-10-24 12:00:37,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 12:00:37,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2024-10-24 12:00:37,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:00:37,982 INFO L225 Difference]: With dead ends: 432 [2024-10-24 12:00:37,982 INFO L226 Difference]: Without dead ends: 280 [2024-10-24 12:00:37,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 12:00:37,983 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 37 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 12:00:37,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 474 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 12:00:37,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-10-24 12:00:38,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 248. [2024-10-24 12:00:38,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 221 states have (on average 1.3212669683257918) internal successors, (292), 221 states have internal predecessors, (292), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 12:00:38,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 340 transitions. [2024-10-24 12:00:38,005 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 340 transitions. Word has length 116 [2024-10-24 12:00:38,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:00:38,005 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 340 transitions. [2024-10-24 12:00:38,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 12:00:38,006 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 340 transitions. [2024-10-24 12:00:38,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 12:00:38,007 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:00:38,007 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 12:00:38,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 12:00:38,008 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:00:38,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:00:38,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1690915173, now seen corresponding path program 1 times [2024-10-24 12:00:38,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:00:38,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624651471] [2024-10-24 12:00:38,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:00:38,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:00:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:38,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:00:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:38,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:00:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:38,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:00:38,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:38,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:00:38,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:38,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 12:00:38,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:38,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:00:38,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:38,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:00:38,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:38,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:00:38,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:38,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:00:38,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:38,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:00:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:38,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:00:38,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:38,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:00:38,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:38,148 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 12:00:38,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:00:38,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624651471] [2024-10-24 12:00:38,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624651471] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:00:38,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:00:38,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 12:00:38,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583636058] [2024-10-24 12:00:38,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:00:38,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 12:00:38,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:00:38,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 12:00:38,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 12:00:38,153 INFO L87 Difference]: Start difference. First operand 248 states and 340 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 12:00:38,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:00:38,201 INFO L93 Difference]: Finished difference Result 408 states and 559 transitions. [2024-10-24 12:00:38,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 12:00:38,202 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2024-10-24 12:00:38,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:00:38,203 INFO L225 Difference]: With dead ends: 408 [2024-10-24 12:00:38,204 INFO L226 Difference]: Without dead ends: 251 [2024-10-24 12:00:38,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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-10-24 12:00:38,204 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:00:38,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 557 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:00:38,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-24 12:00:38,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2024-10-24 12:00:38,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 224 states have (on average 1.3169642857142858) internal successors, (295), 224 states have internal predecessors, (295), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 12:00:38,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 343 transitions. [2024-10-24 12:00:38,228 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 343 transitions. Word has length 116 [2024-10-24 12:00:38,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:00:38,228 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 343 transitions. [2024-10-24 12:00:38,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 12:00:38,229 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 343 transitions. [2024-10-24 12:00:38,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-24 12:00:38,230 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:00:38,230 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 12:00:38,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 12:00:38,231 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:00:38,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:00:38,231 INFO L85 PathProgramCache]: Analyzing trace with hash -623685207, now seen corresponding path program 1 times [2024-10-24 12:00:38,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:00:38,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949105982] [2024-10-24 12:00:38,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:00:38,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:00:38,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:38,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:00:38,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:38,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:00:38,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:38,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:00:38,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:38,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:00:38,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:38,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 12:00:38,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:38,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:00:38,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:38,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:00:38,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:38,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:00:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:38,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:00:38,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:38,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:00:38,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:38,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:00:38,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:38,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:00:38,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:38,354 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 12:00:38,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:00:38,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949105982] [2024-10-24 12:00:38,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949105982] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:00:38,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:00:38,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 12:00:38,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233973927] [2024-10-24 12:00:38,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:00:38,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:00:38,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:00:38,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:00:38,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:00:38,357 INFO L87 Difference]: Start difference. First operand 251 states and 343 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 12:00:38,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:00:38,408 INFO L93 Difference]: Finished difference Result 452 states and 614 transitions. [2024-10-24 12:00:38,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:00:38,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-10-24 12:00:38,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:00:38,411 INFO L225 Difference]: With dead ends: 452 [2024-10-24 12:00:38,411 INFO L226 Difference]: Without dead ends: 291 [2024-10-24 12:00:38,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:00:38,412 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 44 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:00:38,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 432 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:00:38,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-10-24 12:00:38,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 250. [2024-10-24 12:00:38,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 223 states have (on average 1.3094170403587444) internal successors, (292), 223 states have internal predecessors, (292), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 12:00:38,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 340 transitions. [2024-10-24 12:00:38,431 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 340 transitions. Word has length 117 [2024-10-24 12:00:38,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:00:38,432 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 340 transitions. [2024-10-24 12:00:38,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 12:00:38,432 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 340 transitions. [2024-10-24 12:00:38,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-24 12:00:38,433 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:00:38,433 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 12:00:38,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 12:00:38,434 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:00:38,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:00:38,434 INFO L85 PathProgramCache]: Analyzing trace with hash 2110915733, now seen corresponding path program 1 times [2024-10-24 12:00:38,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:00:38,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871456384] [2024-10-24 12:00:38,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:00:38,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:00:38,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:38,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:00:38,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:38,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:00:38,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:38,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:00:38,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:38,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:00:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:38,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 12:00:38,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:38,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:00:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:38,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:00:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:38,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:00:38,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:38,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:00:38,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:38,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:00:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:38,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:00:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:38,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:00:38,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:38,581 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 12:00:38,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:00:38,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871456384] [2024-10-24 12:00:38,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871456384] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:00:38,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:00:38,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 12:00:38,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532318450] [2024-10-24 12:00:38,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:00:38,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 12:00:38,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:00:38,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 12:00:38,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 12:00:38,583 INFO L87 Difference]: Start difference. First operand 250 states and 340 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 12:00:38,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:00:38,803 INFO L93 Difference]: Finished difference Result 454 states and 612 transitions. [2024-10-24 12:00:38,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 12:00:38,803 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-10-24 12:00:38,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:00:38,805 INFO L225 Difference]: With dead ends: 454 [2024-10-24 12:00:38,805 INFO L226 Difference]: Without dead ends: 293 [2024-10-24 12:00:38,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-24 12:00:38,807 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 135 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 12:00:38,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 600 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 12:00:38,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-10-24 12:00:38,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 250. [2024-10-24 12:00:38,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 223 states have (on average 1.304932735426009) internal successors, (291), 223 states have internal predecessors, (291), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 12:00:38,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 339 transitions. [2024-10-24 12:00:38,826 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 339 transitions. Word has length 117 [2024-10-24 12:00:38,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:00:38,829 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 339 transitions. [2024-10-24 12:00:38,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 12:00:38,829 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 339 transitions. [2024-10-24 12:00:38,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-24 12:00:38,830 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:00:38,830 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 12:00:38,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 12:00:38,831 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:00:38,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:00:38,831 INFO L85 PathProgramCache]: Analyzing trace with hash 116771027, now seen corresponding path program 1 times [2024-10-24 12:00:38,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:00:38,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853890659] [2024-10-24 12:00:38,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:00:38,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:00:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:39,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:00:39,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:39,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:00:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:39,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:00:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:39,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:00:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:39,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 12:00:39,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:39,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:00:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:39,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:00:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:39,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:00:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:39,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:00:39,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:39,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:00:39,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:39,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:00:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:39,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:00:39,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:39,198 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 12:00:39,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:00:39,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853890659] [2024-10-24 12:00:39,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853890659] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:00:39,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:00:39,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 12:00:39,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413027337] [2024-10-24 12:00:39,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:00:39,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 12:00:39,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:00:39,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 12:00:39,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 12:00:39,199 INFO L87 Difference]: Start difference. First operand 250 states and 339 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 12:00:39,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:00:39,402 INFO L93 Difference]: Finished difference Result 428 states and 578 transitions. [2024-10-24 12:00:39,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 12:00:39,403 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-10-24 12:00:39,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:00:39,404 INFO L225 Difference]: With dead ends: 428 [2024-10-24 12:00:39,405 INFO L226 Difference]: Without dead ends: 250 [2024-10-24 12:00:39,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-24 12:00:39,406 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 115 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 12:00:39,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 406 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 12:00:39,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-10-24 12:00:39,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2024-10-24 12:00:39,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 223 states have (on average 1.295964125560538) internal successors, (289), 223 states have internal predecessors, (289), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 12:00:39,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 337 transitions. [2024-10-24 12:00:39,427 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 337 transitions. Word has length 117 [2024-10-24 12:00:39,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:00:39,427 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 337 transitions. [2024-10-24 12:00:39,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 12:00:39,427 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 337 transitions. [2024-10-24 12:00:39,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 12:00:39,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:00:39,428 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 12:00:39,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 12:00:39,429 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:00:39,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:00:39,430 INFO L85 PathProgramCache]: Analyzing trace with hash 960473963, now seen corresponding path program 1 times [2024-10-24 12:00:39,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:00:39,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356787237] [2024-10-24 12:00:39,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:00:39,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:00:39,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:40,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:00:40,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:40,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:00:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:40,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:00:40,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:40,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:00:40,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:40,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 12:00:40,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:40,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:00:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:40,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:00:40,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:40,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:00:40,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:40,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:00:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:40,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:00:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:40,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:00:40,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:40,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:00:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:40,769 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 12:00:40,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:00:40,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356787237] [2024-10-24 12:00:40,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356787237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:00:40,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:00:40,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 12:00:40,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347088417] [2024-10-24 12:00:40,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:00:40,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 12:00:40,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:00:40,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 12:00:40,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 12:00:40,772 INFO L87 Difference]: Start difference. First operand 250 states and 337 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-24 12:00:41,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:00:41,097 INFO L93 Difference]: Finished difference Result 539 states and 727 transitions. [2024-10-24 12:00:41,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:00:41,097 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 119 [2024-10-24 12:00:41,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:00:41,100 INFO L225 Difference]: With dead ends: 539 [2024-10-24 12:00:41,100 INFO L226 Difference]: Without dead ends: 367 [2024-10-24 12:00:41,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-24 12:00:41,101 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 269 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:00:41,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 367 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 12:00:41,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-10-24 12:00:41,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 364. [2024-10-24 12:00:41,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 324 states have (on average 1.2932098765432098) internal successors, (419), 324 states have internal predecessors, (419), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 12:00:41,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 491 transitions. [2024-10-24 12:00:41,138 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 491 transitions. Word has length 119 [2024-10-24 12:00:41,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:00:41,139 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 491 transitions. [2024-10-24 12:00:41,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-24 12:00:41,139 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 491 transitions. [2024-10-24 12:00:41,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 12:00:41,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:00:41,141 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 12:00:41,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 12:00:41,141 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:00:41,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:00:41,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1259615048, now seen corresponding path program 1 times [2024-10-24 12:00:41,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:00:41,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247489327] [2024-10-24 12:00:41,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:00:41,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:00:41,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:42,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:00:42,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:42,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:00:42,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:42,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:00:42,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:42,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:00:42,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:42,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 12:00:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:42,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:00:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:42,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:00:42,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:42,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:00:42,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:42,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:00:42,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:42,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:00:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:42,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:00:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:42,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:00:42,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:42,162 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 12:00:42,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:00:42,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247489327] [2024-10-24 12:00:42,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247489327] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:00:42,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:00:42,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 12:00:42,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528581266] [2024-10-24 12:00:42,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:00:42,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 12:00:42,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:00:42,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 12:00:42,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-24 12:00:42,164 INFO L87 Difference]: Start difference. First operand 364 states and 491 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 12:00:42,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:00:42,617 INFO L93 Difference]: Finished difference Result 557 states and 748 transitions. [2024-10-24 12:00:42,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 12:00:42,618 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2024-10-24 12:00:42,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:00:42,620 INFO L225 Difference]: With dead ends: 557 [2024-10-24 12:00:42,620 INFO L226 Difference]: Without dead ends: 395 [2024-10-24 12:00:42,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-24 12:00:42,622 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 391 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:00:42,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 355 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 12:00:42,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-10-24 12:00:42,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 353. [2024-10-24 12:00:42,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 313 states have (on average 1.29073482428115) internal successors, (404), 313 states have internal predecessors, (404), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 12:00:42,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 476 transitions. [2024-10-24 12:00:42,664 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 476 transitions. Word has length 119 [2024-10-24 12:00:42,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:00:42,665 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 476 transitions. [2024-10-24 12:00:42,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 12:00:42,665 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 476 transitions. [2024-10-24 12:00:42,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 12:00:42,666 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:00:42,667 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 12:00:42,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 12:00:42,668 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:00:42,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:00:42,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1383454926, now seen corresponding path program 1 times [2024-10-24 12:00:42,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:00:42,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435242654] [2024-10-24 12:00:42,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:00:42,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:00:42,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 12:00:42,801 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 12:00:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 12:00:42,958 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 12:00:42,958 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 12:00:42,959 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 12:00:42,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-24 12:00:42,964 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:00:43,121 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 12:00:43,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:00:43 BoogieIcfgContainer [2024-10-24 12:00:43,124 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 12:00:43,125 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 12:00:43,125 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 12:00:43,125 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 12:00:43,126 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:00:26" (3/4) ... [2024-10-24 12:00:43,128 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 12:00:43,129 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 12:00:43,129 INFO L158 Benchmark]: Toolchain (without parser) took 18381.21ms. Allocated memory was 151.0MB in the beginning and 601.9MB in the end (delta: 450.9MB). Free memory was 78.2MB in the beginning and 501.4MB in the end (delta: -423.2MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. [2024-10-24 12:00:43,130 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 151.0MB. Free memory is still 101.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 12:00:43,130 INFO L158 Benchmark]: CACSL2BoogieTranslator took 439.39ms. Allocated memory is still 151.0MB. Free memory was 78.0MB in the beginning and 61.1MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 12:00:43,130 INFO L158 Benchmark]: Boogie Procedure Inliner took 107.42ms. Allocated memory is still 151.0MB. Free memory was 61.1MB in the beginning and 118.8MB in the end (delta: -57.8MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2024-10-24 12:00:43,130 INFO L158 Benchmark]: Boogie Preprocessor took 135.92ms. Allocated memory was 151.0MB in the beginning and 213.9MB in the end (delta: 62.9MB). Free memory was 118.8MB in the beginning and 180.3MB in the end (delta: -61.4MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. [2024-10-24 12:00:43,131 INFO L158 Benchmark]: RCFGBuilder took 932.83ms. Allocated memory is still 213.9MB. Free memory was 180.3MB in the beginning and 139.4MB in the end (delta: 40.9MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-10-24 12:00:43,131 INFO L158 Benchmark]: TraceAbstraction took 16749.26ms. Allocated memory was 213.9MB in the beginning and 601.9MB in the end (delta: 388.0MB). Free memory was 139.4MB in the beginning and 501.4MB in the end (delta: -362.0MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB. [2024-10-24 12:00:43,131 INFO L158 Benchmark]: Witness Printer took 3.92ms. Allocated memory is still 601.9MB. Free memory is still 501.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 12:00:43,132 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.19ms. Allocated memory is still 151.0MB. Free memory is still 101.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 439.39ms. Allocated memory is still 151.0MB. Free memory was 78.0MB in the beginning and 61.1MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 107.42ms. Allocated memory is still 151.0MB. Free memory was 61.1MB in the beginning and 118.8MB in the end (delta: -57.8MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 135.92ms. Allocated memory was 151.0MB in the beginning and 213.9MB in the end (delta: 62.9MB). Free memory was 118.8MB in the beginning and 180.3MB in the end (delta: -61.4MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. * RCFGBuilder took 932.83ms. Allocated memory is still 213.9MB. Free memory was 180.3MB in the beginning and 139.4MB in the end (delta: 40.9MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 16749.26ms. Allocated memory was 213.9MB in the beginning and 601.9MB in the end (delta: 388.0MB). Free memory was 139.4MB in the beginning and 501.4MB in the end (delta: -362.0MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB. * Witness Printer took 3.92ms. Allocated memory is still 601.9MB. Free memory is still 501.4MB. 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 130, overapproximation of shiftRight at line 93, overapproximation of someBinaryArithmeticDOUBLEoperation at line 88. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10, 0, 0, 256.75, 63.5, 1.8, 0.25, 16.5, -5, 128, 4.6, 500, 2, 100 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10, 0, 0, 256.75, 63.5, 1.8, 0.25, 16.5, -5, 128, 4.6, 500, 2, 100 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10, 0, 0, 256.75, 63.5, 1.8, 0.25, 16.5, -5, 128, 4.6, 500, 2, 100 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10, 0, 0, 256.75, 63.5, 1.8, 0.25, 16.5, -5, 128, 4.6, 500, 2, 100 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10, 0, 0, 256.75, 63.5, 1.8, 0.25, 16.5, -5, 128, 4.6, 500, 2, 100 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10, 0, 0, 256.75, 63.5, 1.8, 0.25, 16.5, -5, 128, 4.6, 500, 2, 100 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10, 0, 0, 256.75, 63.5, 1.8, 0.25, 16.5, -5, 128, 4.6, 500, 2, 100 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10, 0, 0, 256.75, 63.5, 1.8, 0.25, 16.5, -5, 128, 4.6, 500, 2, 100 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10, 0, 0, 256.75, 63.5, 1.8, 0.25, 16.5, -5, 128, 4.6, 500, 2, 100 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10, 0, 0, 256.75, 63.5, 1.8, 0.25, 16.5, -5, 128, 4.6, 500, 2, 100 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10, 0, 0, 256.75, 63.5, 1.8, 0.25, 16.5, -5, 128, 4.6, 500, 2, 100 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10, 0, 0, 256.75, 63.5, 1.8, 0.25, 16.5, -5, 128, 4.6, 500, 2, 100 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10, 0, 0, 256.75, 63.5, 1.8, 0.25, 16.5, -5, 128, 4.6, 500, 2, 100 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10, 0, 0, 256.75, 63.5, 1.8, 0.25, 16.5, -5, 128, 4.6, 500, 2, 100 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10, 0, 0, 256.75, 63.5, 1.8, 0.25, 16.5, -5, 128, 4.6, 500, 2, 100 }; [L55] unsigned short int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L56] unsigned char* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L57] unsigned char* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L58] double* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L59] double* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L60] double* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L61] double* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L62] double* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L63] signed long int* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L64] unsigned char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L65] float* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L66] unsigned long int* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L67] unsigned char* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L68] unsigned char* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L69] signed long int last_1_WrapperStruct00_var_1_12 = -5; [L70] unsigned char last_1_WrapperStruct00_var_1_17 = 2; [L134] isInitial = 1 [L135] FCALL initially() [L136] COND TRUE 1 [L137] CALL updateLastVariables() [L126] EXPR WrapperStruct00.var_1_12 [L126] last_1_WrapperStruct00_var_1_12 = WrapperStruct00.var_1_12 [L127] EXPR WrapperStruct00.var_1_17 [L127] last_1_WrapperStruct00_var_1_17 = WrapperStruct00.var_1_17 [L137] RET updateLastVariables() [L138] CALL updateVariables() [L104] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L105] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L106] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L107] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L108] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L109] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L110] WrapperStruct00.var_1_8 = __VERIFIER_nondet_double() [L111] EXPR WrapperStruct00.var_1_8 [L111] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L111] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F [L111] EXPR WrapperStruct00.var_1_8 [L111] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L111] EXPR (WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L111] EXPR (WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L111] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L111] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L112] WrapperStruct00.var_1_9 = __VERIFIER_nondet_double() [L113] EXPR WrapperStruct00.var_1_9 [L113] EXPR WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L113] EXPR WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F [L113] EXPR WrapperStruct00.var_1_9 [L113] EXPR WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L113] EXPR (WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L113] EXPR (WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L113] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L113] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L114] WrapperStruct00.var_1_10 = __VERIFIER_nondet_double() [L115] EXPR WrapperStruct00.var_1_10 [L115] EXPR WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L115] EXPR WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F [L115] EXPR WrapperStruct00.var_1_10 [L115] EXPR WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L115] EXPR (WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L115] EXPR (WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L115] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L115] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L116] WrapperStruct00.var_1_11 = __VERIFIER_nondet_double() [L117] EXPR WrapperStruct00.var_1_11 [L117] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L117] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F [L117] EXPR WrapperStruct00.var_1_11 [L117] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L117] EXPR (WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L117] EXPR (WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L117] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L117] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L118] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L119] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L120] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 255) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 255) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L121] WrapperStruct00.var_1_18 = __VERIFIER_nondet_uchar() [L122] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L123] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L138] RET updateVariables() [L139] CALL step() [L74] unsigned char stepLocal_1 = last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17; [L75] signed long int stepLocal_0 = last_1_WrapperStruct00_var_1_17; [L76] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L76] COND TRUE (*(WrapperStruct00_var_1_2_Pointer)) [L77] stepLocal_1 && (*(WrapperStruct00_var_1_5_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2, stepLocal_0=2] [L77] stepLocal_1 && (*(WrapperStruct00_var_1_5_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L77] COND FALSE !(stepLocal_1 && (*(WrapperStruct00_var_1_5_Pointer))) [L87] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L87] COND TRUE (*(WrapperStruct00_var_1_2_Pointer)) [L88] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L88] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L88] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L88] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L88] (*(WrapperStruct00_var_1_7_Pointer)) = ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))) [L90] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L90] (*(WrapperStruct00_var_1_15_Pointer)) = (*(WrapperStruct00_var_1_8_Pointer)) [L91] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L91] (*(WrapperStruct00_var_1_16_Pointer)) = (*(WrapperStruct00_var_1_14_Pointer)) [L92] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L92] (*(WrapperStruct00_var_1_17_Pointer)) = (*(WrapperStruct00_var_1_18_Pointer)) [L93] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L93] EXPR -4 >> (*(WrapperStruct00_var_1_1_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2, stepLocal_0=2] [L93] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L93] EXPR (((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer))) [L93] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L93] EXPR -4 >> (*(WrapperStruct00_var_1_1_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2, stepLocal_0=2] [L93] EXPR (((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2, stepLocal_0=2] [L93] signed long int stepLocal_3 = ((((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)))); [L94] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L94] signed long int stepLocal_2 = (*(WrapperStruct00_var_1_1_Pointer)) / -8; [L95] EXPR \read(*WrapperStruct00_var_1_17_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L95] COND FALSE !((~ (*(WrapperStruct00_var_1_17_Pointer))) <= stepLocal_3) [L100] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L100] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L100] (*(WrapperStruct00_var_1_12_Pointer)) = ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer))) [L139] RET step() [L140] CALL, EXPR property() [L130] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_17)) [L130] EXPR (last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR (last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1 [L130] EXPR ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_17)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))))) : 1) [L130] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))))) : 1 [L130] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L130] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L130] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L130] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L130] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L130] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))))) : 1)) && (((~ (*(WrapperStruct00_var_1_17_Pointer))) <= (((((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((((*(WrapperStruct00_var_1_14_Pointer)) - 64) < ((*(WrapperStruct00_var_1_1_Pointer)) / -8)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))))) : 1)) && (((~ (*(WrapperStruct00_var_1_17_Pointer))) <= (((((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((((*(WrapperStruct00_var_1_14_Pointer)) - 64) < ((*(WrapperStruct00_var_1_1_Pointer)) / -8)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))))) : 1)) && (((~ (*(WrapperStruct00_var_1_17_Pointer))) <= (((((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((((*(WrapperStruct00_var_1_14_Pointer)) - 64) < ((*(WrapperStruct00_var_1_1_Pointer)) / -8)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer))))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((float) (*(WrapperStruct00_var_1_8_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))))) : 1)) && (((~ (*(WrapperStruct00_var_1_17_Pointer))) <= (((((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((((*(WrapperStruct00_var_1_14_Pointer)) - 64) < ((*(WrapperStruct00_var_1_1_Pointer)) / -8)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer))))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((float) (*(WrapperStruct00_var_1_8_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR (((((*(WrapperStruct00_var_1_2_Pointer)) ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))))) : 1)) && (((~ (*(WrapperStruct00_var_1_17_Pointer))) <= (((((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((((*(WrapperStruct00_var_1_14_Pointer)) - 64) < ((*(WrapperStruct00_var_1_1_Pointer)) / -8)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer))))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((float) (*(WrapperStruct00_var_1_8_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR (((((*(WrapperStruct00_var_1_2_Pointer)) ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))))) : 1)) && (((~ (*(WrapperStruct00_var_1_17_Pointer))) <= (((((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((((*(WrapperStruct00_var_1_14_Pointer)) - 64) < ((*(WrapperStruct00_var_1_1_Pointer)) / -8)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer))))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((float) (*(WrapperStruct00_var_1_8_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR ((((((*(WrapperStruct00_var_1_2_Pointer)) ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))))) : 1)) && (((~ (*(WrapperStruct00_var_1_17_Pointer))) <= (((((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((((*(WrapperStruct00_var_1_14_Pointer)) - 64) < ((*(WrapperStruct00_var_1_1_Pointer)) / -8)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer))))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((float) (*(WrapperStruct00_var_1_8_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_18_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR ((((((*(WrapperStruct00_var_1_2_Pointer)) ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))))) : 1)) && (((~ (*(WrapperStruct00_var_1_17_Pointer))) <= (((((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((((*(WrapperStruct00_var_1_14_Pointer)) - 64) < ((*(WrapperStruct00_var_1_1_Pointer)) / -8)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer))))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((float) (*(WrapperStruct00_var_1_8_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_18_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130-L131] return ((((((*(WrapperStruct00_var_1_2_Pointer)) ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))))) : 1)) && (((~ (*(WrapperStruct00_var_1_17_Pointer))) <= (((((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((((*(WrapperStruct00_var_1_14_Pointer)) - 64) < ((*(WrapperStruct00_var_1_1_Pointer)) / -8)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer))))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((float) (*(WrapperStruct00_var_1_8_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_18_Pointer)))) ; [L140] RET, EXPR property() [L140] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 104 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.5s, OverallIterations: 22, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2034 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2034 mSDsluCounter, 9613 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6629 mSDsCounter, 222 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2856 IncrementalHoareTripleChecker+Invalid, 3078 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 222 mSolverCounterUnsat, 2984 mSDtfsCounter, 2856 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 669 GetRequests, 577 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=369occurred in iteration=13, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 21 MinimizatonAttempts, 524 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 2514 NumberOfCodeBlocks, 2514 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2372 ConstructedInterpolants, 0 QuantifiedInterpolants, 12253 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 5544/5544 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-10-24 12:00:43,173 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-55.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 f20e9f2923b6fcf76854633fa4b44cb969c28b9197113751a22d94911b3dd6da --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 12:00:45,615 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 12:00:45,698 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 12:00:45,705 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 12:00:45,706 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 12:00:45,748 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 12:00:45,748 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 12:00:45,749 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 12:00:45,751 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 12:00:45,752 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 12:00:45,753 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 12:00:45,753 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 12:00:45,754 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 12:00:45,754 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 12:00:45,755 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 12:00:45,757 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 12:00:45,757 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 12:00:45,758 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 12:00:45,758 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 12:00:45,758 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 12:00:45,759 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 12:00:45,759 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 12:00:45,759 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 12:00:45,760 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 12:00:45,760 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 12:00:45,760 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 12:00:45,761 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 12:00:45,761 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 12:00:45,761 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 12:00:45,762 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 12:00:45,762 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 12:00:45,762 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 12:00:45,763 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 12:00:45,763 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 12:00:45,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:00:45,763 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 12:00:45,764 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 12:00:45,764 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 12:00:45,764 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 12:00:45,765 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 12:00:45,765 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 12:00:45,765 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 12:00:45,766 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 12:00:45,766 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 12:00:45,766 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 12:00:45,766 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 -> f20e9f2923b6fcf76854633fa4b44cb969c28b9197113751a22d94911b3dd6da [2024-10-24 12:00:46,135 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 12:00:46,162 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 12:00:46,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 12:00:46,167 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 12:00:46,168 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 12:00:46,171 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-55.i [2024-10-24 12:00:47,849 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 12:00:48,095 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 12:00:48,096 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-55.i [2024-10-24 12:00:48,106 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69c251419/a2aeac5b113049f297e319878657fbcf/FLAGaac1e232a [2024-10-24 12:00:48,427 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69c251419/a2aeac5b113049f297e319878657fbcf [2024-10-24 12:00:48,429 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 12:00:48,430 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 12:00:48,432 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 12:00:48,432 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 12:00:48,437 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 12:00:48,438 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:00:48" (1/1) ... [2024-10-24 12:00:48,439 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ede9115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:48, skipping insertion in model container [2024-10-24 12:00:48,439 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:00:48" (1/1) ... [2024-10-24 12:00:48,477 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 12:00:48,680 WARN L248 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-55.i[917,930] [2024-10-24 12:00:48,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:00:48,798 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 12:00:48,813 WARN L248 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-55.i[917,930] [2024-10-24 12:00:48,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:00:48,920 INFO L204 MainTranslator]: Completed translation [2024-10-24 12:00:48,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:48 WrapperNode [2024-10-24 12:00:48,921 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 12:00:48,922 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 12:00:48,922 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 12:00:48,923 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 12:00:48,931 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:48" (1/1) ... [2024-10-24 12:00:48,953 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:48" (1/1) ... [2024-10-24 12:00:49,010 INFO L138 Inliner]: procedures = 39, calls = 132, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 429 [2024-10-24 12:00:49,014 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 12:00:49,015 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 12:00:49,017 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 12:00:49,017 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 12:00:49,027 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:48" (1/1) ... [2024-10-24 12:00:49,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:48" (1/1) ... [2024-10-24 12:00:49,043 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:48" (1/1) ... [2024-10-24 12:00:49,078 INFO L175 MemorySlicer]: Split 108 memory accesses to 2 slices as follows [2, 106]. 98 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 14]. The 17 writes are split as follows [0, 17]. [2024-10-24 12:00:49,081 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:48" (1/1) ... [2024-10-24 12:00:49,082 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:48" (1/1) ... [2024-10-24 12:00:49,104 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:48" (1/1) ... [2024-10-24 12:00:49,109 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:48" (1/1) ... [2024-10-24 12:00:49,113 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:48" (1/1) ... [2024-10-24 12:00:49,115 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:48" (1/1) ... [2024-10-24 12:00:49,121 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 12:00:49,122 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 12:00:49,122 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 12:00:49,122 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 12:00:49,123 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:48" (1/1) ... [2024-10-24 12:00:49,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:00:49,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:00:49,161 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-10-24 12:00:49,167 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-10-24 12:00:49,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 12:00:49,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-24 12:00:49,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-24 12:00:49,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-24 12:00:49,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-24 12:00:49,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 12:00:49,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 12:00:49,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-24 12:00:49,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-24 12:00:49,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 12:00:49,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 12:00:49,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-24 12:00:49,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-24 12:00:49,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-24 12:00:49,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-24 12:00:49,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-24 12:00:49,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-24 12:00:49,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 12:00:49,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 12:00:49,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-24 12:00:49,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-24 12:00:49,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-24 12:00:49,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-24 12:00:49,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-24 12:00:49,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-24 12:00:49,230 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 12:00:49,231 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 12:00:49,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 12:00:49,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 12:00:49,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-24 12:00:49,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-24 12:00:49,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-24 12:00:49,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-24 12:00:49,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 12:00:49,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 12:00:49,393 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 12:00:49,395 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 12:00:54,976 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2024-10-24 12:00:54,977 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 12:00:55,049 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 12:00:55,050 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 12:00:55,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:00:55 BoogieIcfgContainer [2024-10-24 12:00:55,051 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 12:00:55,055 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 12:00:55,055 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 12:00:55,059 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 12:00:55,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:00:48" (1/3) ... [2024-10-24 12:00:55,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b50b252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:00:55, skipping insertion in model container [2024-10-24 12:00:55,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:48" (2/3) ... [2024-10-24 12:00:55,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b50b252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:00:55, skipping insertion in model container [2024-10-24 12:00:55,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:00:55" (3/3) ... [2024-10-24 12:00:55,063 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-55.i [2024-10-24 12:00:55,090 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 12:00:55,091 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 12:00:55,175 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 12:00:55,183 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;@5fb8305, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 12:00:55,184 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 12:00:55,189 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 77 states have (on average 1.4935064935064934) internal successors, (115), 78 states have internal predecessors, (115), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 12:00:55,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 12:00:55,200 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:00:55,201 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 12:00:55,201 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:00:55,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:00:55,206 INFO L85 PathProgramCache]: Analyzing trace with hash 2132164271, now seen corresponding path program 1 times [2024-10-24 12:00:55,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 12:00:55,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [464439191] [2024-10-24 12:00:55,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:00:55,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-10-24 12:00:55,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 12:00:55,229 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-10-24 12:00:55,232 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-10-24 12:00:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:55,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 12:00:55,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:00:55,936 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2024-10-24 12:00:55,936 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 12:00:55,937 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 12:00:55,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [464439191] [2024-10-24 12:00:55,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [464439191] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:00:55,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:00:55,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 12:00:55,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493054241] [2024-10-24 12:00:55,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:00:55,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 12:00:55,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 12:00:55,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 12:00:55,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 12:00:55,985 INFO L87 Difference]: Start difference. First operand has 92 states, 77 states have (on average 1.4935064935064934) internal successors, (115), 78 states have internal predecessors, (115), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 12:00:56,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:00:56,061 INFO L93 Difference]: Finished difference Result 181 states and 288 transitions. [2024-10-24 12:00:56,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 12:00:56,065 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2024-10-24 12:00:56,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:00:56,074 INFO L225 Difference]: With dead ends: 181 [2024-10-24 12:00:56,075 INFO L226 Difference]: Without dead ends: 90 [2024-10-24 12:00:56,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 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-10-24 12:00:56,086 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:00:56,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:00:56,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-24 12:00:56,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-24 12:00:56,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 76 states have internal predecessors, (108), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 12:00:56,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 132 transitions. [2024-10-24 12:00:56,143 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 132 transitions. Word has length 108 [2024-10-24 12:00:56,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:00:56,144 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 132 transitions. [2024-10-24 12:00:56,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 12:00:56,144 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 132 transitions. [2024-10-24 12:00:56,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 12:00:56,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:00:56,148 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 12:00:56,173 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-10-24 12:00:56,349 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-10-24 12:00:56,350 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:00:56,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:00:56,351 INFO L85 PathProgramCache]: Analyzing trace with hash -2053342689, now seen corresponding path program 1 times [2024-10-24 12:00:56,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 12:00:56,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1891778933] [2024-10-24 12:00:56,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:00:56,353 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-10-24 12:00:56,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 12:00:56,354 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-10-24 12:00:56,356 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-10-24 12:00:56,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:56,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 12:00:56,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:00:57,025 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-24 12:00:57,025 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 12:00:57,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 12:00:57,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1891778933] [2024-10-24 12:00:57,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1891778933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:00:57,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:00:57,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 12:00:57,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120243192] [2024-10-24 12:00:57,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:00:57,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:00:57,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 12:00:57,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:00:57,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:00:57,040 INFO L87 Difference]: Start difference. First operand 90 states and 132 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 12:00:57,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:00:57,223 INFO L93 Difference]: Finished difference Result 181 states and 266 transitions. [2024-10-24 12:00:57,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:00:57,224 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2024-10-24 12:00:57,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:00:57,226 INFO L225 Difference]: With dead ends: 181 [2024-10-24 12:00:57,228 INFO L226 Difference]: Without dead ends: 92 [2024-10-24 12:00:57,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 105 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-10-24 12:00:57,230 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 12:00:57,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 371 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 12:00:57,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-24 12:00:57,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-24 12:00:57,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 78 states have internal predecessors, (110), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 12:00:57,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-10-24 12:00:57,249 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 108 [2024-10-24 12:00:57,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:00:57,250 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-10-24 12:00:57,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 12:00:57,251 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-10-24 12:00:57,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 12:00:57,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:00:57,253 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 12:00:57,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 12:00:57,453 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-10-24 12:00:57,454 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:00:57,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:00:57,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1998949791, now seen corresponding path program 1 times [2024-10-24 12:00:57,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 12:00:57,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1665621851] [2024-10-24 12:00:57,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:00:57,456 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-10-24 12:00:57,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 12:00:57,484 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-10-24 12:00:57,485 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-10-24 12:00:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:58,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 12:00:58,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:00:58,219 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 12:00:58,220 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 12:00:58,220 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 12:00:58,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1665621851] [2024-10-24 12:00:58,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1665621851] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:00:58,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:00:58,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 12:00:58,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416489231] [2024-10-24 12:00:58,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:00:58,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 12:00:58,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 12:00:58,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 12:00:58,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 12:00:58,223 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 12:00:58,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:00:58,509 INFO L93 Difference]: Finished difference Result 188 states and 274 transitions. [2024-10-24 12:00:58,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 12:00:58,510 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-10-24 12:00:58,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:00:58,522 INFO L225 Difference]: With dead ends: 188 [2024-10-24 12:00:58,522 INFO L226 Difference]: Without dead ends: 97 [2024-10-24 12:00:58,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 104 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-10-24 12:00:58,524 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:00:58,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 482 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 12:00:58,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-24 12:00:58,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2024-10-24 12:00:58,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 82 states have internal predecessors, (114), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 12:00:58,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2024-10-24 12:00:58,544 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 108 [2024-10-24 12:00:58,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:00:58,545 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2024-10-24 12:00:58,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 12:00:58,545 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2024-10-24 12:00:58,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 12:00:58,554 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:00:58,555 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 12:00:58,604 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-10-24 12:00:58,755 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-10-24 12:00:58,756 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:00:58,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:00:58,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1486670879, now seen corresponding path program 1 times [2024-10-24 12:00:58,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 12:00:58,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [743614144] [2024-10-24 12:00:58,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:00:58,758 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-10-24 12:00:58,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 12:00:58,762 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-10-24 12:00:58,763 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-10-24 12:00:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:59,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 12:00:59,271 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:00:59,328 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 12:00:59,329 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 12:00:59,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 12:00:59,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [743614144] [2024-10-24 12:00:59,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [743614144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:00:59,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:00:59,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 12:00:59,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080525330] [2024-10-24 12:00:59,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:00:59,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 12:00:59,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 12:00:59,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 12:00:59,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 12:00:59,332 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 12:00:59,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:00:59,612 INFO L93 Difference]: Finished difference Result 194 states and 279 transitions. [2024-10-24 12:00:59,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 12:00:59,613 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-10-24 12:00:59,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:00:59,615 INFO L225 Difference]: With dead ends: 194 [2024-10-24 12:00:59,615 INFO L226 Difference]: Without dead ends: 99 [2024-10-24 12:00:59,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 12:00:59,617 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 1 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:00:59,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 593 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 12:00:59,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-24 12:00:59,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2024-10-24 12:00:59,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.380952380952381) internal successors, (116), 84 states have internal predecessors, (116), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 12:00:59,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2024-10-24 12:00:59,626 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 108 [2024-10-24 12:00:59,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:00:59,627 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2024-10-24 12:00:59,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 12:00:59,628 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2024-10-24 12:00:59,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 12:00:59,630 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:00:59,630 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 12:00:59,650 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 (5)] Forceful destruction successful, exit code 0 [2024-10-24 12:00:59,830 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-10-24 12:00:59,831 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:00:59,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:00:59,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1543929181, now seen corresponding path program 1 times [2024-10-24 12:00:59,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 12:00:59,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1944305579] [2024-10-24 12:00:59,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:00:59,839 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-10-24 12:00:59,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 12:00:59,844 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-10-24 12:00:59,846 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-10-24 12:01:00,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:00,370 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 12:01:00,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:01:00,484 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 12:01:00,484 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 12:01:00,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 12:01:00,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1944305579] [2024-10-24 12:01:00,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1944305579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:01:00,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:01:00,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 12:01:00,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518594420] [2024-10-24 12:01:00,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:01:00,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 12:01:00,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 12:01:00,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 12:01:00,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 12:01:00,488 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 12:01:00,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:01:00,841 INFO L93 Difference]: Finished difference Result 198 states and 283 transitions. [2024-10-24 12:01:00,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 12:01:00,842 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-10-24 12:01:00,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:01:00,844 INFO L225 Difference]: With dead ends: 198 [2024-10-24 12:01:00,844 INFO L226 Difference]: Without dead ends: 101 [2024-10-24 12:01:00,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 12:01:00,845 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 1 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:01:00,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 706 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 12:01:00,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-24 12:01:00,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-10-24 12:01:00,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 86 states have (on average 1.372093023255814) internal successors, (118), 86 states have internal predecessors, (118), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 12:01:00,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2024-10-24 12:01:00,868 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 108 [2024-10-24 12:01:00,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:01:00,869 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2024-10-24 12:01:00,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 12:01:00,869 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2024-10-24 12:01:00,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 12:01:00,871 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:01:00,875 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 12:01:00,904 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-10-24 12:01:01,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-10-24 12:01:01,076 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:01:01,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:01:01,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1543988763, now seen corresponding path program 1 times [2024-10-24 12:01:01,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 12:01:01,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [734761840] [2024-10-24 12:01:01,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:01:01,079 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-10-24 12:01:01,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 12:01:01,082 INFO L229 MonitoredProcess]: Starting monitored process 7 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-10-24 12:01:01,083 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 (7)] Waiting until timeout for monitored process [2024-10-24 12:01:01,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:01,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 12:01:01,587 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:01:01,776 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 12:01:01,777 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 173 treesize of output 65 [2024-10-24 12:01:01,839 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-10-24 12:01:01,839 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 12:01:01,839 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 12:01:01,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [734761840] [2024-10-24 12:01:01,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [734761840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:01:01,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:01:01,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 12:01:01,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759496663] [2024-10-24 12:01:01,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:01:01,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 12:01:01,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 12:01:01,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 12:01:01,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 12:01:01,842 INFO L87 Difference]: Start difference. First operand 100 states and 142 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 12:01:05,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 12:01:09,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 12:01:10,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:01:10,288 INFO L93 Difference]: Finished difference Result 200 states and 284 transitions. [2024-10-24 12:01:10,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 12:01:10,289 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2024-10-24 12:01:10,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:01:10,290 INFO L225 Difference]: With dead ends: 200 [2024-10-24 12:01:10,290 INFO L226 Difference]: Without dead ends: 101 [2024-10-24 12:01:10,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-24 12:01:10,292 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 115 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:01:10,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 365 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2024-10-24 12:01:10,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-24 12:01:10,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-10-24 12:01:10,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 12:01:10,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 141 transitions. [2024-10-24 12:01:10,299 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 141 transitions. Word has length 108 [2024-10-24 12:01:10,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:01:10,299 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 141 transitions. [2024-10-24 12:01:10,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 12:01:10,300 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 141 transitions. [2024-10-24 12:01:10,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-24 12:01:10,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:01:10,304 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 12:01:10,321 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 (7)] Forceful destruction successful, exit code 0 [2024-10-24 12:01:10,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-10-24 12:01:10,505 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:01:10,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:01:10,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1944154921, now seen corresponding path program 1 times [2024-10-24 12:01:10,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 12:01:10,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1796320157] [2024-10-24 12:01:10,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:01:10,506 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-10-24 12:01:10,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 12:01:10,508 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-10-24 12:01:10,509 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-10-24 12:01:10,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:10,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 12:01:10,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:01:11,034 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 12:01:11,034 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 12:01:11,034 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 12:01:11,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1796320157] [2024-10-24 12:01:11,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1796320157] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:01:11,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:01:11,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 12:01:11,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164522508] [2024-10-24 12:01:11,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:01:11,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 12:01:11,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 12:01:11,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 12:01:11,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 12:01:11,036 INFO L87 Difference]: Start difference. First operand 100 states and 141 transitions. Second operand has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-24 12:01:11,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:01:11,287 INFO L93 Difference]: Finished difference Result 203 states and 286 transitions. [2024-10-24 12:01:11,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 12:01:11,287 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 110 [2024-10-24 12:01:11,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:01:11,288 INFO L225 Difference]: With dead ends: 203 [2024-10-24 12:01:11,289 INFO L226 Difference]: Without dead ends: 102 [2024-10-24 12:01:11,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 12:01:11,290 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 12:01:11,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 528 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 12:01:11,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-24 12:01:11,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2024-10-24 12:01:11,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 12:01:11,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 140 transitions. [2024-10-24 12:01:11,297 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 140 transitions. Word has length 110 [2024-10-24 12:01:11,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:01:11,297 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 140 transitions. [2024-10-24 12:01:11,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-24 12:01:11,298 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 140 transitions. [2024-10-24 12:01:11,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-24 12:01:11,299 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:01:11,299 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 12:01:11,320 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-10-24 12:01:11,500 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-10-24 12:01:11,500 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:01:11,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:01:11,501 INFO L85 PathProgramCache]: Analyzing trace with hash -886316843, now seen corresponding path program 1 times [2024-10-24 12:01:11,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 12:01:11,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [487720036] [2024-10-24 12:01:11,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:01:11,502 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-10-24 12:01:11,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 12:01:11,503 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-10-24 12:01:11,504 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-10-24 12:01:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:11,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 12:01:11,964 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:01:12,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 12:01:12,232 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 173 treesize of output 65 [2024-10-24 12:01:12,276 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-24 12:01:12,276 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 12:01:12,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 12:01:12,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [487720036] [2024-10-24 12:01:12,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [487720036] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:01:12,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:01:12,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 12:01:12,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198743555] [2024-10-24 12:01:12,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:01:12,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 12:01:12,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 12:01:12,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 12:01:12,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 12:01:12,279 INFO L87 Difference]: Start difference. First operand 100 states and 140 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 12:01:15,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 12:01:20,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 12:01:21,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:01:21,121 INFO L93 Difference]: Finished difference Result 200 states and 280 transitions. [2024-10-24 12:01:21,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 12:01:21,123 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2024-10-24 12:01:21,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:01:21,123 INFO L225 Difference]: With dead ends: 200 [2024-10-24 12:01:21,124 INFO L226 Difference]: Without dead ends: 101 [2024-10-24 12:01:21,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-24 12:01:21,125 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 105 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2024-10-24 12:01:21,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 357 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 8.8s Time] [2024-10-24 12:01:21,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-24 12:01:21,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-10-24 12:01:21,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 12:01:21,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 139 transitions. [2024-10-24 12:01:21,133 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 139 transitions. Word has length 110 [2024-10-24 12:01:21,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:01:21,133 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 139 transitions. [2024-10-24 12:01:21,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 12:01:21,134 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 139 transitions. [2024-10-24 12:01:21,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-24 12:01:21,135 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:01:21,135 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 12:01:21,155 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-10-24 12:01:21,335 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-10-24 12:01:21,336 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:01:21,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:01:21,337 INFO L85 PathProgramCache]: Analyzing trace with hash -307408933, now seen corresponding path program 1 times [2024-10-24 12:01:21,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 12:01:21,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1514377292] [2024-10-24 12:01:21,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:01:21,337 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-10-24 12:01:21,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 12:01:21,340 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-10-24 12:01:21,341 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-10-24 12:01:21,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:21,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 12:01:21,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:01:22,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 12:01:22,220 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 173 treesize of output 65 [2024-10-24 12:01:22,280 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-24 12:01:22,280 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 12:01:22,280 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 12:01:22,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1514377292] [2024-10-24 12:01:22,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1514377292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:01:22,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:01:22,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 12:01:22,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702692618] [2024-10-24 12:01:22,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:01:22,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 12:01:22,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 12:01:22,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 12:01:22,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 12:01:22,284 INFO L87 Difference]: Start difference. First operand 100 states and 139 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 12:01:25,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 12:01:29,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 12:01:29,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:01:29,935 INFO L93 Difference]: Finished difference Result 199 states and 277 transitions. [2024-10-24 12:01:29,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 12:01:29,936 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 112 [2024-10-24 12:01:29,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:01:29,937 INFO L225 Difference]: With dead ends: 199 [2024-10-24 12:01:29,937 INFO L226 Difference]: Without dead ends: 100 [2024-10-24 12:01:29,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-24 12:01:29,938 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 96 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2024-10-24 12:01:29,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 353 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2024-10-24 12:01:29,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-24 12:01:29,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2024-10-24 12:01:29,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.3333333333333333) internal successors, (112), 84 states have internal predecessors, (112), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 12:01:29,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 136 transitions. [2024-10-24 12:01:29,945 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 136 transitions. Word has length 112 [2024-10-24 12:01:29,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:01:29,946 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 136 transitions. [2024-10-24 12:01:29,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 12:01:29,947 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 136 transitions. [2024-10-24 12:01:29,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 12:01:29,948 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:01:29,953 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 12:01:29,974 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 (10)] Ended with exit code 0 [2024-10-24 12:01:30,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-10-24 12:01:30,154 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:01:30,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:01:30,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1726953261, now seen corresponding path program 1 times [2024-10-24 12:01:30,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 12:01:30,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [619628529] [2024-10-24 12:01:30,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:01:30,155 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-10-24 12:01:30,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 12:01:30,158 INFO L229 MonitoredProcess]: Starting monitored process 11 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-10-24 12:01:30,159 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 (11)] Waiting until timeout for monitored process [2024-10-24 12:01:30,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:30,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 12:01:30,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:01:31,083 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 12:01:31,084 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 172 treesize of output 64 [2024-10-24 12:01:31,211 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 140 proven. 24 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-24 12:01:31,212 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 12:01:31,672 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 12:01:31,673 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 110 treesize of output 1 [2024-10-24 12:01:31,719 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-10-24 12:01:31,719 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 12:01:31,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [619628529] [2024-10-24 12:01:31,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [619628529] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 12:01:31,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 12:01:31,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-10-24 12:01:31,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118774058] [2024-10-24 12:01:31,720 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 12:01:31,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 12:01:31,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 12:01:31,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 12:01:31,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-24 12:01:31,722 INFO L87 Difference]: Start difference. First operand 98 states and 136 transitions. Second operand has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 12 states have internal predecessors, (90), 4 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-10-24 12:01:36,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 12:01:38,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 12:01:42,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []