./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-co_file-47.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-co_file-47.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 905d3c2d64fb03f53248320b27cdc3e4c5f3c81c244c4c483adcf3446c7ed609 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:51:09,886 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:51:09,956 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:51:09,962 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:51:09,963 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:51:10,002 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:51:10,004 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:51:10,005 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:51:10,005 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:51:10,006 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:51:10,008 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:51:10,008 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:51:10,009 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:51:10,009 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:51:10,009 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:51:10,009 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:51:10,010 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:51:10,020 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:51:10,021 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 09:51:10,021 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:51:10,021 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:51:10,022 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:51:10,022 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:51:10,022 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:51:10,023 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:51:10,023 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:51:10,023 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:51:10,023 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:51:10,024 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:51:10,024 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:51:10,024 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:51:10,024 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:51:10,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:51:10,025 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:51:10,026 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:51:10,027 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:51:10,027 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 09:51:10,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 09:51:10,027 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:51:10,027 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:51:10,028 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:51:10,028 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:51:10,028 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 -> 905d3c2d64fb03f53248320b27cdc3e4c5f3c81c244c4c483adcf3446c7ed609 [2024-10-11 09:51:10,292 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:51:10,313 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:51:10,317 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:51:10,319 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:51:10,319 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:51:10,321 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-47.i [2024-10-11 09:51:11,780 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:51:12,007 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:51:12,008 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-47.i [2024-10-11 09:51:12,020 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b13b2943a/e6cc881a046c4cd7beb4dbf457ddd646/FLAGf558d044f [2024-10-11 09:51:12,037 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b13b2943a/e6cc881a046c4cd7beb4dbf457ddd646 [2024-10-11 09:51:12,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:51:12,043 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:51:12,045 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:51:12,047 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:51:12,053 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:51:12,054 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:51:12" (1/1) ... [2024-10-11 09:51:12,056 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@441f9a76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:51:12, skipping insertion in model container [2024-10-11 09:51:12,056 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:51:12" (1/1) ... [2024-10-11 09:51:12,094 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:51:12,274 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-co_file-47.i[919,932] [2024-10-11 09:51:12,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:51:12,369 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:51:12,383 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-co_file-47.i[919,932] [2024-10-11 09:51:12,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:51:12,453 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:51:12,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:51:12 WrapperNode [2024-10-11 09:51:12,454 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:51:12,456 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:51:12,456 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:51:12,456 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:51:12,466 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:51:12" (1/1) ... [2024-10-11 09:51:12,480 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:51:12" (1/1) ... [2024-10-11 09:51:12,528 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 307 [2024-10-11 09:51:12,529 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:51:12,529 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:51:12,530 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:51:12,530 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:51:12,541 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:51:12" (1/1) ... [2024-10-11 09:51:12,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:51:12" (1/1) ... [2024-10-11 09:51:12,551 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:51:12" (1/1) ... [2024-10-11 09:51:12,584 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:51:12,585 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:51:12" (1/1) ... [2024-10-11 09:51:12,585 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:51:12" (1/1) ... [2024-10-11 09:51:12,605 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:51:12" (1/1) ... [2024-10-11 09:51:12,612 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:51:12" (1/1) ... [2024-10-11 09:51:12,617 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:51:12" (1/1) ... [2024-10-11 09:51:12,621 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:51:12" (1/1) ... [2024-10-11 09:51:12,634 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:51:12,636 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:51:12,636 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:51:12,637 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:51:12,638 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:51:12" (1/1) ... [2024-10-11 09:51:12,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:51:12,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:51:12,673 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:51:12,678 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:51:12,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:51:12,731 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:51:12,733 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:51:12,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 09:51:12,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:51:12,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:51:12,848 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:51:12,850 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:51:13,468 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-11 09:51:13,468 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:51:13,499 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:51:13,499 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:51:13,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:51:13 BoogieIcfgContainer [2024-10-11 09:51:13,499 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:51:13,502 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:51:13,502 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:51:13,507 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:51:13,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:51:12" (1/3) ... [2024-10-11 09:51:13,508 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263af2ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:51:13, skipping insertion in model container [2024-10-11 09:51:13,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:51:12" (2/3) ... [2024-10-11 09:51:13,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263af2ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:51:13, skipping insertion in model container [2024-10-11 09:51:13,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:51:13" (3/3) ... [2024-10-11 09:51:13,511 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-47.i [2024-10-11 09:51:13,530 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:51:13,530 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:51:13,608 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:51:13,615 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;@59670987, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:51:13,615 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:51:13,621 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 87 states have (on average 1.5517241379310345) internal successors, (135), 88 states have internal predecessors, (135), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 09:51:13,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-11 09:51:13,665 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:51:13,669 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:13,669 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:51:13,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:51:13,677 INFO L85 PathProgramCache]: Analyzing trace with hash 65085184, now seen corresponding path program 1 times [2024-10-11 09:51:13,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:51:13,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339452391] [2024-10-11 09:51:13,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:51:13,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:51:13,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:14,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:51:14,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:14,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:51:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:14,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:51:14,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:14,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:51:14,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:14,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:51:14,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:14,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:51:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:14,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:51:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:14,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:51:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:14,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:51:14,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:14,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:51:14,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:14,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:51:14,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:14,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:51:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:14,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:51:14,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:14,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:51:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:14,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:51:14,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:14,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:51:14,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:14,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:51:14,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:14,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:51:14,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:14,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:51:14,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:14,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:51:14,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:14,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:51:14,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:14,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:51:14,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:14,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:51:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:14,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:51:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:14,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:51:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:14,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:51:14,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:14,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:51:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:14,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:51:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:14,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:51:14,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:14,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:51:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:14,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:51:14,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:14,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 09:51:14,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:14,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 09:51:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:14,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 09:51:14,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:14,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 09:51:14,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:51:14,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339452391] [2024-10-11 09:51:14,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339452391] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:51:14,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:51:14,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:51:14,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940038354] [2024-10-11 09:51:14,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:51:14,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:51:14,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:51:14,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:51:14,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:51:14,341 INFO L87 Difference]: Start difference. First operand has 124 states, 87 states have (on average 1.5517241379310345) internal successors, (135), 88 states have internal predecessors, (135), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) 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, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 09:51:14,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:51:14,401 INFO L93 Difference]: Finished difference Result 245 states and 438 transitions. [2024-10-11 09:51:14,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:51:14,404 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, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 217 [2024-10-11 09:51:14,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:51:14,419 INFO L225 Difference]: With dead ends: 245 [2024-10-11 09:51:14,419 INFO L226 Difference]: Without dead ends: 122 [2024-10-11 09:51:14,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 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:51:14,433 INFO L432 NwaCegarLoop]: 191 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, 191 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:51:14,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 191 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:51:14,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-11 09:51:14,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-10-11 09:51:14,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 86 states have (on average 1.4651162790697674) internal successors, (126), 86 states have internal predecessors, (126), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 09:51:14,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 194 transitions. [2024-10-11 09:51:14,493 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 194 transitions. Word has length 217 [2024-10-11 09:51:14,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:51:14,494 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 194 transitions. [2024-10-11 09:51:14,495 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, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 09:51:14,495 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 194 transitions. [2024-10-11 09:51:14,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-10-11 09:51:14,503 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:51:14,503 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:14,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 09:51:14,504 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:51:14,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:51:14,505 INFO L85 PathProgramCache]: Analyzing trace with hash 630668840, now seen corresponding path program 1 times [2024-10-11 09:51:14,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:51:14,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186293208] [2024-10-11 09:51:14,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:51:14,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:51:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:15,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:51:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:15,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:51:15,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:15,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:51:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:15,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:51:15,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:15,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:51:15,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:15,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:51:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:15,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:51:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:15,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:51:15,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:15,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:51:15,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:15,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:51:15,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:15,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:51:15,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:15,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:51:15,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:15,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:51:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:15,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:51:15,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:15,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:51:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:15,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:51:15,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:15,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:51:15,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:15,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:51:15,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:15,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:51:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:15,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:51:15,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:15,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:51:15,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:15,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:51:15,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:15,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:51:15,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:15,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:51:15,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:15,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:51:15,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:15,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:51:15,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:15,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:51:15,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:15,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:51:15,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:15,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:51:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:15,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:51:15,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:15,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:51:15,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:15,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 09:51:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:15,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 09:51:15,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:15,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 09:51:15,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:15,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 09:51:15,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:51:15,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186293208] [2024-10-11 09:51:15,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186293208] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:51:15,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:51:15,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 09:51:15,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645957356] [2024-10-11 09:51:15,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:51:15,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 09:51:15,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:51:15,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 09:51:15,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 09:51:15,694 INFO L87 Difference]: Start difference. First operand 122 states and 194 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 09:51:16,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:51:16,299 INFO L93 Difference]: Finished difference Result 455 states and 722 transitions. [2024-10-11 09:51:16,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:51:16,300 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 218 [2024-10-11 09:51:16,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:51:16,306 INFO L225 Difference]: With dead ends: 455 [2024-10-11 09:51:16,306 INFO L226 Difference]: Without dead ends: 334 [2024-10-11 09:51:16,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-11 09:51:16,308 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 472 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 09:51:16,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 710 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 09:51:16,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-10-11 09:51:16,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 329. [2024-10-11 09:51:16,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 235 states have (on average 1.4553191489361703) internal successors, (342), 236 states have internal predecessors, (342), 90 states have call successors, (90), 3 states have call predecessors, (90), 3 states have return successors, (90), 89 states have call predecessors, (90), 90 states have call successors, (90) [2024-10-11 09:51:16,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 522 transitions. [2024-10-11 09:51:16,385 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 522 transitions. Word has length 218 [2024-10-11 09:51:16,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:51:16,386 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 522 transitions. [2024-10-11 09:51:16,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 09:51:16,387 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 522 transitions. [2024-10-11 09:51:16,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-10-11 09:51:16,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:51:16,393 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:16,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 09:51:16,397 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:51:16,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:51:16,397 INFO L85 PathProgramCache]: Analyzing trace with hash -49389530, now seen corresponding path program 1 times [2024-10-11 09:51:16,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:51:16,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837374176] [2024-10-11 09:51:16,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:51:16,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:51:16,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:16,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:51:16,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:16,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:51:16,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:16,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:51:16,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:16,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:51:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:16,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:51:16,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:16,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:51:16,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:16,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:51:16,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:16,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:51:16,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:16,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:51:16,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:16,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:51:16,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:16,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:51:16,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:16,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:51:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:16,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:51:16,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:16,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:51:16,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:16,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:51:16,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:16,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:51:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:16,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:51:16,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:16,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:51:16,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:16,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:51:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:17,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:51:17,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:17,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:51:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:17,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:51:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:17,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:51:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:17,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:51:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:17,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:51:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:17,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:51:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:17,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:51:17,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:17,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:51:17,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:17,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:51:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:17,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:51:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:17,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:51:17,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:17,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 09:51:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:17,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 09:51:17,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:17,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 09:51:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:17,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 09:51:17,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:51:17,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837374176] [2024-10-11 09:51:17,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837374176] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:51:17,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:51:17,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 09:51:17,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534169171] [2024-10-11 09:51:17,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:51:17,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 09:51:17,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:51:17,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 09:51:17,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:51:17,070 INFO L87 Difference]: Start difference. First operand 329 states and 522 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 09:51:17,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:51:17,548 INFO L93 Difference]: Finished difference Result 1325 states and 2091 transitions. [2024-10-11 09:51:17,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 09:51:17,549 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 218 [2024-10-11 09:51:17,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:51:17,558 INFO L225 Difference]: With dead ends: 1325 [2024-10-11 09:51:17,559 INFO L226 Difference]: Without dead ends: 997 [2024-10-11 09:51:17,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 09:51:17,563 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 467 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 09:51:17,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 773 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 09:51:17,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2024-10-11 09:51:17,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 722. [2024-10-11 09:51:17,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 535 states have (on average 1.4598130841121495) internal successors, (781), 537 states have internal predecessors, (781), 180 states have call successors, (180), 6 states have call predecessors, (180), 6 states have return successors, (180), 178 states have call predecessors, (180), 180 states have call successors, (180) [2024-10-11 09:51:17,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1141 transitions. [2024-10-11 09:51:17,660 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1141 transitions. Word has length 218 [2024-10-11 09:51:17,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:51:17,661 INFO L471 AbstractCegarLoop]: Abstraction has 722 states and 1141 transitions. [2024-10-11 09:51:17,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 09:51:17,662 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1141 transitions. [2024-10-11 09:51:17,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-10-11 09:51:17,665 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:51:17,665 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:17,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 09:51:17,666 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:51:17,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:51:17,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1873838504, now seen corresponding path program 1 times [2024-10-11 09:51:17,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:51:17,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703957336] [2024-10-11 09:51:17,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:51:17,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:51:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:18,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:51:18,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:18,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:51:18,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:18,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:51:18,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:18,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:51:18,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:18,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:51:18,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:18,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:51:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:18,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:51:18,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:18,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:51:18,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:18,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:51:18,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:18,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:51:18,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:18,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:51:18,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:18,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:51:18,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:18,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:51:18,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:18,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:51:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:18,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:51:18,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:18,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:51:18,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:18,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:51:18,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:18,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:51:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:18,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:51:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:18,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:51:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:18,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:51:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:18,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:51:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:18,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:51:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:18,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:51:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:18,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:51:18,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:18,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:51:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:18,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:51:18,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:18,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:51:18,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:18,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:51:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:18,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:51:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:18,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:51:18,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:18,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 09:51:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:18,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 09:51:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:18,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 09:51:18,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:18,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 09:51:18,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:51:18,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703957336] [2024-10-11 09:51:18,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703957336] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:51:18,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:51:18,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 09:51:18,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867785764] [2024-10-11 09:51:18,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:51:18,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 09:51:18,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:51:18,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 09:51:18,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 09:51:18,530 INFO L87 Difference]: Start difference. First operand 722 states and 1141 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 09:51:20,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:51:20,318 INFO L93 Difference]: Finished difference Result 1625 states and 2535 transitions. [2024-10-11 09:51:20,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 09:51:20,319 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 218 [2024-10-11 09:51:20,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:51:20,329 INFO L225 Difference]: With dead ends: 1625 [2024-10-11 09:51:20,329 INFO L226 Difference]: Without dead ends: 1359 [2024-10-11 09:51:20,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-10-11 09:51:20,332 INFO L432 NwaCegarLoop]: 573 mSDtfsCounter, 578 mSDsluCounter, 1368 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 1941 SdHoareTripleChecker+Invalid, 1373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 09:51:20,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 1941 Invalid, 1373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1236 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 09:51:20,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2024-10-11 09:51:20,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 923. [2024-10-11 09:51:20,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 690 states have (on average 1.4666666666666666) internal successors, (1012), 694 states have internal predecessors, (1012), 224 states have call successors, (224), 8 states have call predecessors, (224), 8 states have return successors, (224), 220 states have call predecessors, (224), 224 states have call successors, (224) [2024-10-11 09:51:20,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1460 transitions. [2024-10-11 09:51:20,467 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1460 transitions. Word has length 218 [2024-10-11 09:51:20,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:51:20,467 INFO L471 AbstractCegarLoop]: Abstraction has 923 states and 1460 transitions. [2024-10-11 09:51:20,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 09:51:20,468 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1460 transitions. [2024-10-11 09:51:20,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-11 09:51:20,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:51:20,471 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:20,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 09:51:20,472 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:51:20,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:51:20,472 INFO L85 PathProgramCache]: Analyzing trace with hash 794642309, now seen corresponding path program 1 times [2024-10-11 09:51:20,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:51:20,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116308127] [2024-10-11 09:51:20,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:51:20,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:51:20,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:20,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:51:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:20,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:51:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:20,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:51:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:20,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:51:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:20,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:51:20,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:20,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:51:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:21,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:51:21,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:21,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:51:21,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:21,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:51:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:21,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:51:21,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:21,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:51:21,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:21,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:51:21,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:21,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:51:21,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:21,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:51:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:21,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:51:21,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:21,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:51:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:21,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:51:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:21,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:51:21,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:21,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:51:21,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:21,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:51:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:21,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:51:21,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:21,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:51:21,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:21,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:51:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:21,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:51:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:21,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:51:21,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:21,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:51:21,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:21,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:51:21,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:21,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:51:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:21,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:51:21,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:21,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:51:21,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:21,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:51:21,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:21,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 09:51:21,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:21,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 09:51:21,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:21,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 09:51:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:21,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 09:51:21,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:51:21,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116308127] [2024-10-11 09:51:21,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116308127] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:51:21,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:51:21,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 09:51:21,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719812209] [2024-10-11 09:51:21,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:51:21,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 09:51:21,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:51:21,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 09:51:21,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 09:51:21,152 INFO L87 Difference]: Start difference. First operand 923 states and 1460 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 09:51:22,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:51:22,650 INFO L93 Difference]: Finished difference Result 1751 states and 2729 transitions. [2024-10-11 09:51:22,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 09:51:22,651 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 219 [2024-10-11 09:51:22,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:51:22,661 INFO L225 Difference]: With dead ends: 1751 [2024-10-11 09:51:22,661 INFO L226 Difference]: Without dead ends: 1373 [2024-10-11 09:51:22,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-10-11 09:51:22,667 INFO L432 NwaCegarLoop]: 525 mSDtfsCounter, 607 mSDsluCounter, 1442 mSDsCounter, 0 mSdLazyCounter, 1073 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 1967 SdHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 1073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:51:22,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 1967 Invalid, 1254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 1073 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 09:51:22,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2024-10-11 09:51:22,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 923. [2024-10-11 09:51:22,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 690 states have (on average 1.4666666666666666) internal successors, (1012), 694 states have internal predecessors, (1012), 224 states have call successors, (224), 8 states have call predecessors, (224), 8 states have return successors, (224), 220 states have call predecessors, (224), 224 states have call successors, (224) [2024-10-11 09:51:22,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1460 transitions. [2024-10-11 09:51:22,796 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1460 transitions. Word has length 219 [2024-10-11 09:51:22,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:51:22,797 INFO L471 AbstractCegarLoop]: Abstraction has 923 states and 1460 transitions. [2024-10-11 09:51:22,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 09:51:22,797 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1460 transitions. [2024-10-11 09:51:22,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-11 09:51:22,800 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:51:22,800 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:22,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 09:51:22,800 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:51:22,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:51:22,801 INFO L85 PathProgramCache]: Analyzing trace with hash 714734999, now seen corresponding path program 1 times [2024-10-11 09:51:22,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:51:22,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85451454] [2024-10-11 09:51:22,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:51:22,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:51:22,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:23,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:51:23,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:23,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:51:23,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:23,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:51:23,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:23,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:51:23,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:23,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:51:23,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:23,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:51:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:23,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:51:23,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:23,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:51:23,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:23,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:51:23,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:23,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:51:23,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:23,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:51:23,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:23,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:51:23,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:23,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:51:23,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:23,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:51:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:23,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:51:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:23,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:51:23,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:23,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:51:23,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:23,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:51:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:23,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:51:23,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:23,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:51:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:23,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:51:23,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:23,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:51:23,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:23,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:51:23,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:23,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:51:23,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:23,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:51:23,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:23,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:51:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:23,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:51:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:23,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:51:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:23,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:51:23,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:23,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:51:23,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:23,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:51:23,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:23,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 09:51:23,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:23,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 09:51:23,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:23,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 09:51:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:23,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 09:51:23,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:51:23,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85451454] [2024-10-11 09:51:23,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85451454] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:51:23,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:51:23,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 09:51:23,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193221208] [2024-10-11 09:51:23,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:51:23,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 09:51:23,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:51:23,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 09:51:23,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:51:23,456 INFO L87 Difference]: Start difference. First operand 923 states and 1460 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 09:51:23,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:51:23,735 INFO L93 Difference]: Finished difference Result 1713 states and 2724 transitions. [2024-10-11 09:51:23,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 09:51:23,736 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 219 [2024-10-11 09:51:23,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:51:23,745 INFO L225 Difference]: With dead ends: 1713 [2024-10-11 09:51:23,746 INFO L226 Difference]: Without dead ends: 1447 [2024-10-11 09:51:23,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:51:23,750 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 163 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:51:23,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 742 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 09:51:23,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2024-10-11 09:51:23,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1002. [2024-10-11 09:51:23,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 733 states have (on average 1.4583901773533425) internal successors, (1069), 738 states have internal predecessors, (1069), 258 states have call successors, (258), 10 states have call predecessors, (258), 10 states have return successors, (258), 253 states have call predecessors, (258), 258 states have call successors, (258) [2024-10-11 09:51:23,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1585 transitions. [2024-10-11 09:51:23,946 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1585 transitions. Word has length 219 [2024-10-11 09:51:23,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:51:23,947 INFO L471 AbstractCegarLoop]: Abstraction has 1002 states and 1585 transitions. [2024-10-11 09:51:23,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 09:51:23,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1585 transitions. [2024-10-11 09:51:23,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-11 09:51:23,952 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:51:23,952 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:23,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 09:51:23,953 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:51:23,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:51:23,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1976505587, now seen corresponding path program 1 times [2024-10-11 09:51:23,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:51:23,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192122943] [2024-10-11 09:51:23,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:51:23,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:51:23,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:24,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:51:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:24,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:51:24,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:24,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:51:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:24,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:51:24,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:24,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:51:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:24,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:51:24,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:24,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:51:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:24,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:51:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:24,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:51:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:24,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:51:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:24,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:51:24,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:24,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:51:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:24,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:51:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:24,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:51:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:24,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:51:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:24,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:51:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:24,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:51:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:24,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:51:24,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:24,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:51:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:24,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:51:24,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:24,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:51:24,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:24,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:51:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:24,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:51:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:24,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:51:24,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:24,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:51:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:24,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:51:24,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:24,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:51:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:24,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:51:24,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:24,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:51:24,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:24,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:51:24,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:24,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:51:24,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:24,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 09:51:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:24,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 09:51:24,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:24,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 09:51:24,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:24,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 09:51:24,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:51:24,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192122943] [2024-10-11 09:51:24,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192122943] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:51:24,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:51:24,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 09:51:24,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868542169] [2024-10-11 09:51:24,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:51:24,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 09:51:24,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:51:24,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 09:51:24,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:51:24,266 INFO L87 Difference]: Start difference. First operand 1002 states and 1585 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 09:51:24,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:51:24,951 INFO L93 Difference]: Finished difference Result 2751 states and 4329 transitions. [2024-10-11 09:51:24,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 09:51:24,952 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 220 [2024-10-11 09:51:24,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:51:24,967 INFO L225 Difference]: With dead ends: 2751 [2024-10-11 09:51:24,967 INFO L226 Difference]: Without dead ends: 1811 [2024-10-11 09:51:24,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 09:51:24,977 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 248 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 09:51:24,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 853 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 09:51:24,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2024-10-11 09:51:25,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1227. [2024-10-11 09:51:25,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1227 states, 958 states have (on average 1.501043841336117) internal successors, (1438), 963 states have internal predecessors, (1438), 258 states have call successors, (258), 10 states have call predecessors, (258), 10 states have return successors, (258), 253 states have call predecessors, (258), 258 states have call successors, (258) [2024-10-11 09:51:25,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 1954 transitions. [2024-10-11 09:51:25,153 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 1954 transitions. Word has length 220 [2024-10-11 09:51:25,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:51:25,154 INFO L471 AbstractCegarLoop]: Abstraction has 1227 states and 1954 transitions. [2024-10-11 09:51:25,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 09:51:25,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 1954 transitions. [2024-10-11 09:51:25,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-11 09:51:25,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:51:25,158 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:25,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 09:51:25,159 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:51:25,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:51:25,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1919247285, now seen corresponding path program 1 times [2024-10-11 09:51:25,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:51:25,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329484402] [2024-10-11 09:51:25,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:51:25,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:51:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:25,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:51:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:25,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:51:25,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:25,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:51:25,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:25,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:51:25,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:25,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:51:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:25,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:51:25,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:25,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:51:25,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:25,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:51:25,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:25,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:51:25,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:25,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:51:25,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:25,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:51:25,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:25,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:51:25,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:25,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:51:25,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:25,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:51:25,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:25,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:51:25,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:25,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:51:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:25,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:51:25,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:25,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:51:25,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:25,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:51:25,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:25,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:51:25,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:25,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:51:25,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:25,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:51:25,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:25,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:51:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:25,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:51:25,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:25,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:51:25,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:25,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:51:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:25,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:51:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:25,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:51:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:25,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:51:25,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:25,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:51:25,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:25,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:51:25,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:25,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 09:51:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:25,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 09:51:25,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:25,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 09:51:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:25,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 09:51:25,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:51:25,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329484402] [2024-10-11 09:51:25,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329484402] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:51:25,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:51:25,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:51:25,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630524959] [2024-10-11 09:51:25,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:51:25,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:51:25,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:51:25,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:51:25,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:51:25,939 INFO L87 Difference]: Start difference. First operand 1227 states and 1954 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 09:51:26,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:51:26,375 INFO L93 Difference]: Finished difference Result 1989 states and 3155 transitions. [2024-10-11 09:51:26,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:51:26,376 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 220 [2024-10-11 09:51:26,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:51:26,382 INFO L225 Difference]: With dead ends: 1989 [2024-10-11 09:51:26,382 INFO L226 Difference]: Without dead ends: 824 [2024-10-11 09:51:26,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:51:26,388 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 130 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 09:51:26,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 518 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 09:51:26,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2024-10-11 09:51:26,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 655. [2024-10-11 09:51:26,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 502 states have (on average 1.49601593625498) internal successors, (751), 504 states have internal predecessors, (751), 146 states have call successors, (146), 6 states have call predecessors, (146), 6 states have return successors, (146), 144 states have call predecessors, (146), 146 states have call successors, (146) [2024-10-11 09:51:26,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1043 transitions. [2024-10-11 09:51:26,484 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1043 transitions. Word has length 220 [2024-10-11 09:51:26,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:51:26,484 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 1043 transitions. [2024-10-11 09:51:26,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 09:51:26,485 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1043 transitions. [2024-10-11 09:51:26,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-10-11 09:51:26,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:51:26,488 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:26,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 09:51:26,488 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:51:26,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:51:26,489 INFO L85 PathProgramCache]: Analyzing trace with hash -927000848, now seen corresponding path program 1 times [2024-10-11 09:51:26,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:51:26,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937937578] [2024-10-11 09:51:26,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:51:26,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:51:26,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:26,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:51:26,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:26,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:51:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:26,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:51:26,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:26,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:51:26,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:26,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:51:26,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:26,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:51:26,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:26,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:51:26,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:26,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:51:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:26,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:51:26,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:26,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:51:26,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:26,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:51:26,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:26,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:51:26,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:26,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:51:26,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:26,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:51:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:26,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:51:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:26,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:51:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:26,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:51:26,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:26,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:51:26,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:26,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:51:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:26,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:51:26,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:26,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:51:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:26,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:51:26,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:26,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:51:26,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:26,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:51:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:26,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:51:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:26,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:51:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:26,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:51:26,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:26,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:51:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:26,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:51:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:26,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:51:26,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:26,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:51:26,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:26,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 09:51:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:26,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 09:51:26,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:26,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 09:51:26,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:26,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 09:51:26,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:51:26,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937937578] [2024-10-11 09:51:26,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937937578] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:51:26,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:51:26,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:51:26,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740529775] [2024-10-11 09:51:26,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:51:26,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:51:26,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:51:26,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:51:26,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:51:26,811 INFO L87 Difference]: Start difference. First operand 655 states and 1043 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 09:51:27,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:51:27,078 INFO L93 Difference]: Finished difference Result 1756 states and 2803 transitions. [2024-10-11 09:51:27,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 09:51:27,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 222 [2024-10-11 09:51:27,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:51:27,086 INFO L225 Difference]: With dead ends: 1756 [2024-10-11 09:51:27,087 INFO L226 Difference]: Without dead ends: 1215 [2024-10-11 09:51:27,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:51:27,091 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 169 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:51:27,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 718 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 09:51:27,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2024-10-11 09:51:27,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 977. [2024-10-11 09:51:27,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 824 states have (on average 1.491504854368932) internal successors, (1229), 826 states have internal predecessors, (1229), 146 states have call successors, (146), 6 states have call predecessors, (146), 6 states have return successors, (146), 144 states have call predecessors, (146), 146 states have call successors, (146) [2024-10-11 09:51:27,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1521 transitions. [2024-10-11 09:51:27,207 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1521 transitions. Word has length 222 [2024-10-11 09:51:27,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:51:27,209 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1521 transitions. [2024-10-11 09:51:27,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 09:51:27,209 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1521 transitions. [2024-10-11 09:51:27,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-10-11 09:51:27,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:51:27,212 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:27,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 09:51:27,213 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:51:27,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:51:27,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1595658288, now seen corresponding path program 1 times [2024-10-11 09:51:27,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:51:27,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015700167] [2024-10-11 09:51:27,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:51:27,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:51:27,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:27,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:51:27,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:27,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:51:27,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:27,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:51:27,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:27,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:51:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:27,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:51:27,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:27,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:51:27,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:27,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:51:27,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:27,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:51:27,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:27,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:51:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:27,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:51:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:27,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:51:27,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:27,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:51:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:27,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:51:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:27,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:51:27,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:27,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:51:27,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:27,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:51:27,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:27,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:51:27,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:27,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:51:27,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:27,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:51:27,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:27,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:51:27,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:27,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:51:27,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:27,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:51:27,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:27,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:51:27,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:27,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:51:27,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:27,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:51:27,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:27,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:51:27,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:27,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:51:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:27,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:51:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:27,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:51:27,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:27,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:51:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:27,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:51:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:27,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 09:51:27,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:27,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 09:51:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:27,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 09:51:27,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:27,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 09:51:27,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:51:27,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015700167] [2024-10-11 09:51:27,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015700167] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:51:27,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:51:27,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 09:51:27,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615391945] [2024-10-11 09:51:27,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:51:27,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 09:51:27,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:51:27,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 09:51:27,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 09:51:27,807 INFO L87 Difference]: Start difference. First operand 977 states and 1521 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 09:51:29,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:51:29,281 INFO L93 Difference]: Finished difference Result 1747 states and 2687 transitions. [2024-10-11 09:51:29,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 09:51:29,282 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 222 [2024-10-11 09:51:29,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:51:29,289 INFO L225 Difference]: With dead ends: 1747 [2024-10-11 09:51:29,290 INFO L226 Difference]: Without dead ends: 1385 [2024-10-11 09:51:29,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2024-10-11 09:51:29,292 INFO L432 NwaCegarLoop]: 511 mSDtfsCounter, 657 mSDsluCounter, 1448 mSDsCounter, 0 mSdLazyCounter, 1131 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 1959 SdHoareTripleChecker+Invalid, 1357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 1131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:51:29,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 1959 Invalid, 1357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 1131 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 09:51:29,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2024-10-11 09:51:29,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 983. [2024-10-11 09:51:29,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 830 states have (on average 1.4903614457831325) internal successors, (1237), 832 states have internal predecessors, (1237), 146 states have call successors, (146), 6 states have call predecessors, (146), 6 states have return successors, (146), 144 states have call predecessors, (146), 146 states have call successors, (146) [2024-10-11 09:51:29,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1529 transitions. [2024-10-11 09:51:29,403 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1529 transitions. Word has length 222 [2024-10-11 09:51:29,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:51:29,404 INFO L471 AbstractCegarLoop]: Abstraction has 983 states and 1529 transitions. [2024-10-11 09:51:29,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 09:51:29,405 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1529 transitions. [2024-10-11 09:51:29,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-10-11 09:51:29,407 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:51:29,407 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:29,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 09:51:29,408 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:51:29,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:51:29,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1768476003, now seen corresponding path program 1 times [2024-10-11 09:51:29,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:51:29,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025999605] [2024-10-11 09:51:29,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:51:29,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:51:29,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:29,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:51:29,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:29,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:51:29,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:29,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:51:29,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:29,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:51:29,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:29,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:51:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:29,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:51:29,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:29,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:51:29,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:29,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:51:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:29,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:51:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:29,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:51:29,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:29,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:51:29,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:29,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:51:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:29,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:51:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:29,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:51:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:29,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:51:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:29,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:51:29,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:29,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:51:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:29,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:51:29,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:29,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:51:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:29,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:51:29,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:29,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:51:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:29,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:51:29,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:29,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:51:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:29,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:51:29,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:29,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:51:29,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:29,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:51:29,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:29,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:51:29,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:29,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:51:29,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:29,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:51:29,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:29,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:51:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:29,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:51:29,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:29,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 09:51:29,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:29,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 09:51:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:29,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 09:51:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:29,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 09:51:29,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:51:29,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025999605] [2024-10-11 09:51:29,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025999605] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:51:29,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:51:29,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:51:29,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040011877] [2024-10-11 09:51:29,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:51:29,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:51:29,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:51:29,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:51:29,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:51:29,927 INFO L87 Difference]: Start difference. First operand 983 states and 1529 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 09:51:30,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:51:30,309 INFO L93 Difference]: Finished difference Result 1796 states and 2796 transitions. [2024-10-11 09:51:30,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:51:30,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 223 [2024-10-11 09:51:30,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:51:30,315 INFO L225 Difference]: With dead ends: 1796 [2024-10-11 09:51:30,316 INFO L226 Difference]: Without dead ends: 983 [2024-10-11 09:51:30,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:51:30,319 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 66 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:51:30,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 434 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 09:51:30,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2024-10-11 09:51:30,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 983. [2024-10-11 09:51:30,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 830 states have (on average 1.4879518072289157) internal successors, (1235), 832 states have internal predecessors, (1235), 146 states have call successors, (146), 6 states have call predecessors, (146), 6 states have return successors, (146), 144 states have call predecessors, (146), 146 states have call successors, (146) [2024-10-11 09:51:30,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1527 transitions. [2024-10-11 09:51:30,419 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1527 transitions. Word has length 223 [2024-10-11 09:51:30,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:51:30,419 INFO L471 AbstractCegarLoop]: Abstraction has 983 states and 1527 transitions. [2024-10-11 09:51:30,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 09:51:30,420 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1527 transitions. [2024-10-11 09:51:30,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-10-11 09:51:30,422 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:51:30,423 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:30,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 09:51:30,423 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:51:30,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:51:30,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1597733569, now seen corresponding path program 1 times [2024-10-11 09:51:30,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:51:30,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380691463] [2024-10-11 09:51:30,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:51:30,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:51:30,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:31,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:51:31,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:31,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:51:31,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:31,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:51:31,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:31,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:51:31,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:31,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:51:31,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:31,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:51:31,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:31,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:51:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:31,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:51:31,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:31,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:51:31,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:31,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:51:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:31,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:51:31,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:31,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:51:31,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:31,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:51:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:31,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:51:31,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:31,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:51:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:31,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:51:31,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:31,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:51:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:31,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:51:31,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:31,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:51:31,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:31,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:51:31,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:31,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:51:31,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:31,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:51:31,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:31,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:51:31,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:31,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:51:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:31,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:51:31,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:31,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:51:31,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:31,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:51:31,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:31,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:51:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:31,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:51:31,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:31,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:51:31,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:31,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:51:31,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:31,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 09:51:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:31,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 09:51:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:31,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 09:51:31,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:31,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 114 proven. 165 refuted. 0 times theorem prover too weak. 1965 trivial. 0 not checked. [2024-10-11 09:51:31,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:51:31,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380691463] [2024-10-11 09:51:31,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380691463] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:51:31,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045124667] [2024-10-11 09:51:31,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:51:31,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:51:31,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:51:31,532 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:51:31,533 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:51:31,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:31,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 09:51:31,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:51:34,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1245 proven. 246 refuted. 0 times theorem prover too weak. 753 trivial. 0 not checked. [2024-10-11 09:51:34,022 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:51:40,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 114 proven. 174 refuted. 0 times theorem prover too weak. 1956 trivial. 0 not checked. [2024-10-11 09:51:40,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045124667] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:51:40,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 09:51:40,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 12] total 32 [2024-10-11 09:51:40,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287189693] [2024-10-11 09:51:40,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 09:51:40,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-11 09:51:40,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:51:40,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-11 09:51:40,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=744, Unknown=0, NotChecked=0, Total=992 [2024-10-11 09:51:40,173 INFO L87 Difference]: Start difference. First operand 983 states and 1527 transitions. Second operand has 32 states, 30 states have (on average 5.6) internal successors, (168), 28 states have internal predecessors, (168), 12 states have call successors, (102), 6 states have call predecessors, (102), 12 states have return successors, (102), 12 states have call predecessors, (102), 12 states have call successors, (102) [2024-10-11 09:51:53,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:51:53,207 INFO L93 Difference]: Finished difference Result 5005 states and 7521 transitions. [2024-10-11 09:51:53,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-10-11 09:51:53,208 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 5.6) internal successors, (168), 28 states have internal predecessors, (168), 12 states have call successors, (102), 6 states have call predecessors, (102), 12 states have return successors, (102), 12 states have call predecessors, (102), 12 states have call successors, (102) Word has length 223 [2024-10-11 09:51:53,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:51:53,229 INFO L225 Difference]: With dead ends: 5005 [2024-10-11 09:51:53,230 INFO L226 Difference]: Without dead ends: 4154 [2024-10-11 09:51:53,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 512 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4780 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=3003, Invalid=10803, Unknown=0, NotChecked=0, Total=13806 [2024-10-11 09:51:53,238 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 1814 mSDsluCounter, 2065 mSDsCounter, 0 mSdLazyCounter, 2783 mSolverCounterSat, 926 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1818 SdHoareTripleChecker+Valid, 2364 SdHoareTripleChecker+Invalid, 3709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 926 IncrementalHoareTripleChecker+Valid, 2783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:51:53,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1818 Valid, 2364 Invalid, 3709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [926 Valid, 2783 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-11 09:51:53,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4154 states. [2024-10-11 09:51:53,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4154 to 2976. [2024-10-11 09:51:53,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2976 states, 2539 states have (on average 1.4332414336352894) internal successors, (3639), 2551 states have internal predecessors, (3639), 378 states have call successors, (378), 58 states have call predecessors, (378), 58 states have return successors, (378), 366 states have call predecessors, (378), 378 states have call successors, (378) [2024-10-11 09:51:53,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 4395 transitions. [2024-10-11 09:51:53,643 INFO L78 Accepts]: Start accepts. Automaton has 2976 states and 4395 transitions. Word has length 223 [2024-10-11 09:51:53,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:51:53,644 INFO L471 AbstractCegarLoop]: Abstraction has 2976 states and 4395 transitions. [2024-10-11 09:51:53,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 5.6) internal successors, (168), 28 states have internal predecessors, (168), 12 states have call successors, (102), 6 states have call predecessors, (102), 12 states have return successors, (102), 12 states have call predecessors, (102), 12 states have call successors, (102) [2024-10-11 09:51:53,645 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 4395 transitions. [2024-10-11 09:51:53,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-10-11 09:51:53,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:51:53,648 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:53,669 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:51:53,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 09:51:53,849 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:51:53,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:51:53,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1198491281, now seen corresponding path program 1 times [2024-10-11 09:51:53,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:51:53,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50670565] [2024-10-11 09:51:53,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:51:53,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:51:53,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:54,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:51:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:54,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:51:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:54,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:51:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:54,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:51:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:54,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:51:54,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:54,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:51:54,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:54,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:51:54,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:54,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:51:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:54,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:51:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:54,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:51:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:54,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:51:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:54,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:51:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:54,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:51:54,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:54,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:51:54,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:54,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:51:54,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:54,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:51:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:54,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:51:54,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:54,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:51:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:54,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:51:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:54,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:51:54,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:54,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:51:54,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:54,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:51:54,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:54,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:51:54,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:54,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:51:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:54,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:51:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:54,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:51:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:54,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:51:54,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:54,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:51:54,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:54,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:51:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:54,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:51:54,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:54,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:51:54,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:54,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 09:51:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:54,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 09:51:54,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:54,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 09:51:54,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:54,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 6 proven. 93 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2024-10-11 09:51:54,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:51:54,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50670565] [2024-10-11 09:51:54,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50670565] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:51:54,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463522170] [2024-10-11 09:51:54,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:51:54,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:51:54,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:51:54,523 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:51:54,524 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:51:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:51:54,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 09:51:54,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:51:55,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 285 proven. 93 refuted. 0 times theorem prover too weak. 1866 trivial. 0 not checked. [2024-10-11 09:51:55,715 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:51:56,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 6 proven. 93 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2024-10-11 09:51:56,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463522170] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:51:56,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 09:51:56,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2024-10-11 09:51:56,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784565806] [2024-10-11 09:51:56,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 09:51:56,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 09:51:56,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:51:56,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 09:51:56,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2024-10-11 09:51:56,239 INFO L87 Difference]: Start difference. First operand 2976 states and 4395 transitions. Second operand has 16 states, 16 states have (on average 7.875) internal successors, (126), 16 states have internal predecessors, (126), 6 states have call successors, (102), 3 states have call predecessors, (102), 6 states have return successors, (102), 6 states have call predecessors, (102), 6 states have call successors, (102) [2024-10-11 09:51:57,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:51:57,646 INFO L93 Difference]: Finished difference Result 5876 states and 8640 transitions. [2024-10-11 09:51:57,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 09:51:57,647 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.875) internal successors, (126), 16 states have internal predecessors, (126), 6 states have call successors, (102), 3 states have call predecessors, (102), 6 states have return successors, (102), 6 states have call predecessors, (102), 6 states have call successors, (102) Word has length 224 [2024-10-11 09:51:57,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:51:57,664 INFO L225 Difference]: With dead ends: 5876 [2024-10-11 09:51:57,664 INFO L226 Difference]: Without dead ends: 3051 [2024-10-11 09:51:57,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 506 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2024-10-11 09:51:57,673 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 696 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 09:51:57,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1229 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 09:51:57,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3051 states. [2024-10-11 09:51:58,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3051 to 2999. [2024-10-11 09:51:58,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2999 states, 2538 states have (on average 1.4239558707643813) internal successors, (3614), 2558 states have internal predecessors, (3614), 394 states have call successors, (394), 66 states have call predecessors, (394), 66 states have return successors, (394), 374 states have call predecessors, (394), 394 states have call successors, (394) [2024-10-11 09:51:58,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2999 states and 4402 transitions. [2024-10-11 09:51:58,074 INFO L78 Accepts]: Start accepts. Automaton has 2999 states and 4402 transitions. Word has length 224 [2024-10-11 09:51:58,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:51:58,075 INFO L471 AbstractCegarLoop]: Abstraction has 2999 states and 4402 transitions. [2024-10-11 09:51:58,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.875) internal successors, (126), 16 states have internal predecessors, (126), 6 states have call successors, (102), 3 states have call predecessors, (102), 6 states have return successors, (102), 6 states have call predecessors, (102), 6 states have call successors, (102) [2024-10-11 09:51:58,075 INFO L276 IsEmpty]: Start isEmpty. Operand 2999 states and 4402 transitions. [2024-10-11 09:51:58,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-10-11 09:51:58,078 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:51:58,078 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:58,096 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:51:58,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:51:58,279 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:51:58,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:51:58,280 INFO L85 PathProgramCache]: Analyzing trace with hash 811743778, now seen corresponding path program 1 times [2024-10-11 09:51:58,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:51:58,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977308758] [2024-10-11 09:51:58,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:51:58,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:51:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 09:51:58,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1950352259] [2024-10-11 09:51:58,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:51:58,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:51:58,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:51:58,499 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:51:58,501 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:51:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 09:51:58,680 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 09:51:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 09:51:58,953 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 09:51:58,953 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 09:51:58,954 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 09:51:58,973 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:51:59,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:51:59,163 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:51:59,320 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 09:51:59,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 09:51:59 BoogieIcfgContainer [2024-10-11 09:51:59,323 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 09:51:59,324 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 09:51:59,324 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 09:51:59,324 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 09:51:59,325 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:51:13" (3/4) ... [2024-10-11 09:51:59,327 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 09:51:59,328 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 09:51:59,329 INFO L158 Benchmark]: Toolchain (without parser) took 47285.03ms. Allocated memory was 176.2MB in the beginning and 597.7MB in the end (delta: 421.5MB). Free memory was 127.5MB in the beginning and 332.7MB in the end (delta: -205.2MB). Peak memory consumption was 218.4MB. Max. memory is 16.1GB. [2024-10-11 09:51:59,329 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 176.2MB. Free memory is still 142.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 09:51:59,329 INFO L158 Benchmark]: CACSL2BoogieTranslator took 409.79ms. Allocated memory is still 176.2MB. Free memory was 127.5MB in the beginning and 109.2MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 09:51:59,330 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.99ms. Allocated memory is still 176.2MB. Free memory was 109.2MB in the beginning and 103.7MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 09:51:59,330 INFO L158 Benchmark]: Boogie Preprocessor took 105.15ms. Allocated memory is still 176.2MB. Free memory was 103.7MB in the beginning and 96.6MB in the end (delta: 7.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 09:51:59,331 INFO L158 Benchmark]: RCFGBuilder took 863.26ms. Allocated memory is still 176.2MB. Free memory was 96.6MB in the beginning and 57.5MB in the end (delta: 39.1MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-10-11 09:51:59,332 INFO L158 Benchmark]: TraceAbstraction took 45821.56ms. Allocated memory was 176.2MB in the beginning and 597.7MB in the end (delta: 421.5MB). Free memory was 56.8MB in the beginning and 332.7MB in the end (delta: -275.9MB). Peak memory consumption was 147.1MB. Max. memory is 16.1GB. [2024-10-11 09:51:59,333 INFO L158 Benchmark]: Witness Printer took 4.12ms. Allocated memory is still 597.7MB. Free memory is still 332.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 09:51:59,334 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 176.2MB. Free memory is still 142.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 409.79ms. Allocated memory is still 176.2MB. Free memory was 127.5MB in the beginning and 109.2MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.99ms. Allocated memory is still 176.2MB. Free memory was 109.2MB in the beginning and 103.7MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 105.15ms. Allocated memory is still 176.2MB. Free memory was 103.7MB in the beginning and 96.6MB in the end (delta: 7.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 863.26ms. Allocated memory is still 176.2MB. Free memory was 96.6MB in the beginning and 57.5MB in the end (delta: 39.1MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 45821.56ms. Allocated memory was 176.2MB in the beginning and 597.7MB in the end (delta: 421.5MB). Free memory was 56.8MB in the beginning and 332.7MB in the end (delta: -275.9MB). Peak memory consumption was 147.1MB. Max. memory is 16.1GB. * Witness Printer took 4.12ms. Allocated memory is still 597.7MB. Free memory is still 332.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 208, overapproximation of someBinaryFLOATComparisonOperation at line 208, overapproximation of bitwiseOr at line 142. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 8; [L23] double var_1_3 = 0.875; [L24] unsigned short int var_1_4 = 49926; [L25] unsigned short int var_1_5 = 500; [L26] unsigned short int var_1_6 = 10; [L27] unsigned char var_1_8 = 64; [L28] unsigned short int var_1_9 = 5; [L29] unsigned char var_1_11 = 10; [L30] float var_1_12 = 0.19999999999999996; [L31] float var_1_13 = 9.2; [L32] float var_1_14 = 5.8; [L33] float var_1_15 = 31.25; [L34] unsigned char var_1_16 = 1; [L35] unsigned char var_1_17 = 0; [L36] unsigned char var_1_18 = 0; [L37] unsigned char var_1_19 = 1; [L38] unsigned short int var_1_20 = 256; [L39] unsigned short int var_1_21 = 23544; [L40] unsigned long int var_1_22 = 64; [L41] double var_1_23 = 100.75; [L42] double var_1_29 = 15.75; [L43] double var_1_30 = 10.3; [L44] signed long int var_1_31 = -16; [L45] unsigned char var_1_32 = 128; [L46] unsigned char var_1_33 = 1; [L47] unsigned long int var_1_34 = 64; [L48] unsigned long int var_1_35 = 2280229334; [L49] unsigned short int var_1_36 = 4; [L50] unsigned short int var_1_37 = 37841; [L51] double var_1_38 = 9.5; [L52] signed char var_1_39 = -5; [L53] signed char var_1_40 = 8; [L54] signed char var_1_41 = 8; [L55] signed char var_1_42 = -10; [L56] unsigned char var_1_43 = 1; [L57] unsigned char last_1_var_1_8 = 64; [L58] unsigned char last_1_var_1_19 = 1; [L59] unsigned short int last_1_var_1_20 = 256; [L60] unsigned long int last_1_var_1_22 = 64; [L212] isInitial = 1 [L213] FCALL initially() [L214] COND TRUE 1 [L215] CALL updateLastVariables() [L202] last_1_var_1_8 = var_1_8 [L203] last_1_var_1_19 = var_1_19 [L204] last_1_var_1_20 = var_1_20 [L205] last_1_var_1_22 = var_1_22 [L215] RET updateLastVariables() [L216] CALL updateVariables() [L147] var_1_3 = __VERIFIER_nondet_double() [L148] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L148] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L149] CALL assume_abort_if_not(var_1_3 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L149] RET assume_abort_if_not(var_1_3 != 0.0F) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L150] var_1_4 = __VERIFIER_nondet_ushort() [L151] CALL assume_abort_if_not(var_1_4 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L151] RET assume_abort_if_not(var_1_4 >= 49150) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L152] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L152] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L153] var_1_5 = __VERIFIER_nondet_ushort() [L154] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_6=10, var_1_8=64, var_1_9=5] [L154] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_6=10, var_1_8=64, var_1_9=5] [L155] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=10, var_1_8=64, var_1_9=5] [L155] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=10, var_1_8=64, var_1_9=5] [L156] var_1_6 = __VERIFIER_nondet_ushort() [L157] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_8=64, var_1_9=5] [L157] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_8=64, var_1_9=5] [L158] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=5] [L158] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=5] [L159] var_1_9 = __VERIFIER_nondet_ushort() [L160] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64] [L160] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64] [L161] CALL assume_abort_if_not(var_1_9 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L161] RET assume_abort_if_not(var_1_9 <= 32767) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L162] var_1_11 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L163] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L164] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L164] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L165] var_1_13 = __VERIFIER_nondet_float() [L166] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && 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_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L166] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && 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_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L167] var_1_14 = __VERIFIER_nondet_float() [L168] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L168] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L169] var_1_15 = __VERIFIER_nondet_float() [L170] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L170] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L171] var_1_17 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L172] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L173] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L173] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L174] var_1_18 = __VERIFIER_nondet_uchar() [L175] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L175] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L176] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L176] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L177] var_1_21 = __VERIFIER_nondet_ushort() [L178] CALL assume_abort_if_not(var_1_21 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L178] RET assume_abort_if_not(var_1_21 >= 16383) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L179] CALL assume_abort_if_not(var_1_21 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L179] RET assume_abort_if_not(var_1_21 <= 32767) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_29=63/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L180] var_1_29 = __VERIFIER_nondet_double() [L181] CALL assume_abort_if_not((var_1_29 >= -922337.2036854765600e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854765600e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L181] RET assume_abort_if_not((var_1_29 >= -922337.2036854765600e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854765600e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=1, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L182] var_1_33 = __VERIFIER_nondet_uchar() [L183] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L183] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L184] CALL assume_abort_if_not(var_1_33 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=0, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=0, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L184] RET assume_abort_if_not(var_1_33 <= 254) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=0, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L185] var_1_35 = __VERIFIER_nondet_ulong() [L186] CALL assume_abort_if_not(var_1_35 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L186] RET assume_abort_if_not(var_1_35 >= 2147483647) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L187] CALL assume_abort_if_not(var_1_35 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L187] RET assume_abort_if_not(var_1_35 <= 4294967294) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=4, var_1_37=37841, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L188] var_1_37 = __VERIFIER_nondet_ushort() [L189] CALL assume_abort_if_not(var_1_37 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=4, var_1_37=32767, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=4, var_1_37=32767, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L189] RET assume_abort_if_not(var_1_37 >= 32767) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=4, var_1_37=32767, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L190] CALL assume_abort_if_not(var_1_37 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=4, var_1_37=32767, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=4, var_1_37=32767, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L190] RET assume_abort_if_not(var_1_37 <= 65534) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=4, var_1_37=32767, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L191] var_1_40 = __VERIFIER_nondet_char() [L192] CALL assume_abort_if_not(var_1_40 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=4, var_1_37=32767, var_1_38=19/2, var_1_39=-5, var_1_40=-127, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=4, var_1_37=32767, var_1_38=19/2, var_1_39=-5, var_1_40=-127, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L192] RET assume_abort_if_not(var_1_40 >= -127) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=4, var_1_37=32767, var_1_38=19/2, var_1_39=-5, var_1_40=-127, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L193] CALL assume_abort_if_not(var_1_40 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=4, var_1_37=32767, var_1_38=19/2, var_1_39=-5, var_1_40=-127, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=4, var_1_37=32767, var_1_38=19/2, var_1_39=-5, var_1_40=-127, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L193] RET assume_abort_if_not(var_1_40 <= 126) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=4, var_1_37=32767, var_1_38=19/2, var_1_39=-5, var_1_40=-127, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L194] var_1_41 = __VERIFIER_nondet_char() [L195] CALL assume_abort_if_not(var_1_41 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=4, var_1_37=32767, var_1_38=19/2, var_1_39=-5, var_1_40=-127, var_1_41=-127, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=4, var_1_37=32767, var_1_38=19/2, var_1_39=-5, var_1_40=-127, var_1_41=-127, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L195] RET assume_abort_if_not(var_1_41 >= -127) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=4, var_1_37=32767, var_1_38=19/2, var_1_39=-5, var_1_40=-127, var_1_41=-127, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L196] CALL assume_abort_if_not(var_1_41 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=4, var_1_37=32767, var_1_38=19/2, var_1_39=-5, var_1_40=-127, var_1_41=-127, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=4, var_1_37=32767, var_1_38=19/2, var_1_39=-5, var_1_40=-127, var_1_41=-127, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L196] RET assume_abort_if_not(var_1_41 <= 126) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=4, var_1_37=32767, var_1_38=19/2, var_1_39=-5, var_1_40=-127, var_1_41=-127, var_1_42=-10, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L197] var_1_42 = __VERIFIER_nondet_char() [L198] CALL assume_abort_if_not(var_1_42 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=4, var_1_37=32767, var_1_38=19/2, var_1_39=-5, var_1_40=-127, var_1_41=-127, var_1_42=-8, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=4, var_1_37=32767, var_1_38=19/2, var_1_39=-5, var_1_40=-127, var_1_41=-127, var_1_42=-8, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L198] RET assume_abort_if_not(var_1_42 >= -126) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=4, var_1_37=32767, var_1_38=19/2, var_1_39=-5, var_1_40=-127, var_1_41=-127, var_1_42=-8, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L199] CALL assume_abort_if_not(var_1_42 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=4, var_1_37=32767, var_1_38=19/2, var_1_39=-5, var_1_40=-127, var_1_41=-127, var_1_42=-8, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=4, var_1_37=32767, var_1_38=19/2, var_1_39=-5, var_1_40=-127, var_1_41=-127, var_1_42=-8, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L199] RET assume_abort_if_not(var_1_42 <= 126) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=4, var_1_37=32767, var_1_38=19/2, var_1_39=-5, var_1_40=-127, var_1_41=-127, var_1_42=-8, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L216] RET updateVariables() [L217] CALL step() [L64] COND TRUE (last_1_var_1_8 + last_1_var_1_20) > (((((last_1_var_1_8) < 0 ) ? -(last_1_var_1_8) : (last_1_var_1_8))) + last_1_var_1_22) [L65] var_1_16 = (last_1_var_1_19 || var_1_17) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=4, var_1_37=32767, var_1_38=19/2, var_1_39=-5, var_1_40=-127, var_1_41=-127, var_1_42=-8, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L69] var_1_32 = var_1_33 [L70] unsigned short int stepLocal_0 = var_1_5; VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_0=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=0, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=4, var_1_37=32767, var_1_38=19/2, var_1_39=-5, var_1_40=-127, var_1_41=-127, var_1_42=-8, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L71] COND FALSE !(stepLocal_0 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=0, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=4, var_1_37=32767, var_1_38=19/2, var_1_39=-5, var_1_40=-127, var_1_41=-127, var_1_42=-8, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L76] COND FALSE !((((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) / var_1_37) > (var_1_1 * 10)) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=0, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=4, var_1_37=32767, var_1_38=19/2, var_1_39=-5, var_1_40=-127, var_1_41=-127, var_1_42=-8, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L83] unsigned short int stepLocal_2 = var_1_4; VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_2=180222, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=0, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=4, var_1_37=32767, var_1_38=19/2, var_1_39=-5, var_1_40=-127, var_1_41=-127, var_1_42=-8, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L84] COND TRUE var_1_8 <= stepLocal_2 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=0, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=4, var_1_37=32767, var_1_38=19/2, var_1_39=-5, var_1_40=-127, var_1_41=-127, var_1_42=-8, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L85] COND TRUE \read(var_1_16) [L86] var_1_20 = (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=0, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=4, var_1_37=32767, var_1_38=19/2, var_1_39=-5, var_1_40=-127, var_1_41=-127, var_1_42=-8, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L93] EXPR var_1_22 & var_1_33 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=0, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=4, var_1_37=32767, var_1_38=19/2, var_1_39=-5, var_1_40=-127, var_1_41=-127, var_1_42=-8, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L93] COND TRUE (var_1_22 & var_1_33) <= var_1_1 [L94] var_1_36 = 10 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=0, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=10, var_1_37=32767, var_1_38=19/2, var_1_39=-5, var_1_40=-127, var_1_41=-127, var_1_42=-8, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L104] COND TRUE \read(var_1_16) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=0, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=10, var_1_37=32767, var_1_38=19/2, var_1_39=-5, var_1_40=-127, var_1_41=-127, var_1_42=-8, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L105] COND FALSE !((var_1_8 * var_1_8) < var_1_11) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=0, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=10, var_1_37=32767, var_1_38=19/2, var_1_39=-5, var_1_40=-127, var_1_41=-127, var_1_42=-8, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L111] COND FALSE !(var_1_12 <= var_1_12) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=0, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=10, var_1_37=32767, var_1_38=19/2, var_1_39=-5, var_1_40=-127, var_1_41=-127, var_1_42=-8, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L118] COND TRUE var_1_12 >= (1.3 / var_1_3) [L119] var_1_1 = ((var_1_4 - var_1_8) - var_1_8) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=0, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=10, var_1_37=32767, var_1_38=19/2, var_1_39=-5, var_1_40=-127, var_1_41=-127, var_1_42=-8, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L123] unsigned char stepLocal_1 = var_1_1 < 64; VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_1=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=0, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=10, var_1_37=32767, var_1_38=19/2, var_1_39=-5, var_1_40=-127, var_1_41=-127, var_1_42=-8, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L124] COND TRUE \read(var_1_16) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_1=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=0, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=10, var_1_37=32767, var_1_38=19/2, var_1_39=-5, var_1_40=-127, var_1_41=-127, var_1_42=-8, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L125] COND TRUE stepLocal_1 || var_1_16 [L126] var_1_19 = var_1_17 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=0, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=10, var_1_37=32767, var_1_38=19/2, var_1_39=-5, var_1_40=-127, var_1_41=-127, var_1_42=-8, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L129] var_1_30 = var_1_29 [L130] var_1_31 = var_1_22 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_29=2, var_1_30=2, var_1_31=64, var_1_32=0, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=10, var_1_37=32767, var_1_38=19/2, var_1_39=-5, var_1_40=-127, var_1_41=-127, var_1_42=-8, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L131] COND FALSE !(var_1_12 >= var_1_12) [L134] var_1_39 = (((((((var_1_42) > (-8)) ? (var_1_42) : (-8))) < 0 ) ? -((((var_1_42) > (-8)) ? (var_1_42) : (-8))) : ((((var_1_42) > (-8)) ? (var_1_42) : (-8))))) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_29=2, var_1_30=2, var_1_31=64, var_1_32=0, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=10, var_1_37=32767, var_1_38=19/2, var_1_39=8, var_1_40=-127, var_1_41=-127, var_1_42=-8, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L136] EXPR 2 ^ var_1_20 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_29=2, var_1_30=2, var_1_31=64, var_1_32=0, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=10, var_1_37=32767, var_1_38=19/2, var_1_39=8, var_1_40=-127, var_1_41=-127, var_1_42=-8, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L136] EXPR (((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20)) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_29=2, var_1_30=2, var_1_31=64, var_1_32=0, var_1_33=0, var_1_34=64, var_1_35=6442450943, var_1_36=10, var_1_37=32767, var_1_38=19/2, var_1_39=8, var_1_40=-127, var_1_41=-127, var_1_42=-8, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L136] COND FALSE !(var_1_1 >= (((((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20))))) [L139] COND TRUE var_1_12 > 32.8 [L140] var_1_34 = (((((var_1_35 - var_1_22)) > (var_1_1)) ? ((var_1_35 - var_1_22)) : (var_1_1))) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_29=2, var_1_30=2, var_1_31=64, var_1_32=0, var_1_33=0, var_1_34=6442450879, var_1_35=6442450943, var_1_36=10, var_1_37=32767, var_1_38=19/2, var_1_39=8, var_1_40=-127, var_1_41=-127, var_1_42=-8, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L142] EXPR var_1_22 | (var_1_22 + var_1_22) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_29=2, var_1_30=2, var_1_31=64, var_1_32=0, var_1_33=0, var_1_34=6442450879, var_1_35=6442450943, var_1_36=10, var_1_37=32767, var_1_38=19/2, var_1_39=8, var_1_40=-127, var_1_41=-127, var_1_42=-8, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L142] COND FALSE !(var_1_33 == (var_1_22 | (var_1_22 + var_1_22))) [L217] RET step() [L218] CALL, EXPR property() [L208] EXPR (((((((var_1_12 >= (1.3 / var_1_3)) ? (var_1_1 == ((unsigned short int) ((var_1_4 - var_1_8) - var_1_8))) : (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_4)) ? (var_1_8) : (var_1_4)))))) && ((var_1_5 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) ? (last_1_var_1_19 ? (var_1_8 == ((unsigned char) var_1_11)) : 1) : 1)) && (var_1_16 ? (((var_1_8 * var_1_8) < var_1_11) ? (var_1_12 == ((float) ((((((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) > (var_1_15)) ? (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) : (var_1_15))))) : 1) : (var_1_12 == ((float) var_1_14)))) && (((last_1_var_1_8 + last_1_var_1_20) > (((((last_1_var_1_8) < 0 ) ? -(last_1_var_1_8) : (last_1_var_1_8))) + last_1_var_1_22)) ? (var_1_16 == ((unsigned char) (last_1_var_1_19 || var_1_17))) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_16 ? (((var_1_1 < 64) || var_1_16) ? (var_1_19 == ((unsigned char) var_1_17)) : 1) : 1)) && ((var_1_8 <= var_1_4) ? (var_1_16 ? (var_1_20 == ((unsigned short int) (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))))) : (var_1_20 == ((unsigned short int) 16))) : (var_1_20 == ((unsigned short int) (var_1_4 - var_1_8))))) && ((var_1_1 >= (((((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20))))) ? (var_1_22 == ((unsigned long int) var_1_1)) : 1) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_29=2, var_1_30=2, var_1_31=64, var_1_32=0, var_1_33=0, var_1_34=6442450879, var_1_35=6442450943, var_1_36=10, var_1_37=32767, var_1_38=19/2, var_1_39=8, var_1_40=-127, var_1_41=-127, var_1_42=-8, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L208-L209] return (((((((var_1_12 >= (1.3 / var_1_3)) ? (var_1_1 == ((unsigned short int) ((var_1_4 - var_1_8) - var_1_8))) : (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_4)) ? (var_1_8) : (var_1_4)))))) && ((var_1_5 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) ? (last_1_var_1_19 ? (var_1_8 == ((unsigned char) var_1_11)) : 1) : 1)) && (var_1_16 ? (((var_1_8 * var_1_8) < var_1_11) ? (var_1_12 == ((float) ((((((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) > (var_1_15)) ? (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) : (var_1_15))))) : 1) : (var_1_12 == ((float) var_1_14)))) && (((last_1_var_1_8 + last_1_var_1_20) > (((((last_1_var_1_8) < 0 ) ? -(last_1_var_1_8) : (last_1_var_1_8))) + last_1_var_1_22)) ? (var_1_16 == ((unsigned char) (last_1_var_1_19 || var_1_17))) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_16 ? (((var_1_1 < 64) || var_1_16) ? (var_1_19 == ((unsigned char) var_1_17)) : 1) : 1)) && ((var_1_8 <= var_1_4) ? (var_1_16 ? (var_1_20 == ((unsigned short int) (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))))) : (var_1_20 == ((unsigned short int) 16))) : (var_1_20 == ((unsigned short int) (var_1_4 - var_1_8))))) && ((var_1_1 >= (((((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20))))) ? (var_1_22 == ((unsigned long int) var_1_1)) : 1) ; [L218] RET, EXPR property() [L218] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_29=2, var_1_30=2, var_1_31=64, var_1_32=0, var_1_33=0, var_1_34=6442450879, var_1_35=6442450943, var_1_36=10, var_1_37=32767, var_1_38=19/2, var_1_39=8, var_1_40=-127, var_1_41=-127, var_1_42=-8, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] [L19] reach_error() VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_29=2, var_1_30=2, var_1_31=64, var_1_32=0, var_1_33=0, var_1_34=6442450879, var_1_35=6442450943, var_1_36=10, var_1_37=32767, var_1_38=19/2, var_1_39=8, var_1_40=-127, var_1_41=-127, var_1_42=-8, var_1_43=1, var_1_4=180222, var_1_5=0, var_1_6=-32769, var_1_8=64, var_1_9=32767] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 124 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 45.6s, OverallIterations: 14, TraceHistogramMax: 34, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 22.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6075 SdHoareTripleChecker+Valid, 10.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6067 mSDsluCounter, 14399 SdHoareTripleChecker+Invalid, 9.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10489 mSDsCounter, 2026 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7977 IncrementalHoareTripleChecker+Invalid, 10003 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2026 mSolverCounterUnsat, 3910 mSDtfsCounter, 7977 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2056 GetRequests, 1844 SyntacticMatches, 6 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4926 ImplicationChecksByTransitivity, 14.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2999occurred in iteration=13, InterpolantAutomatonStates: 180, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 4234 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 17.8s InterpolantComputationTime, 3760 NumberOfCodeBlocks, 3760 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3740 ConstructedInterpolants, 0 QuantifiedInterpolants, 19303 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1013 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 17 InterpolantComputations, 11 PerfectInterpolantSequences, 37284/38148 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:51:59,417 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-co_file-47.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 905d3c2d64fb03f53248320b27cdc3e4c5f3c81c244c4c483adcf3446c7ed609 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:52:01,755 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:52:01,843 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:52:01,850 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:52:01,850 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:52:01,873 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:52:01,877 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:52:01,879 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:52:01,880 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:52:01,880 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:52:01,881 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:52:01,881 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:52:01,882 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:52:01,883 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:52:01,885 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:52:01,885 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:52:01,885 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:52:01,886 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:52:01,886 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:52:01,886 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:52:01,887 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:52:01,891 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:52:01,892 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:52:01,892 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 09:52:01,892 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 09:52:01,892 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:52:01,893 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 09:52:01,893 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:52:01,893 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:52:01,893 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:52:01,894 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:52:01,894 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:52:01,895 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:52:01,895 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:52:01,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:52:01,896 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:52:01,896 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:52:01,896 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:52:01,897 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 09:52:01,897 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 09:52:01,897 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:52:01,898 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:52:01,898 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:52:01,898 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:52:01,898 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 09:52:01,898 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 -> 905d3c2d64fb03f53248320b27cdc3e4c5f3c81c244c4c483adcf3446c7ed609 [2024-10-11 09:52:02,241 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:52:02,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:52:02,272 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:52:02,274 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:52:02,274 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:52:02,276 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-47.i [2024-10-11 09:52:03,879 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:52:04,120 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:52:04,121 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-47.i [2024-10-11 09:52:04,132 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4cbe4d953/22769e0f0bbf484182fdc54e0fe69bbd/FLAG5a62652b4 [2024-10-11 09:52:04,164 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4cbe4d953/22769e0f0bbf484182fdc54e0fe69bbd [2024-10-11 09:52:04,167 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:52:04,169 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:52:04,170 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:52:04,171 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:52:04,178 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:52:04,179 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:52:04" (1/1) ... [2024-10-11 09:52:04,180 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d8534f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:52:04, skipping insertion in model container [2024-10-11 09:52:04,183 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:52:04" (1/1) ... [2024-10-11 09:52:04,222 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:52:04,439 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-co_file-47.i[919,932] [2024-10-11 09:52:04,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:52:04,561 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:52:04,576 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-co_file-47.i[919,932] [2024-10-11 09:52:04,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:52:04,652 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:52:04,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:52:04 WrapperNode [2024-10-11 09:52:04,652 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:52:04,653 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:52:04,654 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:52:04,654 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:52:04,661 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:52:04" (1/1) ... [2024-10-11 09:52:04,684 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:52:04" (1/1) ... [2024-10-11 09:52:04,719 INFO L138 Inliner]: procedures = 27, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 218 [2024-10-11 09:52:04,720 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:52:04,721 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:52:04,721 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:52:04,721 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:52:04,736 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:52:04" (1/1) ... [2024-10-11 09:52:04,736 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:52:04" (1/1) ... [2024-10-11 09:52:04,745 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:52:04" (1/1) ... [2024-10-11 09:52:04,774 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:52:04,775 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:52:04" (1/1) ... [2024-10-11 09:52:04,775 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:52:04" (1/1) ... [2024-10-11 09:52:04,794 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:52:04" (1/1) ... [2024-10-11 09:52:04,800 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:52:04" (1/1) ... [2024-10-11 09:52:04,803 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:52:04" (1/1) ... [2024-10-11 09:52:04,806 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:52:04" (1/1) ... [2024-10-11 09:52:04,811 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:52:04,812 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:52:04,812 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:52:04,812 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:52:04,813 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:52:04" (1/1) ... [2024-10-11 09:52:04,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:52:04,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:52:04,856 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:52:04,859 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:52:04,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:52:04,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 09:52:04,916 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:52:04,916 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:52:04,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:52:04,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:52:05,048 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:52:05,051 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:52:18,265 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-11 09:52:18,265 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:52:18,361 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:52:18,361 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:52:18,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:52:18 BoogieIcfgContainer [2024-10-11 09:52:18,361 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:52:18,365 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:52:18,366 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:52:18,369 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:52:18,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:52:04" (1/3) ... [2024-10-11 09:52:18,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dffc210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:52:18, skipping insertion in model container [2024-10-11 09:52:18,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:52:04" (2/3) ... [2024-10-11 09:52:18,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dffc210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:52:18, skipping insertion in model container [2024-10-11 09:52:18,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:52:18" (3/3) ... [2024-10-11 09:52:18,375 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-47.i [2024-10-11 09:52:18,392 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:52:18,392 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:52:18,477 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:52:18,485 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;@71d4a164, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:52:18,485 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:52:18,491 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 55 states have (on average 1.490909090909091) internal successors, (82), 56 states have internal predecessors, (82), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 09:52:18,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-10-11 09:52:18,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:52:18,508 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:18,509 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:52:18,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:52:18,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1356066901, now seen corresponding path program 1 times [2024-10-11 09:52:18,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:52:18,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [920152453] [2024-10-11 09:52:18,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:52:18,528 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:52:18,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:52:18,532 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:52:18,555 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:52:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:52:19,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 09:52:19,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:52:19,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1074 proven. 0 refuted. 0 times theorem prover too weak. 1170 trivial. 0 not checked. [2024-10-11 09:52:19,590 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:52:19,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:52:19,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [920152453] [2024-10-11 09:52:19,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [920152453] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:52:19,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:52:19,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:52:19,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419499400] [2024-10-11 09:52:19,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:52:19,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:52:19,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:52:19,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:52:19,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:52:19,630 INFO L87 Difference]: Start difference. First operand has 92 states, 55 states have (on average 1.490909090909091) internal successors, (82), 56 states have internal predecessors, (82), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) 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, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34)