./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_fillercode_fillercodestructure_filler-pr-ci_file-36.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-36.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 1826fac0aaf6beb599525d92da03802aca3a315a8be49017dad700e98d033a28 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:27:50,195 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:27:50,276 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 09:27:50,280 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:27:50,280 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:27:50,306 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:27:50,306 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:27:50,307 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:27:50,307 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:27:50,308 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:27:50,308 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:27:50,309 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:27:50,309 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:27:50,310 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:27:50,310 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:27:50,310 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:27:50,311 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:27:50,311 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:27:50,312 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 09:27:50,312 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:27:50,312 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:27:50,314 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:27:50,314 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:27:50,314 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:27:50,314 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:27:50,315 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:27:50,315 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:27:50,315 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:27:50,316 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:27:50,316 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:27:50,316 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:27:50,316 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:27:50,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:27:50,318 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:27:50,319 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:27:50,319 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:27:50,320 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 09:27:50,320 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 09:27:50,320 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:27:50,320 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:27:50,321 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:27:50,321 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:27:50,321 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-clean/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-clean/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 -> 1826fac0aaf6beb599525d92da03802aca3a315a8be49017dad700e98d033a28 [2024-10-11 09:27:50,580 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:27:50,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:27:50,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:27:50,613 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:27:50,614 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:27:50,615 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-36.i [2024-10-11 09:27:52,155 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:27:52,398 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:27:52,399 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-36.i [2024-10-11 09:27:52,410 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/77653645f/0244ec9cbd4e4d039dfd5711baad17cd/FLAGd28afeb43 [2024-10-11 09:27:52,733 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/77653645f/0244ec9cbd4e4d039dfd5711baad17cd [2024-10-11 09:27:52,738 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:27:52,742 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:27:52,744 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:27:52,744 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:27:52,750 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:27:52,751 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:27:52" (1/1) ... [2024-10-11 09:27:52,754 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dc00251 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:52, skipping insertion in model container [2024-10-11 09:27:52,754 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:27:52" (1/1) ... [2024-10-11 09:27:52,792 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:27:52,958 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_fillercode_fillercodestructure_filler-pr-ci_file-36.i[919,932] [2024-10-11 09:27:53,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:27:53,066 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:27:53,078 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_fillercode_fillercodestructure_filler-pr-ci_file-36.i[919,932] [2024-10-11 09:27:53,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:27:53,158 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:27:53,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:53 WrapperNode [2024-10-11 09:27:53,158 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:27:53,159 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:27:53,160 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:27:53,160 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:27:53,168 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:53" (1/1) ... [2024-10-11 09:27:53,180 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:53" (1/1) ... [2024-10-11 09:27:53,223 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 231 [2024-10-11 09:27:53,223 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:27:53,224 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:27:53,224 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:27:53,224 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:27:53,241 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:53" (1/1) ... [2024-10-11 09:27:53,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:53" (1/1) ... [2024-10-11 09:27:53,248 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:53" (1/1) ... [2024-10-11 09:27:53,282 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 09:27:53,283 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:53" (1/1) ... [2024-10-11 09:27:53,283 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:53" (1/1) ... [2024-10-11 09:27:53,303 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:53" (1/1) ... [2024-10-11 09:27:53,311 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:53" (1/1) ... [2024-10-11 09:27:53,321 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:53" (1/1) ... [2024-10-11 09:27:53,323 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:53" (1/1) ... [2024-10-11 09:27:53,332 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:27:53,335 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:27:53,336 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:27:53,336 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:27:53,337 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:53" (1/1) ... [2024-10-11 09:27:53,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:27:53,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:27:53,372 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 09:27:53,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 09:27:53,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:27:53,448 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:27:53,449 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:27:53,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 09:27:53,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:27:53,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:27:53,577 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:27:53,579 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:27:54,055 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 09:27:54,056 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:27:54,126 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:27:54,127 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:27:54,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:27:54 BoogieIcfgContainer [2024-10-11 09:27:54,127 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:27:54,130 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:27:54,130 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:27:54,136 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:27:54,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:27:52" (1/3) ... [2024-10-11 09:27:54,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44b0c380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:27:54, skipping insertion in model container [2024-10-11 09:27:54,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:53" (2/3) ... [2024-10-11 09:27:54,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44b0c380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:27:54, skipping insertion in model container [2024-10-11 09:27:54,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:27:54" (3/3) ... [2024-10-11 09:27:54,140 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-36.i [2024-10-11 09:27:54,155 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:27:54,156 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:27:54,226 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:27:54,233 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;@302b30f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:27:54,234 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:27:54,239 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 61 states have (on average 1.4754098360655739) internal successors, (90), 62 states have internal predecessors, (90), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 09:27:54,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-11 09:27:54,256 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:27:54,258 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:27:54,258 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:27:54,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:27:54,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1615065824, now seen corresponding path program 1 times [2024-10-11 09:27:54,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:27:54,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933649208] [2024-10-11 09:27:54,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:27:54,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:27:54,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:54,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:27:54,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:54,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:27:54,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:54,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:27:54,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:54,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:27:54,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:54,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:27:54,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:54,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 09:27:54,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:54,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 09:27:54,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:54,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 09:27:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:54,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 09:27:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:54,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 09:27:54,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:54,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 09:27:54,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:54,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 09:27:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:54,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:27:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:54,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 09:27:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:54,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 09:27:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:54,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 09:27:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:54,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 09:27:54,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:54,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 09:27:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:54,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 09:27:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:54,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 09:27:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:54,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 09:27:54,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:54,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 09:27:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:54,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 09:27:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:54,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:27:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:54,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 09:27:54,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:54,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 09:27:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:54,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 09:27:54,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:54,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-11 09:27:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:54,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-11 09:27:54,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:54,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-11 09:27:54,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:54,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-11 09:27:54,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:54,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 09:27:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:54,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-11 09:27:54,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:27:54,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933649208] [2024-10-11 09:27:54,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933649208] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:27:54,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:27:54,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:27:54,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383995016] [2024-10-11 09:27:54,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:27:54,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:27:54,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:27:54,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:27:54,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:27:54,893 INFO L87 Difference]: Start difference. First operand has 96 states, 61 states have (on average 1.4754098360655739) internal successors, (90), 62 states have internal predecessors, (90), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-11 09:27:54,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:27:54,942 INFO L93 Difference]: Finished difference Result 189 states and 338 transitions. [2024-10-11 09:27:54,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:27:54,946 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 205 [2024-10-11 09:27:54,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:27:54,954 INFO L225 Difference]: With dead ends: 189 [2024-10-11 09:27:54,955 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 09:27:54,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 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-11 09:27:54,964 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:27:54,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:27:54,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 09:27:55,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-11 09:27:55,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 60 states have (on average 1.4) internal successors, (84), 60 states have internal predecessors, (84), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 09:27:55,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 148 transitions. [2024-10-11 09:27:55,025 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 148 transitions. Word has length 205 [2024-10-11 09:27:55,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:27:55,025 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 148 transitions. [2024-10-11 09:27:55,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-11 09:27:55,026 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 148 transitions. [2024-10-11 09:27:55,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-11 09:27:55,032 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:27:55,032 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:27:55,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 09:27:55,033 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:27:55,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:27:55,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1940823716, now seen corresponding path program 1 times [2024-10-11 09:27:55,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:27:55,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860537295] [2024-10-11 09:27:55,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:27:55,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:27:55,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:27:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:27:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:27:55,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:27:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:27:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 09:27:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 09:27:55,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 09:27:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 09:27:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 09:27:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 09:27:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 09:27:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:27:55,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 09:27:55,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 09:27:55,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 09:27:55,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 09:27:55,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 09:27:55,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 09:27:55,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 09:27:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 09:27:55,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 09:27:55,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 09:27:55,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:27:55,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 09:27:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 09:27:55,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 09:27:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-11 09:27:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-11 09:27:55,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-11 09:27:55,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-11 09:27:55,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 09:27:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-11 09:27:55,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:27:55,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860537295] [2024-10-11 09:27:55,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860537295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:27:55,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:27:55,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:27:55,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326866876] [2024-10-11 09:27:55,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:27:55,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:27:55,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:27:55,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:27:55,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:27:55,441 INFO L87 Difference]: Start difference. First operand 94 states and 148 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 09:27:55,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:27:55,536 INFO L93 Difference]: Finished difference Result 222 states and 351 transitions. [2024-10-11 09:27:55,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:27:55,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 205 [2024-10-11 09:27:55,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:27:55,540 INFO L225 Difference]: With dead ends: 222 [2024-10-11 09:27:55,540 INFO L226 Difference]: Without dead ends: 129 [2024-10-11 09:27:55,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 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-11 09:27:55,542 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 51 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:27:55,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 270 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 09:27:55,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-11 09:27:55,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 123. [2024-10-11 09:27:55,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 89 states have (on average 1.449438202247191) internal successors, (129), 89 states have internal predecessors, (129), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 09:27:55,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 193 transitions. [2024-10-11 09:27:55,561 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 193 transitions. Word has length 205 [2024-10-11 09:27:55,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:27:55,563 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 193 transitions. [2024-10-11 09:27:55,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 09:27:55,564 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 193 transitions. [2024-10-11 09:27:55,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-11 09:27:55,567 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:27:55,567 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:27:55,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 09:27:55,568 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:27:55,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:27:55,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1931441754, now seen corresponding path program 1 times [2024-10-11 09:27:55,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:27:55,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174761807] [2024-10-11 09:27:55,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:27:55,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:27:55,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:27:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:27:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:27:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:27:55,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:27:55,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 09:27:55,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 09:27:55,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 09:27:55,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 09:27:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 09:27:55,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 09:27:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 09:27:55,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:27:55,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 09:27:55,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 09:27:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 09:27:55,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 09:27:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 09:27:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 09:27:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 09:27:55,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 09:27:55,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 09:27:55,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 09:27:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:27:55,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 09:27:55,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 09:27:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 09:27:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-11 09:27:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-11 09:27:55,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-11 09:27:55,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-11 09:27:55,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 09:27:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:55,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-11 09:27:55,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:27:55,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174761807] [2024-10-11 09:27:55,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174761807] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:27:55,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:27:55,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:27:55,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966753662] [2024-10-11 09:27:55,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:27:55,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:27:55,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:27:55,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:27:55,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:27:55,945 INFO L87 Difference]: Start difference. First operand 123 states and 193 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 09:27:56,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:27:56,056 INFO L93 Difference]: Finished difference Result 311 states and 488 transitions. [2024-10-11 09:27:56,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:27:56,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 205 [2024-10-11 09:27:56,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:27:56,059 INFO L225 Difference]: With dead ends: 311 [2024-10-11 09:27:56,059 INFO L226 Difference]: Without dead ends: 189 [2024-10-11 09:27:56,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 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-11 09:27:56,066 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 72 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:27:56,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 278 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 09:27:56,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-10-11 09:27:56,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2024-10-11 09:27:56,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 140 states have (on average 1.4714285714285715) internal successors, (206), 141 states have internal predecessors, (206), 43 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-11 09:27:56,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 292 transitions. [2024-10-11 09:27:56,103 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 292 transitions. Word has length 205 [2024-10-11 09:27:56,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:27:56,104 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 292 transitions. [2024-10-11 09:27:56,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 09:27:56,105 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 292 transitions. [2024-10-11 09:27:56,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-11 09:27:56,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:27:56,114 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:27:56,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 09:27:56,114 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:27:56,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:27:56,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1221712008, now seen corresponding path program 1 times [2024-10-11 09:27:56,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:27:56,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885228163] [2024-10-11 09:27:56,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:27:56,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:27:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:57,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:27:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:57,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:27:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:57,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:27:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:57,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:27:57,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:57,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:27:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:57,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 09:27:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:57,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 09:27:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:57,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 09:27:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:57,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 09:27:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:57,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 09:27:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:57,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 09:27:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:57,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 09:27:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:57,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:27:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:57,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 09:27:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:57,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 09:27:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:57,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 09:27:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:57,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 09:27:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:57,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 09:27:57,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:57,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 09:27:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:57,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 09:27:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:57,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 09:27:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:57,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 09:27:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:57,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 09:27:57,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:57,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:27:57,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:57,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 09:27:57,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:57,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 09:27:57,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:57,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 09:27:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:57,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-11 09:27:57,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:57,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-11 09:27:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:57,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-11 09:27:57,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:57,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-11 09:27:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:57,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 09:27:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:57,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 84 proven. 9 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-11 09:27:57,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:27:57,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885228163] [2024-10-11 09:27:57,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885228163] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:27:57,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895352652] [2024-10-11 09:27:57,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:27:57,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:27:57,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:27:57,394 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:27:57,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 09:27:57,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:57,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 09:27:57,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:27:58,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1321 proven. 66 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2024-10-11 09:27:58,181 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:27:58,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 27 proven. 66 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-11 09:27:58,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895352652] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:27:58,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 09:27:58,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2024-10-11 09:27:58,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789854395] [2024-10-11 09:27:58,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 09:27:58,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 09:27:58,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:27:58,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 09:27:58,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-10-11 09:27:58,565 INFO L87 Difference]: Start difference. First operand 186 states and 292 transitions. Second operand has 16 states, 16 states have (on average 7.625) internal successors, (122), 16 states have internal predecessors, (122), 6 states have call successors, (76), 3 states have call predecessors, (76), 5 states have return successors, (78), 6 states have call predecessors, (78), 6 states have call successors, (78) [2024-10-11 09:28:00,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:28:00,039 INFO L93 Difference]: Finished difference Result 590 states and 899 transitions. [2024-10-11 09:28:00,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-11 09:28:00,041 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.625) internal successors, (122), 16 states have internal predecessors, (122), 6 states have call successors, (76), 3 states have call predecessors, (76), 5 states have return successors, (78), 6 states have call predecessors, (78), 6 states have call successors, (78) Word has length 206 [2024-10-11 09:28:00,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:28:00,048 INFO L225 Difference]: With dead ends: 590 [2024-10-11 09:28:00,050 INFO L226 Difference]: Without dead ends: 405 [2024-10-11 09:28:00,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 472 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=391, Invalid=1091, Unknown=0, NotChecked=0, Total=1482 [2024-10-11 09:28:00,054 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 391 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 09:28:00,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 557 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 09:28:00,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-10-11 09:28:00,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 354. [2024-10-11 09:28:00,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 287 states have (on average 1.4634146341463414) internal successors, (420), 290 states have internal predecessors, (420), 57 states have call successors, (57), 9 states have call predecessors, (57), 9 states have return successors, (57), 54 states have call predecessors, (57), 57 states have call successors, (57) [2024-10-11 09:28:00,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 534 transitions. [2024-10-11 09:28:00,115 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 534 transitions. Word has length 206 [2024-10-11 09:28:00,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:28:00,117 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 534 transitions. [2024-10-11 09:28:00,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.625) internal successors, (122), 16 states have internal predecessors, (122), 6 states have call successors, (76), 3 states have call predecessors, (76), 5 states have return successors, (78), 6 states have call predecessors, (78), 6 states have call successors, (78) [2024-10-11 09:28:00,117 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 534 transitions. [2024-10-11 09:28:00,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-11 09:28:00,120 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:28:00,121 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:28:00,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 09:28:00,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:28:00,322 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:28:00,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:28:00,323 INFO L85 PathProgramCache]: Analyzing trace with hash -2108995332, now seen corresponding path program 1 times [2024-10-11 09:28:00,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:28:00,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720160051] [2024-10-11 09:28:00,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:28:00,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:28:00,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:00,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:28:00,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:00,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:28:00,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:00,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:28:00,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:00,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:28:00,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:00,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:28:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:00,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 09:28:00,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:00,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 09:28:00,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:00,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 09:28:00,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:00,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 09:28:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:00,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 09:28:00,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:00,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 09:28:00,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:00,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 09:28:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:00,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:28:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:00,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 09:28:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:00,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 09:28:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:00,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 09:28:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:00,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 09:28:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:00,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 09:28:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:00,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 09:28:00,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:00,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 09:28:00,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:00,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 09:28:00,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:00,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 09:28:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:00,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 09:28:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:00,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:28:00,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:00,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 09:28:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:00,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 09:28:00,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:00,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 09:28:00,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:00,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-11 09:28:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:00,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-11 09:28:00,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:00,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-11 09:28:00,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:00,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-11 09:28:00,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:00,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 09:28:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:00,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 21 proven. 72 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-11 09:28:00,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:28:00,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720160051] [2024-10-11 09:28:00,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720160051] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:28:00,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533287866] [2024-10-11 09:28:00,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:28:00,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:28:00,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:28:00,856 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:28:00,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 09:28:01,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:01,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 09:28:01,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:28:01,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 717 proven. 72 refuted. 0 times theorem prover too weak. 1195 trivial. 0 not checked. [2024-10-11 09:28:01,319 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:28:01,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 21 proven. 72 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-11 09:28:01,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533287866] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:28:01,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 09:28:01,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-10-11 09:28:01,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827112259] [2024-10-11 09:28:01,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 09:28:01,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 09:28:01,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:28:01,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 09:28:01,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-11 09:28:01,603 INFO L87 Difference]: Start difference. First operand 354 states and 534 transitions. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 3 states have call successors, (80), 2 states have call predecessors, (80), 4 states have return successors, (81), 3 states have call predecessors, (81), 3 states have call successors, (81) [2024-10-11 09:28:02,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:28:02,370 INFO L93 Difference]: Finished difference Result 766 states and 1121 transitions. [2024-10-11 09:28:02,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-11 09:28:02,371 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 3 states have call successors, (80), 2 states have call predecessors, (80), 4 states have return successors, (81), 3 states have call predecessors, (81), 3 states have call successors, (81) Word has length 206 [2024-10-11 09:28:02,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:28:02,376 INFO L225 Difference]: With dead ends: 766 [2024-10-11 09:28:02,376 INFO L226 Difference]: Without dead ends: 413 [2024-10-11 09:28:02,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 472 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=233, Invalid=523, Unknown=0, NotChecked=0, Total=756 [2024-10-11 09:28:02,379 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 203 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 09:28:02,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 444 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 09:28:02,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-10-11 09:28:02,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 352. [2024-10-11 09:28:02,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 278 states have (on average 1.39568345323741) internal successors, (388), 281 states have internal predecessors, (388), 59 states have call successors, (59), 14 states have call predecessors, (59), 14 states have return successors, (59), 56 states have call predecessors, (59), 59 states have call successors, (59) [2024-10-11 09:28:02,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 506 transitions. [2024-10-11 09:28:02,435 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 506 transitions. Word has length 206 [2024-10-11 09:28:02,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:28:02,436 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 506 transitions. [2024-10-11 09:28:02,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 3 states have call successors, (80), 2 states have call predecessors, (80), 4 states have return successors, (81), 3 states have call predecessors, (81), 3 states have call successors, (81) [2024-10-11 09:28:02,436 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 506 transitions. [2024-10-11 09:28:02,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-10-11 09:28:02,439 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:28:02,439 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:28:02,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 09:28:02,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:28:02,644 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:28:02,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:28:02,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1448109133, now seen corresponding path program 1 times [2024-10-11 09:28:02,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:28:02,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080798462] [2024-10-11 09:28:02,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:28:02,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:28:02,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:02,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:28:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:02,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:28:02,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:02,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:28:02,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:02,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:28:02,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:02,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:28:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:02,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 09:28:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:02,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 09:28:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:02,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 09:28:02,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:02,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 09:28:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:02,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 09:28:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:02,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 09:28:02,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:02,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 09:28:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:02,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:28:02,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:02,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 09:28:02,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:02,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 09:28:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:02,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 09:28:02,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:02,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 09:28:02,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:02,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 09:28:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:02,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 09:28:02,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:02,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 09:28:02,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:02,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 09:28:02,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:02,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 09:28:02,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:02,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 09:28:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:02,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:28:02,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:02,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 09:28:02,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:03,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 09:28:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:03,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 09:28:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:03,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-11 09:28:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:03,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-11 09:28:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:03,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-11 09:28:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:03,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-11 09:28:03,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:03,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 09:28:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:03,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-11 09:28:03,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:28:03,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080798462] [2024-10-11 09:28:03,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080798462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:28:03,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:28:03,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 09:28:03,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24270538] [2024-10-11 09:28:03,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:28:03,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 09:28:03,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:28:03,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 09:28:03,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:28:03,020 INFO L87 Difference]: Start difference. First operand 352 states and 506 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 09:28:03,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:28:03,429 INFO L93 Difference]: Finished difference Result 783 states and 1109 transitions. [2024-10-11 09:28:03,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 09:28:03,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 207 [2024-10-11 09:28:03,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:28:03,433 INFO L225 Difference]: With dead ends: 783 [2024-10-11 09:28:03,433 INFO L226 Difference]: Without dead ends: 432 [2024-10-11 09:28:03,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 09:28:03,435 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 133 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 09:28:03,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 573 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 09:28:03,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-10-11 09:28:03,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 322. [2024-10-11 09:28:03,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 256 states have (on average 1.40234375) internal successors, (359), 258 states have internal predecessors, (359), 52 states have call successors, (52), 13 states have call predecessors, (52), 13 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 09:28:03,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 463 transitions. [2024-10-11 09:28:03,487 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 463 transitions. Word has length 207 [2024-10-11 09:28:03,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:28:03,488 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 463 transitions. [2024-10-11 09:28:03,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 09:28:03,489 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 463 transitions. [2024-10-11 09:28:03,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-10-11 09:28:03,491 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:28:03,491 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:28:03,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 09:28:03,493 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:28:03,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:28:03,494 INFO L85 PathProgramCache]: Analyzing trace with hash -558860417, now seen corresponding path program 1 times [2024-10-11 09:28:03,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:28:03,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550300368] [2024-10-11 09:28:03,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:28:03,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:28:03,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:03,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:28:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:03,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:28:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:03,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:28:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:03,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:28:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:03,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:28:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:03,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 09:28:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:03,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 09:28:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:03,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 09:28:03,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:03,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 09:28:03,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:03,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 09:28:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:03,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 09:28:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:03,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 09:28:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:03,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:28:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:03,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 09:28:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:03,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 09:28:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:03,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 09:28:03,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:03,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 09:28:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:03,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 09:28:03,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:03,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 09:28:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:03,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 09:28:03,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:03,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 09:28:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:03,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 09:28:03,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:03,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 09:28:03,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:03,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:28:03,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:03,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 09:28:03,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:03,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 09:28:03,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:03,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 09:28:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:03,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-11 09:28:03,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:03,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-11 09:28:03,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:03,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-11 09:28:03,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:03,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-11 09:28:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:03,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 09:28:03,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:03,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-11 09:28:03,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:28:03,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550300368] [2024-10-11 09:28:03,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550300368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:28:03,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:28:03,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:28:03,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703868768] [2024-10-11 09:28:03,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:28:03,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:28:03,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:28:03,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:28:03,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:28:03,706 INFO L87 Difference]: Start difference. First operand 322 states and 463 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 09:28:03,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:28:03,826 INFO L93 Difference]: Finished difference Result 692 states and 993 transitions. [2024-10-11 09:28:03,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:28:03,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 207 [2024-10-11 09:28:03,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:28:03,833 INFO L225 Difference]: With dead ends: 692 [2024-10-11 09:28:03,834 INFO L226 Difference]: Without dead ends: 361 [2024-10-11 09:28:03,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 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-11 09:28:03,836 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 55 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:28:03,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 250 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 09:28:03,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-10-11 09:28:03,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 281. [2024-10-11 09:28:03,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 226 states have (on average 1.3938053097345133) internal successors, (315), 227 states have internal predecessors, (315), 43 states have call successors, (43), 11 states have call predecessors, (43), 11 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-11 09:28:03,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 401 transitions. [2024-10-11 09:28:03,880 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 401 transitions. Word has length 207 [2024-10-11 09:28:03,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:28:03,880 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 401 transitions. [2024-10-11 09:28:03,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 09:28:03,881 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 401 transitions. [2024-10-11 09:28:03,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-10-11 09:28:03,883 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:28:03,883 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:28:03,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 09:28:03,884 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:28:03,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:28:03,884 INFO L85 PathProgramCache]: Analyzing trace with hash 450147094, now seen corresponding path program 1 times [2024-10-11 09:28:03,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:28:03,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832137031] [2024-10-11 09:28:03,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:28:03,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:28:03,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:28:04,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:28:04,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:28:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:28:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:28:04,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 09:28:04,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 09:28:04,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 09:28:04,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 09:28:04,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 09:28:04,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 09:28:04,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 09:28:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:28:04,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 09:28:04,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 09:28:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 09:28:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 09:28:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 09:28:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 09:28:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 09:28:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 09:28:04,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 09:28:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 09:28:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:28:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 09:28:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 09:28:04,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 09:28:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-11 09:28:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-11 09:28:04,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-11 09:28:04,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-11 09:28:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 09:28:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-11 09:28:04,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:28:04,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832137031] [2024-10-11 09:28:04,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832137031] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:28:04,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:28:04,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:28:04,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923031128] [2024-10-11 09:28:04,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:28:04,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:28:04,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:28:04,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:28:04,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:28:04,415 INFO L87 Difference]: Start difference. First operand 281 states and 401 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 09:28:04,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:28:04,597 INFO L93 Difference]: Finished difference Result 581 states and 826 transitions. [2024-10-11 09:28:04,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:28:04,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 207 [2024-10-11 09:28:04,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:28:04,600 INFO L225 Difference]: With dead ends: 581 [2024-10-11 09:28:04,600 INFO L226 Difference]: Without dead ends: 301 [2024-10-11 09:28:04,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 69 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-11 09:28:04,601 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 40 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:28:04,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 265 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 09:28:04,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-10-11 09:28:04,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 281. [2024-10-11 09:28:04,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 226 states have (on average 1.3893805309734513) internal successors, (314), 227 states have internal predecessors, (314), 43 states have call successors, (43), 11 states have call predecessors, (43), 11 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-11 09:28:04,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 400 transitions. [2024-10-11 09:28:04,641 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 400 transitions. Word has length 207 [2024-10-11 09:28:04,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:28:04,642 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 400 transitions. [2024-10-11 09:28:04,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 09:28:04,642 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 400 transitions. [2024-10-11 09:28:04,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-11 09:28:04,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:28:04,645 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:28:04,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 09:28:04,645 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:28:04,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:28:04,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1952021532, now seen corresponding path program 1 times [2024-10-11 09:28:04,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:28:04,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196413811] [2024-10-11 09:28:04,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:28:04,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:28:04,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:28:04,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:28:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:28:04,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:28:04,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:28:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 09:28:04,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 09:28:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 09:28:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 09:28:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 09:28:04,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 09:28:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 09:28:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:28:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 09:28:04,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 09:28:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 09:28:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 09:28:04,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 09:28:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 09:28:04,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 09:28:04,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 09:28:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 09:28:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 09:28:04,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:28:04,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 09:28:04,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 09:28:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 09:28:04,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-11 09:28:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-11 09:28:04,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:04,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-11 09:28:05,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:05,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-11 09:28:05,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:05,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 09:28:05,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:05,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 21 proven. 72 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-11 09:28:05,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:28:05,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196413811] [2024-10-11 09:28:05,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196413811] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:28:05,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022389747] [2024-10-11 09:28:05,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:28:05,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:28:05,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:28:05,014 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:28:05,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 09:28:05,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:05,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 09:28:05,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:28:05,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 841 proven. 66 refuted. 0 times theorem prover too weak. 1077 trivial. 0 not checked. [2024-10-11 09:28:05,492 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:28:05,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 27 proven. 66 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-11 09:28:05,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022389747] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:28:05,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 09:28:05,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-11 09:28:05,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569004633] [2024-10-11 09:28:05,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 09:28:05,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 09:28:05,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:28:05,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 09:28:05,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-10-11 09:28:05,802 INFO L87 Difference]: Start difference. First operand 281 states and 400 transitions. Second operand has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 4 states have call successors, (78), 2 states have call predecessors, (78), 4 states have return successors, (80), 4 states have call predecessors, (80), 4 states have call successors, (80) [2024-10-11 09:28:07,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:28:07,265 INFO L93 Difference]: Finished difference Result 760 states and 1055 transitions. [2024-10-11 09:28:07,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-10-11 09:28:07,266 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 4 states have call successors, (78), 2 states have call predecessors, (78), 4 states have return successors, (80), 4 states have call predecessors, (80), 4 states have call successors, (80) Word has length 208 [2024-10-11 09:28:07,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:28:07,271 INFO L225 Difference]: With dead ends: 760 [2024-10-11 09:28:07,271 INFO L226 Difference]: Without dead ends: 470 [2024-10-11 09:28:07,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 477 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=545, Invalid=1711, Unknown=0, NotChecked=0, Total=2256 [2024-10-11 09:28:07,274 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 589 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 09:28:07,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 445 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 09:28:07,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2024-10-11 09:28:07,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 292. [2024-10-11 09:28:07,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 237 states have (on average 1.3924050632911393) internal successors, (330), 238 states have internal predecessors, (330), 43 states have call successors, (43), 11 states have call predecessors, (43), 11 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-11 09:28:07,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 416 transitions. [2024-10-11 09:28:07,314 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 416 transitions. Word has length 208 [2024-10-11 09:28:07,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:28:07,315 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 416 transitions. [2024-10-11 09:28:07,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 4 states have call successors, (78), 2 states have call predecessors, (78), 4 states have return successors, (80), 4 states have call predecessors, (80), 4 states have call successors, (80) [2024-10-11 09:28:07,316 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 416 transitions. [2024-10-11 09:28:07,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-11 09:28:07,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:28:07,318 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:28:07,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 09:28:07,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:28:07,519 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:28:07,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:28:07,520 INFO L85 PathProgramCache]: Analyzing trace with hash -897192971, now seen corresponding path program 1 times [2024-10-11 09:28:07,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:28:07,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091681260] [2024-10-11 09:28:07,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:28:07,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:28:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 09:28:07,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [95585194] [2024-10-11 09:28:07,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:28:07,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:28:07,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:28:07,614 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:28:07,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 09:28:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 09:28:07,813 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 09:28:07,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 09:28:08,038 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 09:28:08,039 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 09:28:08,040 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 09:28:08,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 09:28:08,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 09:28:08,249 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:28:08,401 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 09:28:08,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 09:28:08 BoogieIcfgContainer [2024-10-11 09:28:08,406 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 09:28:08,406 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 09:28:08,406 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 09:28:08,407 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 09:28:08,407 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:27:54" (3/4) ... [2024-10-11 09:28:08,409 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 09:28:08,410 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 09:28:08,411 INFO L158 Benchmark]: Toolchain (without parser) took 15669.39ms. Allocated memory was 148.9MB in the beginning and 377.5MB in the end (delta: 228.6MB). Free memory was 91.9MB in the beginning and 291.2MB in the end (delta: -199.3MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. [2024-10-11 09:28:08,411 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 148.9MB. Free memory is still 109.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 09:28:08,412 INFO L158 Benchmark]: CACSL2BoogieTranslator took 414.62ms. Allocated memory is still 148.9MB. Free memory was 91.9MB in the beginning and 73.8MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 09:28:08,412 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.92ms. Allocated memory is still 148.9MB. Free memory was 73.8MB in the beginning and 69.2MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 09:28:08,413 INFO L158 Benchmark]: Boogie Preprocessor took 108.59ms. Allocated memory is still 148.9MB. Free memory was 69.2MB in the beginning and 63.3MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 09:28:08,413 INFO L158 Benchmark]: RCFGBuilder took 791.93ms. Allocated memory was 148.9MB in the beginning and 209.7MB in the end (delta: 60.8MB). Free memory was 63.3MB in the beginning and 150.9MB in the end (delta: -87.6MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2024-10-11 09:28:08,413 INFO L158 Benchmark]: TraceAbstraction took 14276.04ms. Allocated memory was 209.7MB in the beginning and 377.5MB in the end (delta: 167.8MB). Free memory was 150.0MB in the beginning and 291.2MB in the end (delta: -141.1MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. [2024-10-11 09:28:08,414 INFO L158 Benchmark]: Witness Printer took 4.16ms. Allocated memory is still 377.5MB. Free memory is still 291.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 09:28:08,415 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.12ms. Allocated memory is still 148.9MB. Free memory is still 109.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 414.62ms. Allocated memory is still 148.9MB. Free memory was 91.9MB in the beginning and 73.8MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.92ms. Allocated memory is still 148.9MB. Free memory was 73.8MB in the beginning and 69.2MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 108.59ms. Allocated memory is still 148.9MB. Free memory was 69.2MB in the beginning and 63.3MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 791.93ms. Allocated memory was 148.9MB in the beginning and 209.7MB in the end (delta: 60.8MB). Free memory was 63.3MB in the beginning and 150.9MB in the end (delta: -87.6MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. * TraceAbstraction took 14276.04ms. Allocated memory was 209.7MB in the beginning and 377.5MB in the end (delta: 167.8MB). Free memory was 150.0MB in the beginning and 291.2MB in the end (delta: -141.1MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. * Witness Printer took 4.16ms. Allocated memory is still 377.5MB. Free memory is still 291.2MB. 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 someBinaryFLOATComparisonOperation at line 190, overapproximation of shiftRight at line 115, overapproximation of someBinaryArithmeticDOUBLEoperation at line 68, overapproximation of someUnaryDOUBLEoperation at line 87, overapproximation of someBinaryDOUBLEComparisonOperation at line 190. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 8.75; [L23] unsigned char var_1_2 = 1; [L24] double var_1_3 = 9.6; [L25] double var_1_4 = 7.625; [L26] double var_1_5 = 1.5; [L27] double var_1_6 = 63.17; [L28] double var_1_7 = 15.5; [L29] unsigned short int var_1_8 = 4; [L30] unsigned short int var_1_9 = 45624; [L31] unsigned short int var_1_10 = 39447; [L32] unsigned short int var_1_11 = 10; [L33] double var_1_12 = 255.5; [L34] double var_1_13 = 0.0; [L35] double var_1_14 = 127.5; [L36] float var_1_15 = 8.2; [L37] float var_1_16 = 2.8; [L38] signed short int var_1_17 = 8; [L39] double var_1_18 = 24.8; [L40] signed short int var_1_19 = -256; [L41] signed short int var_1_20 = 8; [L42] signed short int var_1_21 = 16; [L43] unsigned short int var_1_22 = 2; [L44] unsigned short int var_1_24 = 16; [L45] unsigned char var_1_25 = 0; [L46] unsigned short int var_1_26 = 1; [L47] double var_1_28 = 199.6; [L48] signed char var_1_33 = 5; [L49] signed char var_1_35 = -1; [L50] double var_1_36 = 0.6; [L51] double var_1_39 = 16.5; [L52] double var_1_40 = 0.2; [L53] float var_1_41 = 31.45; [L54] signed short int var_1_43 = -10; [L55] unsigned long int var_1_44 = 25; [L56] signed short int var_1_45 = 24450; [L57] unsigned long int var_1_46 = 8; [L58] signed short int var_1_47 = -4; [L59] unsigned short int last_1_var_1_22 = 2; [L194] isInitial = 1 [L195] FCALL initially() [L196] COND TRUE 1 [L197] CALL updateLastVariables() [L187] last_1_var_1_22 = var_1_22 [L197] RET updateLastVariables() [L198] CALL updateVariables() [L133] var_1_2 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_3=48/5, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_3=48/5, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L134] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_3=48/5, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L135] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_3=48/5, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_3=48/5, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L135] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_3=48/5, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L136] var_1_3 = __VERIFIER_nondet_double() [L137] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L137] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L138] var_1_4 = __VERIFIER_nondet_double() [L139] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L139] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L140] var_1_5 = __VERIFIER_nondet_double() [L141] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L141] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L142] var_1_6 = __VERIFIER_nondet_double() [L143] CALL assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L143] RET assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L144] var_1_7 = __VERIFIER_nondet_double() [L145] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=45624] [L145] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=45624] [L146] var_1_9 = __VERIFIER_nondet_ushort() [L147] CALL assume_abort_if_not(var_1_9 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L147] RET assume_abort_if_not(var_1_9 >= 32767) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L148] CALL assume_abort_if_not(var_1_9 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L148] RET assume_abort_if_not(var_1_9 <= 65534) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L149] var_1_10 = __VERIFIER_nondet_ushort() [L150] CALL assume_abort_if_not(var_1_10 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L150] RET assume_abort_if_not(var_1_10 >= 32767) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L151] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L151] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L152] var_1_11 = __VERIFIER_nondet_ushort() [L153] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L153] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L154] CALL assume_abort_if_not(var_1_11 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L154] RET assume_abort_if_not(var_1_11 <= 32767) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L155] var_1_13 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L156] RET assume_abort_if_not((var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L157] var_1_18 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_18 >= -922337.2036854776000e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854776000e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L158] RET assume_abort_if_not((var_1_18 >= -922337.2036854776000e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854776000e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L159] CALL assume_abort_if_not(var_1_18 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L159] RET assume_abort_if_not(var_1_18 != 0.0F) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L160] var_1_19 = __VERIFIER_nondet_short() [L161] CALL assume_abort_if_not(var_1_19 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L161] RET assume_abort_if_not(var_1_19 >= -32767) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L162] CALL assume_abort_if_not(var_1_19 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L162] RET assume_abort_if_not(var_1_19 <= 32766) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L163] var_1_20 = __VERIFIER_nondet_short() [L164] CALL assume_abort_if_not(var_1_20 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L164] RET assume_abort_if_not(var_1_20 >= -1) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L165] CALL assume_abort_if_not(var_1_20 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L165] RET assume_abort_if_not(var_1_20 <= 32766) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L166] var_1_21 = __VERIFIER_nondet_short() [L167] CALL assume_abort_if_not(var_1_21 >= -32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L167] RET assume_abort_if_not(var_1_21 >= -32766) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L168] CALL assume_abort_if_not(var_1_21 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L168] RET assume_abort_if_not(var_1_21 <= 32766) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L169] var_1_25 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L170] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L171] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L171] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L172] var_1_35 = __VERIFIER_nondet_char() [L173] CALL assume_abort_if_not(var_1_35 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L173] RET assume_abort_if_not(var_1_35 >= -127) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L174] CALL assume_abort_if_not(var_1_35 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L174] RET assume_abort_if_not(var_1_35 <= 126) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L175] var_1_39 = __VERIFIER_nondet_double() [L176] CALL assume_abort_if_not((var_1_39 >= -461168.6018427382800e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 4611686.018427382800e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L176] RET assume_abort_if_not((var_1_39 >= -461168.6018427382800e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 4611686.018427382800e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L177] var_1_40 = __VERIFIER_nondet_double() [L178] CALL assume_abort_if_not((var_1_40 >= -461168.6018427382800e+13F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 4611686.018427382800e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L178] RET assume_abort_if_not((var_1_40 >= -461168.6018427382800e+13F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 4611686.018427382800e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L179] var_1_44 = __VERIFIER_nondet_ulong() [L180] CALL assume_abort_if_not(var_1_44 >= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=16, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=16, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L180] RET assume_abort_if_not(var_1_44 >= 16) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=16, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L181] CALL assume_abort_if_not(var_1_44 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=16, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=16, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L181] RET assume_abort_if_not(var_1_44 <= 32) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=16, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L182] var_1_45 = __VERIFIER_nondet_short() [L183] CALL assume_abort_if_not(var_1_45 >= 16382) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=16, var_1_45=16382, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=16, var_1_45=16382, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L183] RET assume_abort_if_not(var_1_45 >= 16382) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=16, var_1_45=16382, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L184] CALL assume_abort_if_not(var_1_45 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=16, var_1_45=16382, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=16, var_1_45=16382, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L184] RET assume_abort_if_not(var_1_45 <= 32766) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=16, var_1_45=16382, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L198] RET updateVariables() [L199] CALL step() [L63] COND TRUE \read(var_1_2) [L64] var_1_1 = (((((((((var_1_3 - var_1_4)) > (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))) ? ((var_1_3 - var_1_4)) : (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))))) < (var_1_7)) ? ((((((var_1_3 - var_1_4)) > (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))) ? ((var_1_3 - var_1_4)) : (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))))) : (var_1_7))) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=16, var_1_45=16382, var_1_46=8, var_1_47=-4, var_1_5=0, var_1_6=6, var_1_7=0, var_1_8=4, var_1_9=32768] [L66] var_1_8 = (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=16, var_1_45=16382, var_1_46=8, var_1_47=-4, var_1_5=0, var_1_6=6, var_1_7=0, var_1_8=32768, var_1_9=32768] [L67] COND TRUE \read(var_1_2) [L68] var_1_12 = (((((var_1_3 - (var_1_13 - 128.68))) < (var_1_7)) ? ((var_1_3 - (var_1_13 - 128.68))) : (var_1_7))) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=3, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=16, var_1_45=16382, var_1_46=8, var_1_47=-4, var_1_5=0, var_1_6=6, var_1_7=0, var_1_8=32768, var_1_9=32768] [L70] COND TRUE \read(var_1_2) [L71] var_1_33 = var_1_35 VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=3, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=16, var_1_45=16382, var_1_46=8, var_1_47=-4, var_1_5=0, var_1_6=6, var_1_7=0, var_1_8=32768, var_1_9=32768] [L73] COND TRUE var_1_3 >= var_1_6 [L74] var_1_46 = ((((var_1_10) > (4u)) ? (var_1_10) : (4u))) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=3, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=16, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_5=0, var_1_6=6, var_1_7=0, var_1_8=32768, var_1_9=32768] [L76] var_1_14 = var_1_6 VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=3, var_1_14=6, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=16, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_5=0, var_1_6=6, var_1_7=0, var_1_8=32768, var_1_9=32768] [L77] COND FALSE !(var_1_11 > var_1_10) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=3, var_1_14=6, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=16, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_5=0, var_1_6=6, var_1_7=0, var_1_8=32768, var_1_9=32768] [L80] COND TRUE var_1_11 != var_1_9 [L81] var_1_36 = ((((99999.5) < 0 ) ? -(99999.5) : (99999.5))) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=3, var_1_14=6, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=4, var_1_41=629/20, var_1_43=-10, var_1_44=16, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_5=0, var_1_6=6, var_1_7=0, var_1_8=32768, var_1_9=32768] [L84] COND FALSE !(var_1_11 < (((((var_1_11) < (var_1_20)) ? (var_1_11) : (var_1_20))) / var_1_9)) [L87] var_1_41 = ((((var_1_40) < 0 ) ? -(var_1_40) : (var_1_40))) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=3, var_1_14=6, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=4, var_1_40=0, var_1_41=5, var_1_43=-10, var_1_44=16, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_5=0, var_1_6=6, var_1_7=0, var_1_8=32768, var_1_9=32768] [L89] COND FALSE !(var_1_13 >= var_1_14) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=3, var_1_14=6, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=4, var_1_40=0, var_1_41=5, var_1_43=-10, var_1_44=16, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_5=0, var_1_6=6, var_1_7=0, var_1_8=32768, var_1_9=32768] [L96] COND TRUE var_1_3 <= var_1_4 [L97] var_1_16 = ((((var_1_6) < (var_1_4)) ? (var_1_6) : (var_1_4))) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=3, var_1_14=6, var_1_15=41/5, var_1_16=6, var_1_17=8, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=4, var_1_40=0, var_1_41=5, var_1_43=-10, var_1_44=16, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_4=0, var_1_5=0, var_1_6=6, var_1_7=0, var_1_8=32768, var_1_9=32768] [L99] var_1_26 = var_1_9 VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=3, var_1_14=6, var_1_15=41/5, var_1_16=6, var_1_17=8, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=32768, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=4, var_1_40=0, var_1_41=5, var_1_43=-10, var_1_44=16, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_4=0, var_1_5=0, var_1_6=6, var_1_7=0, var_1_8=32768, var_1_9=32768] [L100] EXPR var_1_11 ^ 8 VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=3, var_1_14=6, var_1_15=41/5, var_1_16=6, var_1_17=8, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=32768, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=4, var_1_40=0, var_1_41=5, var_1_43=-10, var_1_44=16, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_4=0, var_1_5=0, var_1_6=6, var_1_7=0, var_1_8=32768, var_1_9=32768] [L100] COND FALSE !(((var_1_11 ^ 8) * var_1_10) <= var_1_21) [L103] unsigned short int stepLocal_0 = var_1_11; VAL [isInitial=1, last_1_var_1_22=2, stepLocal_0=0, var_1_10=32769, var_1_11=0, var_1_12=3, var_1_14=6, var_1_15=41/5, var_1_16=6, var_1_17=8, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=32768, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=4, var_1_40=0, var_1_41=5, var_1_43=-10, var_1_44=16, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_4=0, var_1_5=0, var_1_6=6, var_1_7=0, var_1_8=32768, var_1_9=32768] [L104] COND FALSE !(var_1_7 >= (var_1_5 / ((((var_1_13) < (var_1_18)) ? (var_1_13) : (var_1_18))))) [L113] var_1_17 = var_1_21 VAL [isInitial=1, last_1_var_1_22=2, stepLocal_0=0, var_1_10=32769, var_1_11=0, var_1_12=3, var_1_14=6, var_1_15=41/5, var_1_16=6, var_1_17=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=32768, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=4, var_1_40=0, var_1_41=5, var_1_43=-10, var_1_44=16, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_4=0, var_1_5=0, var_1_6=6, var_1_7=0, var_1_8=32768, var_1_9=32768] [L115] EXPR ((((var_1_10) < (var_1_9)) ? (var_1_10) : (var_1_9))) >> (var_1_44 - 4u) VAL [isInitial=1, last_1_var_1_22=2, stepLocal_0=0, var_1_10=32769, var_1_11=0, var_1_12=3, var_1_14=6, var_1_15=41/5, var_1_16=6, var_1_17=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=32768, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=4, var_1_40=0, var_1_41=5, var_1_43=-10, var_1_44=16, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_4=0, var_1_5=0, var_1_6=6, var_1_7=0, var_1_8=32768, var_1_9=32768] [L115] COND FALSE !((((((var_1_10) < (var_1_9)) ? (var_1_10) : (var_1_9))) >> (var_1_44 - 4u)) >= var_1_9) [L118] COND TRUE ((((((((var_1_35) < 0 ) ? -(var_1_35) : (var_1_35)))) > (var_1_10)) ? (((((var_1_35) < 0 ) ? -(var_1_35) : (var_1_35)))) : (var_1_10))) > var_1_9 [L119] var_1_43 = 5 VAL [isInitial=1, last_1_var_1_22=2, stepLocal_0=0, var_1_10=32769, var_1_11=0, var_1_12=3, var_1_14=6, var_1_15=41/5, var_1_16=6, var_1_17=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=32768, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=4, var_1_40=0, var_1_41=5, var_1_43=5, var_1_44=16, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_4=0, var_1_5=0, var_1_6=6, var_1_7=0, var_1_8=32768, var_1_9=32768] [L122] COND TRUE (var_1_11 + var_1_20) <= ((var_1_21 * last_1_var_1_22) * var_1_19) [L123] var_1_22 = (((((var_1_9 - var_1_11)) > (var_1_10)) ? ((var_1_9 - var_1_11)) : (var_1_10))) VAL [isInitial=1, last_1_var_1_22=2, stepLocal_0=0, var_1_10=32769, var_1_11=0, var_1_12=3, var_1_14=6, var_1_15=41/5, var_1_16=6, var_1_17=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=32769, var_1_24=16, var_1_25=1, var_1_26=32768, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=4, var_1_40=0, var_1_41=5, var_1_43=5, var_1_44=16, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_4=0, var_1_5=0, var_1_6=6, var_1_7=0, var_1_8=32768, var_1_9=32768] [L125] var_1_47 = var_1_45 VAL [isInitial=1, last_1_var_1_22=2, stepLocal_0=0, var_1_10=32769, var_1_11=0, var_1_12=3, var_1_14=6, var_1_15=41/5, var_1_16=6, var_1_17=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=32769, var_1_24=16, var_1_25=1, var_1_26=32768, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=4, var_1_40=0, var_1_41=5, var_1_43=5, var_1_44=16, var_1_45=16382, var_1_46=32769, var_1_47=16382, var_1_4=0, var_1_5=0, var_1_6=6, var_1_7=0, var_1_8=32768, var_1_9=32768] [L126] COND FALSE !(var_1_9 < var_1_11) VAL [isInitial=1, last_1_var_1_22=2, stepLocal_0=0, var_1_10=32769, var_1_11=0, var_1_12=3, var_1_14=6, var_1_15=41/5, var_1_16=6, var_1_17=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=32769, var_1_24=16, var_1_25=1, var_1_26=32768, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=4, var_1_40=0, var_1_41=5, var_1_43=5, var_1_44=16, var_1_45=16382, var_1_46=32769, var_1_47=16382, var_1_4=0, var_1_5=0, var_1_6=6, var_1_7=0, var_1_8=32768, var_1_9=32768] [L199] RET step() [L200] CALL, EXPR property() [L190-L191] return ((((((((var_1_2 ? (var_1_1 == ((double) (((((((((var_1_3 - var_1_4)) > (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))) ? ((var_1_3 - var_1_4)) : (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))))) < (var_1_7)) ? ((((((var_1_3 - var_1_4)) > (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))) ? ((var_1_3 - var_1_4)) : (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))))) : (var_1_7))))) : 1) && (var_1_8 == ((unsigned short int) (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11)))) && (var_1_2 ? (var_1_12 == ((double) (((((var_1_3 - (var_1_13 - 128.68))) < (var_1_7)) ? ((var_1_3 - (var_1_13 - 128.68))) : (var_1_7))))) : 1)) && (var_1_14 == ((double) var_1_6))) && ((var_1_13 >= var_1_14) ? (var_1_2 ? ((var_1_8 == var_1_11) ? (var_1_15 == ((float) 10.975f)) : 1) : 1) : 1)) && ((var_1_3 <= var_1_4) ? (var_1_16 == ((float) ((((var_1_6) < (var_1_4)) ? (var_1_6) : (var_1_4))))) : 1)) && ((var_1_7 >= (var_1_5 / ((((var_1_13) < (var_1_18)) ? (var_1_13) : (var_1_18))))) ? (((var_1_10 + var_1_9) <= var_1_11) ? (var_1_2 ? (var_1_17 == ((signed short int) var_1_19)) : 1) : (var_1_17 == ((signed short int) (var_1_20 - ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))))))) : (var_1_17 == ((signed short int) var_1_21)))) && (((var_1_11 + var_1_20) <= ((var_1_21 * last_1_var_1_22) * var_1_19)) ? (var_1_22 == ((unsigned short int) (((((var_1_9 - var_1_11)) > (var_1_10)) ? ((var_1_9 - var_1_11)) : (var_1_10))))) : 1)) && ((var_1_9 < var_1_11) ? ((var_1_2 || var_1_25) ? (var_1_24 == ((unsigned short int) 128)) : 1) : 1) ; [L200] RET, EXPR property() [L200] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=3, var_1_14=6, var_1_15=41/5, var_1_16=6, var_1_17=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=32769, var_1_24=16, var_1_25=1, var_1_26=32768, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=4, var_1_40=0, var_1_41=5, var_1_43=5, var_1_44=16, var_1_45=16382, var_1_46=32769, var_1_47=16382, var_1_4=0, var_1_5=0, var_1_6=6, var_1_7=0, var_1_8=32768, var_1_9=32768] [L19] reach_error() VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=3, var_1_14=6, var_1_15=41/5, var_1_16=6, var_1_17=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=32769, var_1_24=16, var_1_25=1, var_1_26=32768, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=4, var_1_40=0, var_1_41=5, var_1_43=5, var_1_44=16, var_1_45=16382, var_1_46=32769, var_1_47=16382, var_1_4=0, var_1_5=0, var_1_6=6, var_1_7=0, var_1_8=32768, var_1_9=32768] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.0s, OverallIterations: 10, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1552 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1534 mSDsluCounter, 3227 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1946 mSDsCounter, 598 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2545 IncrementalHoareTripleChecker+Invalid, 3143 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 598 mSolverCounterUnsat, 1281 mSDtfsCounter, 2545 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1975 GetRequests, 1855 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1044 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=354occurred in iteration=4, InterpolantAutomatonStates: 113, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 509 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 2892 NumberOfCodeBlocks, 2892 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 3081 ConstructedInterpolants, 0 QuantifiedInterpolants, 8750 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1419 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 15 InterpolantComputations, 6 PerfectInterpolantSequences, 29199/29760 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-11 09:28:08,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-36.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 1826fac0aaf6beb599525d92da03802aca3a315a8be49017dad700e98d033a28 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:28:10,791 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:28:10,878 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 09:28:10,883 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:28:10,884 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:28:10,918 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:28:10,920 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:28:10,920 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:28:10,921 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:28:10,922 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:28:10,923 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:28:10,923 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:28:10,924 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:28:10,924 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:28:10,925 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:28:10,928 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:28:10,929 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:28:10,929 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:28:10,929 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:28:10,929 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:28:10,930 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:28:10,930 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:28:10,931 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:28:10,931 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 09:28:10,931 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 09:28:10,931 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:28:10,931 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 09:28:10,932 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:28:10,932 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:28:10,932 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:28:10,932 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:28:10,933 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:28:10,933 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:28:10,933 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:28:10,933 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:28:10,934 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:28:10,943 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:28:10,944 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:28:10,944 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 09:28:10,944 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 09:28:10,945 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:28:10,945 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:28:10,945 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:28:10,945 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:28:10,946 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 09:28:10,946 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-clean/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-clean/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 -> 1826fac0aaf6beb599525d92da03802aca3a315a8be49017dad700e98d033a28 [2024-10-11 09:28:11,304 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:28:11,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:28:11,331 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:28:11,332 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:28:11,333 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:28:11,335 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-36.i [2024-10-11 09:28:12,992 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:28:13,238 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:28:13,238 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-36.i [2024-10-11 09:28:13,253 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2eb4c8ffd/71a7365740524dc1a6f710a09541e250/FLAGdad135900 [2024-10-11 09:28:13,272 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2eb4c8ffd/71a7365740524dc1a6f710a09541e250 [2024-10-11 09:28:13,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:28:13,276 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:28:13,279 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:28:13,280 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:28:13,286 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:28:13,287 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:28:13" (1/1) ... [2024-10-11 09:28:13,288 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@707d49bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:28:13, skipping insertion in model container [2024-10-11 09:28:13,288 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:28:13" (1/1) ... [2024-10-11 09:28:13,327 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:28:13,515 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_fillercode_fillercodestructure_filler-pr-ci_file-36.i[919,932] [2024-10-11 09:28:13,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:28:13,639 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:28:13,654 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_fillercode_fillercodestructure_filler-pr-ci_file-36.i[919,932] [2024-10-11 09:28:13,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:28:13,738 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:28:13,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:28:13 WrapperNode [2024-10-11 09:28:13,739 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:28:13,740 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:28:13,740 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:28:13,741 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:28:13,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:28:13" (1/1) ... [2024-10-11 09:28:13,773 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:28:13" (1/1) ... [2024-10-11 09:28:13,816 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 208 [2024-10-11 09:28:13,821 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:28:13,822 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:28:13,822 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:28:13,822 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:28:13,836 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:28:13" (1/1) ... [2024-10-11 09:28:13,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:28:13" (1/1) ... [2024-10-11 09:28:13,845 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:28:13" (1/1) ... [2024-10-11 09:28:13,874 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 09:28:13,875 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:28:13" (1/1) ... [2024-10-11 09:28:13,875 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:28:13" (1/1) ... [2024-10-11 09:28:13,903 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:28:13" (1/1) ... [2024-10-11 09:28:13,911 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:28:13" (1/1) ... [2024-10-11 09:28:13,914 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:28:13" (1/1) ... [2024-10-11 09:28:13,918 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:28:13" (1/1) ... [2024-10-11 09:28:13,922 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:28:13,927 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:28:13,927 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:28:13,927 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:28:13,928 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:28:13" (1/1) ... [2024-10-11 09:28:13,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:28:13,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:28:13,964 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 09:28:13,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 09:28:14,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:28:14,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 09:28:14,015 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:28:14,015 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:28:14,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:28:14,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:28:14,126 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:28:14,128 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:28:30,898 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 09:28:30,898 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:28:30,962 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:28:30,964 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:28:30,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:28:30 BoogieIcfgContainer [2024-10-11 09:28:30,965 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:28:30,966 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:28:30,967 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:28:30,971 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:28:30,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:28:13" (1/3) ... [2024-10-11 09:28:30,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@549a3eb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:28:30, skipping insertion in model container [2024-10-11 09:28:30,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:28:13" (2/3) ... [2024-10-11 09:28:30,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@549a3eb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:28:30, skipping insertion in model container [2024-10-11 09:28:30,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:28:30" (3/3) ... [2024-10-11 09:28:30,976 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-36.i [2024-10-11 09:28:30,993 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:28:30,993 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:28:31,086 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:28:31,095 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;@4aaa821, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:28:31,096 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:28:31,100 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 56 states have internal predecessors, (80), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 09:28:31,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-11 09:28:31,121 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:28:31,123 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:28:31,123 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:28:31,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:28:31,131 INFO L85 PathProgramCache]: Analyzing trace with hash 29493037, now seen corresponding path program 1 times [2024-10-11 09:28:31,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:28:31,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [907612628] [2024-10-11 09:28:31,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:28:31,145 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-11 09:28:31,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:28:31,149 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 09:28:31,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 09:28:32,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:32,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 09:28:32,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:28:32,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 734 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2024-10-11 09:28:32,576 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:28:32,577 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:28:32,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [907612628] [2024-10-11 09:28:32,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [907612628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:28:32,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:28:32,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:28:32,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307419464] [2024-10-11 09:28:32,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:28:32,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:28:32,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:28:32,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:28:32,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:28:32,633 INFO L87 Difference]: Start difference. First operand has 90 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 56 states have internal predecessors, (80), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-11 09:28:37,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.40s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:28:37,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:28:37,115 INFO L93 Difference]: Finished difference Result 177 states and 318 transitions. [2024-10-11 09:28:37,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:28:37,221 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 203 [2024-10-11 09:28:37,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:28:37,228 INFO L225 Difference]: With dead ends: 177 [2024-10-11 09:28:37,228 INFO L226 Difference]: Without dead ends: 88 [2024-10-11 09:28:37,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 202 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-11 09:28:37,234 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-11 09:28:37,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2024-10-11 09:28:37,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-11 09:28:37,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-11 09:28:37,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 54 states have internal predecessors, (75), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 09:28:37,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 139 transitions. [2024-10-11 09:28:37,283 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 139 transitions. Word has length 203 [2024-10-11 09:28:37,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:28:37,284 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 139 transitions. [2024-10-11 09:28:37,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-11 09:28:37,284 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 139 transitions. [2024-10-11 09:28:37,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-11 09:28:37,288 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:28:37,288 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:28:37,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 09:28:37,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 09:28:37,489 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:28:37,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:28:37,490 INFO L85 PathProgramCache]: Analyzing trace with hash -556320151, now seen corresponding path program 1 times [2024-10-11 09:28:37,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:28:37,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406143983] [2024-10-11 09:28:37,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:28:37,492 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-11 09:28:37,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:28:37,493 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 09:28:37,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 09:28:38,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:38,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 09:28:38,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:28:38,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-11 09:28:38,955 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:28:38,955 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:28:38,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406143983] [2024-10-11 09:28:38,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1406143983] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:28:38,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:28:38,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:28:38,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33202134] [2024-10-11 09:28:38,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:28:38,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:28:38,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:28:38,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:28:38,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:28:38,962 INFO L87 Difference]: Start difference. First operand 88 states and 139 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 09:28:40,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:28:45,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:28:49,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:28:53,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:28:53,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:28:53,789 INFO L93 Difference]: Finished difference Result 204 states and 324 transitions. [2024-10-11 09:28:53,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:28:53,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2024-10-11 09:28:53,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:28:53,793 INFO L225 Difference]: With dead ends: 204 [2024-10-11 09:28:53,793 INFO L226 Difference]: Without dead ends: 117 [2024-10-11 09:28:53,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:28:53,795 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 41 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 8 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.8s IncrementalHoareTripleChecker+Time [2024-10-11 09:28:53,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 254 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 20 Invalid, 3 Unknown, 0 Unchecked, 14.8s Time] [2024-10-11 09:28:53,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-11 09:28:53,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 105. [2024-10-11 09:28:53,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 71 states have (on average 1.4225352112676057) internal successors, (101), 71 states have internal predecessors, (101), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 09:28:53,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 165 transitions. [2024-10-11 09:28:53,810 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 165 transitions. Word has length 203 [2024-10-11 09:28:53,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:28:53,812 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 165 transitions. [2024-10-11 09:28:53,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 09:28:53,813 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 165 transitions. [2024-10-11 09:28:53,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-11 09:28:53,816 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:28:53,816 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:28:53,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 09:28:54,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-11 09:28:54,017 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:28:54,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:28:54,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1744502439, now seen corresponding path program 1 times [2024-10-11 09:28:54,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:28:54,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [480109954] [2024-10-11 09:28:54,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:28:54,020 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-11 09:28:54,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:28:54,021 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-11 09:28:54,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 09:28:55,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:55,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 09:28:55,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:28:55,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-11 09:28:55,530 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:28:55,530 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:28:55,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [480109954] [2024-10-11 09:28:55,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [480109954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:28:55,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:28:55,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:28:55,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607993783] [2024-10-11 09:28:55,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:28:55,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:28:55,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:28:55,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:28:55,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:28:55,537 INFO L87 Difference]: Start difference. First operand 105 states and 165 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 09:29:00,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:29:05,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:29:09,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:29:09,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:29:09,155 INFO L93 Difference]: Finished difference Result 221 states and 346 transitions. [2024-10-11 09:29:09,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:29:09,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2024-10-11 09:29:09,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:29:09,269 INFO L225 Difference]: With dead ends: 221 [2024-10-11 09:29:09,270 INFO L226 Difference]: Without dead ends: 117 [2024-10-11 09:29:09,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:29:09,272 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 42 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2024-10-11 09:29:09,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 251 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 3 Unknown, 0 Unchecked, 13.6s Time] [2024-10-11 09:29:09,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-11 09:29:09,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 111. [2024-10-11 09:29:09,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 77 states have internal predecessors, (107), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 09:29:09,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 171 transitions. [2024-10-11 09:29:09,288 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 171 transitions. Word has length 203 [2024-10-11 09:29:09,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:29:09,293 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 171 transitions. [2024-10-11 09:29:09,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 09:29:09,293 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 171 transitions. [2024-10-11 09:29:09,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-11 09:29:09,298 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:29:09,298 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:29:09,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 09:29:09,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-11 09:29:09,499 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:29:09,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:29:09,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1132623591, now seen corresponding path program 1 times [2024-10-11 09:29:09,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:29:09,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2035841767] [2024-10-11 09:29:09,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:29:09,501 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-11 09:29:09,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:29:09,505 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-11 09:29:09,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 09:29:10,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:29:10,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 09:29:10,895 INFO L278 TraceCheckSpWp]: Computing forward predicates...