./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_fillercodesize_ps-cn-10_file-51.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_fillercodesize_ps-cn-10_file-51.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 31ebc7aab32916bad3f1682a2356b41139150eb4d3e5667a296140fbcfedcac2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:06:38,542 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:06:38,601 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 08:06:38,605 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:06:38,606 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:06:38,630 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:06:38,631 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:06:38,631 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:06:38,632 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:06:38,633 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:06:38,633 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:06:38,634 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:06:38,634 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:06:38,634 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:06:38,636 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:06:38,636 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:06:38,637 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:06:38,637 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:06:38,637 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 08:06:38,637 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:06:38,638 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:06:38,641 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:06:38,641 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:06:38,642 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:06:38,642 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:06:38,642 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:06:38,642 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:06:38,642 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:06:38,643 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:06:38,643 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:06:38,643 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:06:38,643 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:06:38,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:06:38,643 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:06:38,644 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:06:38,644 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:06:38,644 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 08:06:38,646 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 08:06:38,646 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:06:38,647 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:06:38,647 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:06:38,647 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:06:38,647 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 -> 31ebc7aab32916bad3f1682a2356b41139150eb4d3e5667a296140fbcfedcac2 [2024-10-11 08:06:38,854 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:06:38,876 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:06:38,879 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:06:38,879 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:06:38,880 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:06:38,881 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-51.i [2024-10-11 08:06:40,210 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:06:40,378 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:06:40,379 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-51.i [2024-10-11 08:06:40,390 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3360fcd64/01ea2219559a4072b9b4433414e30f87/FLAGb7798ab84 [2024-10-11 08:06:40,418 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3360fcd64/01ea2219559a4072b9b4433414e30f87 [2024-10-11 08:06:40,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:06:40,430 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:06:40,430 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:06:40,430 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:06:40,442 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:06:40,446 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:06:40" (1/1) ... [2024-10-11 08:06:40,447 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6414ae4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:40, skipping insertion in model container [2024-10-11 08:06:40,447 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:06:40" (1/1) ... [2024-10-11 08:06:40,487 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:06:40,622 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_fillercodesize_ps-cn-10_file-51.i[915,928] [2024-10-11 08:06:40,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:06:40,706 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:06:40,716 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_fillercodesize_ps-cn-10_file-51.i[915,928] [2024-10-11 08:06:40,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:06:40,760 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:06:40,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:40 WrapperNode [2024-10-11 08:06:40,764 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:06:40,765 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:06:40,765 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:06:40,765 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:06:40,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:40" (1/1) ... [2024-10-11 08:06:40,781 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:40" (1/1) ... [2024-10-11 08:06:40,805 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 204 [2024-10-11 08:06:40,806 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:06:40,806 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:06:40,806 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:06:40,806 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:06:40,815 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:40" (1/1) ... [2024-10-11 08:06:40,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:40" (1/1) ... [2024-10-11 08:06:40,817 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:40" (1/1) ... [2024-10-11 08:06:40,837 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 08:06:40,840 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:40" (1/1) ... [2024-10-11 08:06:40,840 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:40" (1/1) ... [2024-10-11 08:06:40,846 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:40" (1/1) ... [2024-10-11 08:06:40,848 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:40" (1/1) ... [2024-10-11 08:06:40,851 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:40" (1/1) ... [2024-10-11 08:06:40,855 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:40" (1/1) ... [2024-10-11 08:06:40,857 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:06:40,858 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:06:40,858 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:06:40,858 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:06:40,859 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:40" (1/1) ... [2024-10-11 08:06:40,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:06:40,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:06:40,885 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 08:06:40,892 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 08:06:40,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:06:40,935 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:06:40,935 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:06:40,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 08:06:40,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:06:40,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:06:41,014 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:06:41,016 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:06:41,314 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-11 08:06:41,315 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:06:41,366 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:06:41,366 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:06:41,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:06:41 BoogieIcfgContainer [2024-10-11 08:06:41,367 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:06:41,372 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:06:41,373 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:06:41,375 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:06:41,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:06:40" (1/3) ... [2024-10-11 08:06:41,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@694f83d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:06:41, skipping insertion in model container [2024-10-11 08:06:41,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:40" (2/3) ... [2024-10-11 08:06:41,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@694f83d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:06:41, skipping insertion in model container [2024-10-11 08:06:41,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:06:41" (3/3) ... [2024-10-11 08:06:41,382 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-51.i [2024-10-11 08:06:41,401 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:06:41,401 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:06:41,455 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:06:41,463 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;@3d4909b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:06:41,464 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:06:41,469 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 46 states have (on average 1.4130434782608696) internal successors, (65), 47 states have internal predecessors, (65), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-11 08:06:41,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-11 08:06:41,482 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:06:41,483 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:06:41,483 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:06:41,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:06:41,487 INFO L85 PathProgramCache]: Analyzing trace with hash -2105179681, now seen corresponding path program 1 times [2024-10-11 08:06:41,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:06:41,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272990318] [2024-10-11 08:06:41,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:06:41,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:06:41,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:41,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:06:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:41,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 08:06:41,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:41,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 08:06:41,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:41,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:06:41,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:41,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:06:41,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:41,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 08:06:41,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:41,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:06:41,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:41,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:06:41,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:41,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:06:41,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:41,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:06:41,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:41,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:06:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:41,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:06:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:41,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:06:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:41,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:06:41,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:41,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:06:41,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:41,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 08:06:41,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:41,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:06:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:41,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 08:06:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:41,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:06:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:41,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:06:41,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:41,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:06:41,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:41,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:06:41,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:41,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 08:06:41,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:41,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 08:06:41,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:41,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 08:06:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:41,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 08:06:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:41,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 08:06:41,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:41,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 08:06:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:41,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 08:06:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:41,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 08:06:41,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:41,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 08:06:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:41,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 08:06:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:41,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 08:06:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:41,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-11 08:06:41,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:06:41,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272990318] [2024-10-11 08:06:41,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272990318] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:06:41,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:06:41,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:06:41,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144597388] [2024-10-11 08:06:41,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:06:41,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 08:06:41,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:06:41,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 08:06:41,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:06:41,955 INFO L87 Difference]: Start difference. First operand has 82 states, 46 states have (on average 1.4130434782608696) internal successors, (65), 47 states have internal predecessors, (65), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-11 08:06:42,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:06:42,059 INFO L93 Difference]: Finished difference Result 161 states and 293 transitions. [2024-10-11 08:06:42,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 08:06:42,061 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 199 [2024-10-11 08:06:42,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:06:42,067 INFO L225 Difference]: With dead ends: 161 [2024-10-11 08:06:42,068 INFO L226 Difference]: Without dead ends: 80 [2024-10-11 08:06:42,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 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 08:06:42,078 INFO L432 NwaCegarLoop]: 123 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, 123 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 08:06:42,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:06:42,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-11 08:06:42,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-11 08:06:42,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 45 states have internal predecessors, (60), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-11 08:06:42,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 126 transitions. [2024-10-11 08:06:42,127 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 126 transitions. Word has length 199 [2024-10-11 08:06:42,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:06:42,127 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 126 transitions. [2024-10-11 08:06:42,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-11 08:06:42,128 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 126 transitions. [2024-10-11 08:06:42,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-11 08:06:42,134 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:06:42,135 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:06:42,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 08:06:42,135 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:06:42,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:06:42,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1780672293, now seen corresponding path program 1 times [2024-10-11 08:06:42,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:06:42,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466273414] [2024-10-11 08:06:42,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:06:42,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:06:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:42,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:06:42,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:42,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 08:06:42,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:42,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 08:06:42,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:42,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:06:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:42,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:06:42,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:42,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 08:06:42,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:42,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:06:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:42,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:06:42,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:42,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:06:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:42,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:06:42,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:42,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:06:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:42,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:06:42,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:42,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:06:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:42,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:06:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:42,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:06:42,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:42,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 08:06:42,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:42,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:06:42,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:42,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 08:06:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:42,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:06:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:42,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:06:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:42,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:06:42,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:42,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:06:42,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:42,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 08:06:42,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:42,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 08:06:42,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:42,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 08:06:42,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:42,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 08:06:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:42,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 08:06:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:42,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 08:06:42,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:42,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 08:06:42,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:42,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 08:06:42,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:42,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 08:06:42,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:42,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 08:06:42,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:42,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 08:06:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:42,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-11 08:06:42,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:06:42,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466273414] [2024-10-11 08:06:42,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466273414] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:06:42,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:06:42,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:06:42,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427404807] [2024-10-11 08:06:42,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:06:42,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:06:42,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:06:42,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:06:42,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:06:42,649 INFO L87 Difference]: Start difference. First operand 80 states and 126 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 08:06:42,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:06:42,812 INFO L93 Difference]: Finished difference Result 239 states and 377 transitions. [2024-10-11 08:06:42,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:06:42,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 199 [2024-10-11 08:06:42,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:06:42,815 INFO L225 Difference]: With dead ends: 239 [2024-10-11 08:06:42,815 INFO L226 Difference]: Without dead ends: 160 [2024-10-11 08:06:42,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 69 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 08:06:42,817 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 81 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:06:42,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 357 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 08:06:42,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-10-11 08:06:42,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 140. [2024-10-11 08:06:42,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 71 states have (on average 1.2394366197183098) internal successors, (88), 71 states have internal predecessors, (88), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-11 08:06:42,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 220 transitions. [2024-10-11 08:06:42,837 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 220 transitions. Word has length 199 [2024-10-11 08:06:42,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:06:42,838 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 220 transitions. [2024-10-11 08:06:42,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 08:06:42,838 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 220 transitions. [2024-10-11 08:06:42,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-11 08:06:42,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:06:42,840 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:06:42,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 08:06:42,840 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:06:42,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:06:42,841 INFO L85 PathProgramCache]: Analyzing trace with hash -607931097, now seen corresponding path program 1 times [2024-10-11 08:06:42,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:06:42,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861719952] [2024-10-11 08:06:42,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:06:42,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:06:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:06:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 08:06:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 08:06:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:06:43,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:06:43,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 08:06:43,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:06:43,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:06:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:06:43,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:06:43,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:06:43,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:06:43,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:06:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:06:43,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:06:43,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 08:06:43,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:06:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 08:06:43,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:06:43,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:06:43,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:06:43,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:06:43,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 08:06:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 08:06:43,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 08:06:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 08:06:43,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 08:06:43,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 08:06:43,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 08:06:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 08:06:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 08:06:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 08:06:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 08:06:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-11 08:06:43,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:06:43,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861719952] [2024-10-11 08:06:43,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861719952] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:06:43,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:06:43,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 08:06:43,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380582536] [2024-10-11 08:06:43,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:06:43,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 08:06:43,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:06:43,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 08:06:43,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:06:43,198 INFO L87 Difference]: Start difference. First operand 140 states and 220 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 08:06:43,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:06:43,447 INFO L93 Difference]: Finished difference Result 304 states and 476 transitions. [2024-10-11 08:06:43,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 08:06:43,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 200 [2024-10-11 08:06:43,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:06:43,451 INFO L225 Difference]: With dead ends: 304 [2024-10-11 08:06:43,451 INFO L226 Difference]: Without dead ends: 225 [2024-10-11 08:06:43,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 08:06:43,453 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 91 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 08:06:43,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 419 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 08:06:43,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-10-11 08:06:43,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 217. [2024-10-11 08:06:43,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 114 states have (on average 1.2719298245614035) internal successors, (145), 114 states have internal predecessors, (145), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-11 08:06:43,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 343 transitions. [2024-10-11 08:06:43,491 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 343 transitions. Word has length 200 [2024-10-11 08:06:43,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:06:43,491 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 343 transitions. [2024-10-11 08:06:43,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 08:06:43,492 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 343 transitions. [2024-10-11 08:06:43,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-11 08:06:43,497 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:06:43,497 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:06:43,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 08:06:43,497 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:06:43,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:06:43,498 INFO L85 PathProgramCache]: Analyzing trace with hash 704783852, now seen corresponding path program 1 times [2024-10-11 08:06:43,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:06:43,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23169293] [2024-10-11 08:06:43,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:06:43,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:06:43,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:06:43,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 08:06:43,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 08:06:43,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:06:43,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:06:43,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 08:06:43,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:06:43,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:06:43,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:06:43,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:06:43,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:06:43,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:06:43,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:06:43,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:06:43,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:06:43,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 08:06:43,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:06:43,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 08:06:43,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:06:43,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:06:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:06:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:06:43,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 08:06:43,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 08:06:43,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 08:06:43,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 08:06:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 08:06:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 08:06:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 08:06:43,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 08:06:43,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 08:06:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 08:06:43,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 08:06:43,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-11 08:06:43,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:06:43,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23169293] [2024-10-11 08:06:43,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23169293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:06:43,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:06:43,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:06:43,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805034462] [2024-10-11 08:06:43,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:06:43,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:06:43,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:06:43,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:06:43,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:06:43,992 INFO L87 Difference]: Start difference. First operand 217 states and 343 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-11 08:06:44,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:06:44,187 INFO L93 Difference]: Finished difference Result 529 states and 839 transitions. [2024-10-11 08:06:44,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:06:44,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 201 [2024-10-11 08:06:44,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:06:44,191 INFO L225 Difference]: With dead ends: 529 [2024-10-11 08:06:44,193 INFO L226 Difference]: Without dead ends: 373 [2024-10-11 08:06:44,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 69 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 08:06:44,196 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 86 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:06:44,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 340 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 08:06:44,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-10-11 08:06:44,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 371. [2024-10-11 08:06:44,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 200 states have (on average 1.29) internal successors, (258), 200 states have internal predecessors, (258), 165 states have call successors, (165), 5 states have call predecessors, (165), 5 states have return successors, (165), 165 states have call predecessors, (165), 165 states have call successors, (165) [2024-10-11 08:06:44,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 588 transitions. [2024-10-11 08:06:44,263 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 588 transitions. Word has length 201 [2024-10-11 08:06:44,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:06:44,264 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 588 transitions. [2024-10-11 08:06:44,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-11 08:06:44,265 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 588 transitions. [2024-10-11 08:06:44,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-11 08:06:44,268 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:06:44,268 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:06:44,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 08:06:44,268 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:06:44,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:06:44,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1384842222, now seen corresponding path program 1 times [2024-10-11 08:06:44,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:06:44,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169049039] [2024-10-11 08:06:44,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:06:44,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:06:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:06:44,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 08:06:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 08:06:44,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:06:44,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:06:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 08:06:44,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:06:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:06:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:06:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:06:44,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:06:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:06:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:06:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:06:44,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:06:44,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 08:06:44,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:06:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 08:06:44,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:06:44,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:06:44,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:06:44,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:06:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 08:06:44,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 08:06:44,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 08:06:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 08:06:44,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 08:06:44,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 08:06:44,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 08:06:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 08:06:44,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 08:06:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 08:06:44,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 08:06:44,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-11 08:06:44,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:06:44,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169049039] [2024-10-11 08:06:44,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169049039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:06:44,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:06:44,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:06:44,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999068433] [2024-10-11 08:06:44,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:06:44,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:06:44,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:06:44,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:06:44,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:06:44,510 INFO L87 Difference]: Start difference. First operand 371 states and 588 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 08:06:44,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:06:44,599 INFO L93 Difference]: Finished difference Result 691 states and 1098 transitions. [2024-10-11 08:06:44,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:06:44,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 201 [2024-10-11 08:06:44,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:06:44,608 INFO L225 Difference]: With dead ends: 691 [2024-10-11 08:06:44,608 INFO L226 Difference]: Without dead ends: 381 [2024-10-11 08:06:44,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:06:44,614 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 17 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:06:44,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 252 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:06:44,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-10-11 08:06:44,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 371. [2024-10-11 08:06:44,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 200 states have (on average 1.27) internal successors, (254), 200 states have internal predecessors, (254), 165 states have call successors, (165), 5 states have call predecessors, (165), 5 states have return successors, (165), 165 states have call predecessors, (165), 165 states have call successors, (165) [2024-10-11 08:06:44,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 584 transitions. [2024-10-11 08:06:44,696 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 584 transitions. Word has length 201 [2024-10-11 08:06:44,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:06:44,697 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 584 transitions. [2024-10-11 08:06:44,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 08:06:44,697 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 584 transitions. [2024-10-11 08:06:44,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-10-11 08:06:44,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:06:44,702 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:06:44,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 08:06:44,703 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:06:44,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:06:44,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1535035570, now seen corresponding path program 1 times [2024-10-11 08:06:44,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:06:44,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804289795] [2024-10-11 08:06:44,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:06:44,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:06:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:06:44,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 08:06:44,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 08:06:45,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:06:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:06:45,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 08:06:45,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:06:45,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:06:45,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:06:45,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:06:45,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:06:45,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:06:45,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:06:45,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:06:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:06:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 08:06:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:06:45,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 08:06:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:06:45,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:06:45,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:06:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:06:45,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 08:06:45,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 08:06:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 08:06:45,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 08:06:45,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 08:06:45,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 08:06:45,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 08:06:45,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 08:06:45,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 08:06:45,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 08:06:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 08:06:45,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 24 proven. 72 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-10-11 08:06:45,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:06:45,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804289795] [2024-10-11 08:06:45,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804289795] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 08:06:45,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872158433] [2024-10-11 08:06:45,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:06:45,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:06:45,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:06:45,081 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 08:06:45,083 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 08:06:45,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 08:06:45,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:06:45,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 816 proven. 72 refuted. 0 times theorem prover too weak. 1224 trivial. 0 not checked. [2024-10-11 08:06:45,401 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:06:45,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 24 proven. 72 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-10-11 08:06:45,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872158433] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 08:06:45,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 08:06:45,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-11 08:06:45,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825147644] [2024-10-11 08:06:45,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 08:06:45,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 08:06:45,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:06:45,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 08:06:45,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 08:06:45,595 INFO L87 Difference]: Start difference. First operand 371 states and 584 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 3 states have call successors, (81), 2 states have call predecessors, (81), 4 states have return successors, (82), 3 states have call predecessors, (82), 3 states have call successors, (82) [2024-10-11 08:06:45,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:06:45,806 INFO L93 Difference]: Finished difference Result 557 states and 855 transitions. [2024-10-11 08:06:45,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 08:06:45,806 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 3 states have call successors, (81), 2 states have call predecessors, (81), 4 states have return successors, (82), 3 states have call predecessors, (82), 3 states have call successors, (82) Word has length 202 [2024-10-11 08:06:45,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:06:45,809 INFO L225 Difference]: With dead ends: 557 [2024-10-11 08:06:45,809 INFO L226 Difference]: Without dead ends: 401 [2024-10-11 08:06:45,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 466 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-10-11 08:06:45,810 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 73 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:06:45,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 178 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 08:06:45,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-10-11 08:06:45,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 229. [2024-10-11 08:06:45,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 123 states have (on average 1.2195121951219512) internal successors, (150), 123 states have internal predecessors, (150), 99 states have call successors, (99), 6 states have call predecessors, (99), 6 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-11 08:06:45,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 348 transitions. [2024-10-11 08:06:45,846 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 348 transitions. Word has length 202 [2024-10-11 08:06:45,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:06:45,846 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 348 transitions. [2024-10-11 08:06:45,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 3 states have call successors, (81), 2 states have call predecessors, (81), 4 states have return successors, (82), 3 states have call predecessors, (82), 3 states have call successors, (82) [2024-10-11 08:06:45,846 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 348 transitions. [2024-10-11 08:06:45,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-10-11 08:06:45,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:06:45,848 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:06:45,864 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 08:06:46,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:06:46,049 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:06:46,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:06:46,049 INFO L85 PathProgramCache]: Analyzing trace with hash -2079873356, now seen corresponding path program 1 times [2024-10-11 08:06:46,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:06:46,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407699649] [2024-10-11 08:06:46,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:06:46,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:06:46,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:46,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:06:46,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:46,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 08:06:46,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:46,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 08:06:46,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:46,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:06:46,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:46,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:06:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:46,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 08:06:46,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:46,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:06:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:46,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:06:46,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:46,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:06:46,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:46,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:06:46,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:46,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:06:46,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:46,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:06:46,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:46,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:06:46,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:46,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:06:46,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:46,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:06:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:46,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 08:06:46,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:46,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:06:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:46,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 08:06:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:46,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:06:46,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:46,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:06:46,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:46,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:06:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:46,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:06:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:46,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 08:06:46,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:46,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 08:06:46,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:46,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 08:06:46,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:46,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 08:06:46,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:46,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 08:06:46,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:46,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 08:06:46,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:46,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 08:06:46,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:46,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 08:06:46,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:46,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 08:06:46,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:46,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 08:06:46,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:46,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 08:06:46,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:46,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 54 proven. 42 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-10-11 08:06:46,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:06:46,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407699649] [2024-10-11 08:06:46,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407699649] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 08:06:46,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376001262] [2024-10-11 08:06:46,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:06:46,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:06:46,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:06:46,549 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 08:06:46,552 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 08:06:46,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:46,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 08:06:46,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:06:46,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1076 proven. 42 refuted. 0 times theorem prover too weak. 994 trivial. 0 not checked. [2024-10-11 08:06:46,906 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:06:47,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 54 proven. 42 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-10-11 08:06:47,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376001262] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 08:06:47,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 08:06:47,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 9 [2024-10-11 08:06:47,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608483781] [2024-10-11 08:06:47,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 08:06:47,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 08:06:47,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:06:47,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 08:06:47,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 08:06:47,123 INFO L87 Difference]: Start difference. First operand 229 states and 348 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2024-10-11 08:06:47,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:06:47,656 INFO L93 Difference]: Finished difference Result 441 states and 650 transitions. [2024-10-11 08:06:47,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 08:06:47,657 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) Word has length 202 [2024-10-11 08:06:47,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:06:47,659 INFO L225 Difference]: With dead ends: 441 [2024-10-11 08:06:47,660 INFO L226 Difference]: Without dead ends: 358 [2024-10-11 08:06:47,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 464 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2024-10-11 08:06:47,662 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 120 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 08:06:47,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 559 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 08:06:47,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-10-11 08:06:47,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 247. [2024-10-11 08:06:47,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 138 states have (on average 1.1956521739130435) internal successors, (165), 138 states have internal predecessors, (165), 99 states have call successors, (99), 9 states have call predecessors, (99), 9 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-11 08:06:47,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 363 transitions. [2024-10-11 08:06:47,701 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 363 transitions. Word has length 202 [2024-10-11 08:06:47,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:06:47,701 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 363 transitions. [2024-10-11 08:06:47,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2024-10-11 08:06:47,702 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 363 transitions. [2024-10-11 08:06:47,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-11 08:06:47,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:06:47,705 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:06:47,723 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 08:06:47,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:06:47,906 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:06:47,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:06:47,906 INFO L85 PathProgramCache]: Analyzing trace with hash -52636011, now seen corresponding path program 1 times [2024-10-11 08:06:47,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:06:47,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139992581] [2024-10-11 08:06:47,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:06:47,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:06:47,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 08:06:47,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1037739083] [2024-10-11 08:06:47,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:06:47,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:06:47,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:06:48,000 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 08:06:48,004 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 08:06:48,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:06:48,117 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 08:06:48,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:06:48,276 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 08:06:48,276 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 08:06:48,277 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 08:06:48,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 08:06:48,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:06:48,483 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:06:48,578 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 08:06:48,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:06:48 BoogieIcfgContainer [2024-10-11 08:06:48,580 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 08:06:48,581 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 08:06:48,581 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 08:06:48,581 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 08:06:48,581 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:06:41" (3/4) ... [2024-10-11 08:06:48,583 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 08:06:48,583 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 08:06:48,584 INFO L158 Benchmark]: Toolchain (without parser) took 8154.48ms. Allocated memory was 161.5MB in the beginning and 341.8MB in the end (delta: 180.4MB). Free memory was 132.8MB in the beginning and 225.6MB in the end (delta: -92.8MB). Peak memory consumption was 86.8MB. Max. memory is 16.1GB. [2024-10-11 08:06:48,584 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 161.5MB. Free memory was 118.3MB in the beginning and 118.1MB in the end (delta: 140.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 08:06:48,584 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.64ms. Allocated memory is still 161.5MB. Free memory was 132.6MB in the beginning and 118.9MB in the end (delta: 13.7MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. [2024-10-11 08:06:48,584 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.23ms. Allocated memory is still 161.5MB. Free memory was 118.9MB in the beginning and 115.9MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 08:06:48,584 INFO L158 Benchmark]: Boogie Preprocessor took 51.32ms. Allocated memory is still 161.5MB. Free memory was 115.9MB in the beginning and 111.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 08:06:48,585 INFO L158 Benchmark]: RCFGBuilder took 508.59ms. Allocated memory is still 161.5MB. Free memory was 111.7MB in the beginning and 85.3MB in the end (delta: 26.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-11 08:06:48,585 INFO L158 Benchmark]: TraceAbstraction took 7208.00ms. Allocated memory was 161.5MB in the beginning and 341.8MB in the end (delta: 180.4MB). Free memory was 84.4MB in the beginning and 226.7MB in the end (delta: -142.3MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. [2024-10-11 08:06:48,585 INFO L158 Benchmark]: Witness Printer took 2.76ms. Allocated memory is still 341.8MB. Free memory was 226.7MB in the beginning and 225.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 08:06:48,586 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.43ms. Allocated memory is still 161.5MB. Free memory was 118.3MB in the beginning and 118.1MB in the end (delta: 140.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 333.64ms. Allocated memory is still 161.5MB. Free memory was 132.6MB in the beginning and 118.9MB in the end (delta: 13.7MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.23ms. Allocated memory is still 161.5MB. Free memory was 118.9MB in the beginning and 115.9MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.32ms. Allocated memory is still 161.5MB. Free memory was 115.9MB in the beginning and 111.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 508.59ms. Allocated memory is still 161.5MB. Free memory was 111.7MB in the beginning and 85.3MB in the end (delta: 26.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 7208.00ms. Allocated memory was 161.5MB in the beginning and 341.8MB in the end (delta: 180.4MB). Free memory was 84.4MB in the beginning and 226.7MB in the end (delta: -142.3MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. * Witness Printer took 2.76ms. Allocated memory is still 341.8MB. Free memory was 226.7MB in the beginning and 225.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 181, overapproximation of someBinaryFLOATComparisonOperation at line 156, overapproximation of someUnaryDOUBLEoperation at line 37. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 128; [L23] double var_1_4 = 32.3; [L24] double var_1_5 = 0.25; [L25] unsigned char var_1_7 = 2; [L26] signed char var_1_8 = -10; [L27] signed char var_1_9 = 5; [L28] signed char var_1_10 = 4; [L29] signed char var_1_11 = 100; [L30] unsigned long int var_1_12 = 8; [L31] unsigned char var_1_13 = 0; [L32] unsigned long int var_1_15 = 1114432789; [L33] double var_1_17 = 256.8; [L34] double var_1_18 = 1.25; [L35] unsigned long int var_1_19 = 16; [L36] unsigned char var_1_21 = 1; [L37] double var_1_22 = -0.5; [L38] unsigned char var_1_23 = 0; [L39] unsigned char var_1_24 = 1; [L40] float var_1_25 = -0.575; [L41] float var_1_26 = 1.5; [L42] unsigned long int var_1_27 = 64; [L43] unsigned long int var_1_28 = 2; [L44] unsigned long int var_1_29 = 25; [L45] signed long int var_1_30 = 128; [L46] signed long int var_1_31 = -5; [L47] unsigned char var_1_32 = 1; [L48] unsigned char var_1_33 = 64; [L49] signed char var_1_34 = -8; [L50] signed long int var_1_35 = 5; [L51] signed char var_1_36 = 10; [L52] unsigned char last_1_var_1_1 = 128; [L53] unsigned long int last_1_var_1_12 = 8; [L54] double last_1_var_1_17 = 256.8; [L55] unsigned char last_1_var_1_21 = 1; [L185] isInitial = 1 [L186] FCALL initially() [L187] COND TRUE 1 [L188] CALL updateLastVariables() [L175] last_1_var_1_1 = var_1_1 [L176] last_1_var_1_12 = var_1_12 [L177] last_1_var_1_17 = var_1_17 [L178] last_1_var_1_21 = var_1_21 [L188] RET updateLastVariables() [L189] CALL updateVariables() [L122] var_1_4 = __VERIFIER_nondet_double() [L123] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L123] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L124] var_1_5 = __VERIFIER_nondet_double() [L125] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=2, var_1_8=-10, var_1_9=5] [L125] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=2, var_1_8=-10, var_1_9=5] [L126] var_1_7 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_8=-10, var_1_9=5] [L127] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_8=-10, var_1_9=5] [L128] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=5] [L128] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=5] [L129] var_1_9 = __VERIFIER_nondet_char() [L130] CALL assume_abort_if_not(var_1_9 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L130] RET assume_abort_if_not(var_1_9 >= -1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L131] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L131] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L132] var_1_10 = __VERIFIER_nondet_char() [L133] CALL assume_abort_if_not(var_1_10 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L133] RET assume_abort_if_not(var_1_10 >= -1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L134] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L134] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L135] var_1_11 = __VERIFIER_nondet_char() [L136] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L136] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L137] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L137] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L138] var_1_13 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L139] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L140] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L140] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L141] var_1_15 = __VERIFIER_nondet_ulong() [L142] CALL assume_abort_if_not(var_1_15 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L142] RET assume_abort_if_not(var_1_15 >= 1073741823) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L143] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L143] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L144] var_1_18 = __VERIFIER_nondet_double() [L145] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L145] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L146] var_1_22 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L147] RET assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L148] CALL assume_abort_if_not(var_1_22 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L148] RET assume_abort_if_not(var_1_22 != 0.0F) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L149] var_1_23 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L150] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L151] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L151] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L152] var_1_24 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L153] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L154] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L154] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L155] var_1_26 = __VERIFIER_nondet_float() [L156] CALL assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L156] RET assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L157] var_1_28 = __VERIFIER_nondet_ulong() [L158] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L158] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L159] CALL assume_abort_if_not(var_1_28 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L159] RET assume_abort_if_not(var_1_28 <= 4294967294) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L160] var_1_31 = __VERIFIER_nondet_long() [L161] CALL assume_abort_if_not(var_1_31 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L161] RET assume_abort_if_not(var_1_31 >= -2147483647) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L162] CALL assume_abort_if_not(var_1_31 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L162] RET assume_abort_if_not(var_1_31 <= 2147483646) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L163] var_1_33 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L164] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L165] CALL assume_abort_if_not(var_1_33 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L165] RET assume_abort_if_not(var_1_33 <= 254) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L166] var_1_35 = __VERIFIER_nondet_long() [L167] CALL assume_abort_if_not(var_1_35 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L167] RET assume_abort_if_not(var_1_35 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L168] CALL assume_abort_if_not(var_1_35 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L168] RET assume_abort_if_not(var_1_35 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L169] CALL assume_abort_if_not(var_1_35 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L169] RET assume_abort_if_not(var_1_35 != 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L170] var_1_36 = __VERIFIER_nondet_char() [L171] CALL assume_abort_if_not(var_1_36 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L171] RET assume_abort_if_not(var_1_36 >= -127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L172] CALL assume_abort_if_not(var_1_36 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L172] RET assume_abort_if_not(var_1_36 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L189] RET updateVariables() [L190] CALL step() [L59] var_1_25 = var_1_26 [L60] var_1_27 = var_1_28 [L61] var_1_29 = var_1_28 [L62] var_1_30 = var_1_31 [L63] var_1_32 = var_1_33 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L64] COND FALSE !(var_1_30 < (var_1_31 % var_1_35)) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L69] unsigned char stepLocal_3 = ((((var_1_4) > (last_1_var_1_17)) ? (var_1_4) : (last_1_var_1_17))) > var_1_18; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_3=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L70] COND TRUE last_1_var_1_21 || stepLocal_3 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L71] COND TRUE var_1_18 > ((((last_1_var_1_17) < 0 ) ? -(last_1_var_1_17) : (last_1_var_1_17))) [L72] var_1_19 = last_1_var_1_1 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L79] unsigned long int stepLocal_1 = last_1_var_1_12; [L80] unsigned long int stepLocal_0 = 32u; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L81] COND TRUE stepLocal_0 >= last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_1=8, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L82] COND TRUE stepLocal_1 <= last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L83] COND TRUE (var_1_4 - var_1_5) >= last_1_var_1_17 [L84] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L90] COND FALSE !((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L93] COND TRUE ! (var_1_17 > var_1_5) [L94] var_1_8 = (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=0, var_1_7=0, var_1_8=0, var_1_9=0] [L98] unsigned long int stepLocal_4 = var_1_19; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=0, var_1_7=0, var_1_8=0, var_1_9=0] [L99] COND FALSE !((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) [L110] var_1_21 = var_1_23 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=0, var_1_7=0, var_1_8=0, var_1_9=0] [L112] unsigned char stepLocal_2 = var_1_21; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_2=0, stepLocal_4=128, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=0, var_1_7=0, var_1_8=0, var_1_9=0] [L113] COND FALSE !(var_1_21 && stepLocal_2) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=0, var_1_7=0, var_1_8=0, var_1_9=0] [L116] COND FALSE !(\read(var_1_21)) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=0, var_1_7=0, var_1_8=0, var_1_9=0] [L190] RET step() [L191] CALL, EXPR property() [L181-L182] return ((((((32u >= last_1_var_1_12) ? ((last_1_var_1_12 <= last_1_var_1_12) ? (((var_1_4 - var_1_5) >= last_1_var_1_17) ? (var_1_1 == ((unsigned char) var_1_7)) : 1) : 1) : (var_1_1 == ((unsigned char) var_1_7))) && ((! (var_1_17 > var_1_5)) ? (var_1_8 == ((signed char) (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11))) : (var_1_8 == ((signed char) -4)))) && ((var_1_21 && var_1_21) ? (var_1_12 == ((unsigned long int) var_1_11)) : (var_1_21 ? (var_1_12 == ((unsigned long int) (((((var_1_19) > ((var_1_11 + var_1_7))) ? (var_1_19) : ((var_1_11 + var_1_7)))) + (var_1_15 - var_1_1)))) : 1))) && (((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) ? (var_1_17 == ((double) var_1_18)) : 1)) && ((last_1_var_1_21 || (((((var_1_4) > (last_1_var_1_17)) ? (var_1_4) : (last_1_var_1_17))) > var_1_18)) ? ((var_1_18 > ((((last_1_var_1_17) < 0 ) ? -(last_1_var_1_17) : (last_1_var_1_17)))) ? (var_1_19 == ((unsigned long int) last_1_var_1_1)) : (var_1_19 == ((unsigned long int) var_1_11))) : (var_1_19 == ((unsigned long int) last_1_var_1_1)))) && (((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) ? (var_1_13 ? ((var_1_1 < var_1_19) ? (var_1_21 == ((unsigned char) (! var_1_23))) : (var_1_21 == ((unsigned char) var_1_24))) : (var_1_21 == ((unsigned char) var_1_23))) : (var_1_21 == ((unsigned char) var_1_23))) ; [L191] RET, EXPR property() [L191] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=0, var_1_7=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=-255, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=0, var_1_7=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 82 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 8, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 495 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 468 mSDsluCounter, 2228 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1373 mSDsCounter, 396 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 883 IncrementalHoareTripleChecker+Invalid, 1279 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 396 mSolverCounterUnsat, 855 mSDtfsCounter, 883 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1351 GetRequests, 1306 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=371occurred in iteration=4, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 323 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 2214 NumberOfCodeBlocks, 2214 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2201 ConstructedInterpolants, 0 QuantifiedInterpolants, 5015 SizeOfPredicates, 6 NumberOfNonLiveVariables, 928 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 22890/23232 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 08:06:48,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-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_fillercodesize_ps-cn-10_file-51.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 31ebc7aab32916bad3f1682a2356b41139150eb4d3e5667a296140fbcfedcac2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:06:50,611 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:06:50,664 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 08:06:50,667 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:06:50,668 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:06:50,684 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:06:50,685 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:06:50,685 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:06:50,685 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:06:50,686 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:06:50,686 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:06:50,686 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:06:50,687 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:06:50,687 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:06:50,687 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:06:50,687 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:06:50,688 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:06:50,688 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:06:50,688 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:06:50,688 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:06:50,688 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:06:50,689 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:06:50,689 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:06:50,689 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 08:06:50,690 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 08:06:50,690 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:06:50,690 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 08:06:50,690 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:06:50,691 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:06:50,691 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:06:50,691 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:06:50,691 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:06:50,691 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:06:50,692 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:06:50,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:06:50,692 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:06:50,692 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:06:50,693 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:06:50,693 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 08:06:50,693 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 08:06:50,693 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:06:50,694 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:06:50,694 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:06:50,694 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:06:50,694 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 08:06:50,694 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 -> 31ebc7aab32916bad3f1682a2356b41139150eb4d3e5667a296140fbcfedcac2 [2024-10-11 08:06:50,921 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:06:50,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:06:50,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:06:50,957 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:06:50,957 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:06:50,958 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-51.i [2024-10-11 08:06:52,363 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:06:52,549 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:06:52,553 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-51.i [2024-10-11 08:06:52,570 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/999ccf2b6/4b86d00fa674485d9a8caf69cfad8adb/FLAGf1f0d0d6f [2024-10-11 08:06:52,582 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/999ccf2b6/4b86d00fa674485d9a8caf69cfad8adb [2024-10-11 08:06:52,584 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:06:52,600 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:06:52,601 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:06:52,602 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:06:52,609 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:06:52,610 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:06:52" (1/1) ... [2024-10-11 08:06:52,611 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2167e45e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:52, skipping insertion in model container [2024-10-11 08:06:52,611 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:06:52" (1/1) ... [2024-10-11 08:06:52,643 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:06:52,816 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_fillercodesize_ps-cn-10_file-51.i[915,928] [2024-10-11 08:06:52,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:06:52,905 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:06:52,916 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_fillercodesize_ps-cn-10_file-51.i[915,928] [2024-10-11 08:06:52,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:06:52,973 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:06:52,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:52 WrapperNode [2024-10-11 08:06:52,973 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:06:52,974 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:06:52,975 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:06:52,975 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:06:52,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:52" (1/1) ... [2024-10-11 08:06:52,996 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:52" (1/1) ... [2024-10-11 08:06:53,024 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 198 [2024-10-11 08:06:53,025 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:06:53,029 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:06:53,029 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:06:53,029 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:06:53,038 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:52" (1/1) ... [2024-10-11 08:06:53,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:52" (1/1) ... [2024-10-11 08:06:53,047 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:52" (1/1) ... [2024-10-11 08:06:53,069 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 08:06:53,070 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:52" (1/1) ... [2024-10-11 08:06:53,070 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:52" (1/1) ... [2024-10-11 08:06:53,077 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:52" (1/1) ... [2024-10-11 08:06:53,079 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:52" (1/1) ... [2024-10-11 08:06:53,081 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:52" (1/1) ... [2024-10-11 08:06:53,082 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:52" (1/1) ... [2024-10-11 08:06:53,085 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:06:53,086 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:06:53,086 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:06:53,086 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:06:53,086 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:52" (1/1) ... [2024-10-11 08:06:53,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:06:53,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:06:53,119 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 08:06:53,121 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 08:06:53,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:06:53,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 08:06:53,154 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:06:53,154 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:06:53,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:06:53,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:06:53,229 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:06:53,230 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:07:06,097 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-11 08:07:06,097 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:07:06,137 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:07:06,137 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:07:06,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:07:06 BoogieIcfgContainer [2024-10-11 08:07:06,138 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:07:06,139 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:07:06,140 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:07:06,142 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:07:06,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:06:52" (1/3) ... [2024-10-11 08:07:06,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6376bfdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:07:06, skipping insertion in model container [2024-10-11 08:07:06,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:52" (2/3) ... [2024-10-11 08:07:06,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6376bfdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:07:06, skipping insertion in model container [2024-10-11 08:07:06,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:07:06" (3/3) ... [2024-10-11 08:07:06,144 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-51.i [2024-10-11 08:07:06,158 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:07:06,159 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:07:06,233 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:07:06,241 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;@19e118d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:07:06,241 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:07:06,244 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 46 states have (on average 1.4130434782608696) internal successors, (65), 47 states have internal predecessors, (65), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-11 08:07:06,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-11 08:07:06,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:07:06,259 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:07:06,260 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:07:06,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:07:06,264 INFO L85 PathProgramCache]: Analyzing trace with hash -2105179681, now seen corresponding path program 1 times [2024-10-11 08:07:06,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:07:06,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1377182396] [2024-10-11 08:07:06,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:07:06,275 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 08:07:06,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:07:06,277 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 08:07:06,296 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 08:07:07,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:07,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 08:07:07,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:07:07,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 988 proven. 0 refuted. 0 times theorem prover too weak. 1124 trivial. 0 not checked. [2024-10-11 08:07:07,164 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:07:07,164 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:07:07,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1377182396] [2024-10-11 08:07:07,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1377182396] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:07:07,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:07:07,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:07:07,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624514539] [2024-10-11 08:07:07,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:07:07,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 08:07:07,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:07:07,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 08:07:07,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:07:07,206 INFO L87 Difference]: Start difference. First operand has 82 states, 46 states have (on average 1.4130434782608696) internal successors, (65), 47 states have internal predecessors, (65), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-11 08:07:11,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:07:11,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:07:11,472 INFO L93 Difference]: Finished difference Result 161 states and 293 transitions. [2024-10-11 08:07:11,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 08:07:11,563 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 199 [2024-10-11 08:07:11,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:07:11,569 INFO L225 Difference]: With dead ends: 161 [2024-10-11 08:07:11,569 INFO L226 Difference]: Without dead ends: 80 [2024-10-11 08:07:11,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 198 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 08:07:11,574 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-11 08:07:11,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-10-11 08:07:11,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-11 08:07:11,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-11 08:07:11,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 45 states have internal predecessors, (60), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-11 08:07:11,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 126 transitions. [2024-10-11 08:07:11,608 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 126 transitions. Word has length 199 [2024-10-11 08:07:11,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:07:11,609 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 126 transitions. [2024-10-11 08:07:11,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-11 08:07:11,609 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 126 transitions. [2024-10-11 08:07:11,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-11 08:07:11,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:07:11,612 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:07:11,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 08:07:11,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:07:11,817 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:07:11,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:07:11,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1780672293, now seen corresponding path program 1 times [2024-10-11 08:07:11,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:07:11,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1651142012] [2024-10-11 08:07:11,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:07:11,818 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 08:07:11,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:07:11,821 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:07:11,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 08:07:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:12,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 08:07:12,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:07:16,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-11 08:07:16,693 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:07:16,693 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:07:16,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1651142012] [2024-10-11 08:07:16,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1651142012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:07:16,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:07:16,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:07:16,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764569936] [2024-10-11 08:07:16,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:07:16,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:07:16,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:07:16,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:07:16,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:07:16,696 INFO L87 Difference]: Start difference. First operand 80 states and 126 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 08:07:21,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:07:25,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:07:29,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:07:34,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:07:38,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:07:42,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:07:42,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:07:42,508 INFO L93 Difference]: Finished difference Result 239 states and 377 transitions. [2024-10-11 08:07:42,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:07:42,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 199 [2024-10-11 08:07:42,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:07:42,599 INFO L225 Difference]: With dead ends: 239 [2024-10-11 08:07:42,599 INFO L226 Difference]: Without dead ends: 160 [2024-10-11 08:07:42,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:07:42,600 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 78 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 67 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.7s IncrementalHoareTripleChecker+Time [2024-10-11 08:07:42,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 357 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 16 Invalid, 6 Unknown, 0 Unchecked, 25.7s Time] [2024-10-11 08:07:42,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-10-11 08:07:42,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 140. [2024-10-11 08:07:42,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 71 states have (on average 1.2394366197183098) internal successors, (88), 71 states have internal predecessors, (88), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-11 08:07:42,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 220 transitions. [2024-10-11 08:07:42,626 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 220 transitions. Word has length 199 [2024-10-11 08:07:42,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:07:42,627 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 220 transitions. [2024-10-11 08:07:42,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 08:07:42,627 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 220 transitions. [2024-10-11 08:07:42,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-11 08:07:42,629 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:07:42,629 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:07:42,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 08:07:42,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:07:42,834 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:07:42,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:07:42,835 INFO L85 PathProgramCache]: Analyzing trace with hash -607931097, now seen corresponding path program 1 times [2024-10-11 08:07:42,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:07:42,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1541421719] [2024-10-11 08:07:42,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:07:42,836 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 08:07:42,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:07:42,841 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:07:42,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 08:07:43,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:43,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 08:07:43,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:07:48,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-11 08:07:48,140 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:07:48,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:07:48,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1541421719] [2024-10-11 08:07:48,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1541421719] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:07:48,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:07:48,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:07:48,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807005504] [2024-10-11 08:07:48,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:07:48,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 08:07:48,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:07:48,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 08:07:48,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:07:48,148 INFO L87 Difference]: Start difference. First operand 140 states and 220 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 08:07:53,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:07:57,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:08:01,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:08:06,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:08:10,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:08:14,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:08:18,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []