./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-97.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 32bb1a8f237f620d8564fbe646b4542e6d02d07be2c2e5b8eafb2c14f730fdc9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:01:38,849 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:01:38,909 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 10:01:38,914 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:01:38,915 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:01:38,938 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:01:38,939 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:01:38,939 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:01:38,940 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:01:38,940 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:01:38,940 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:01:38,940 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:01:38,940 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:01:38,940 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:01:38,941 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:01:38,941 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:01:38,941 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:01:38,941 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:01:38,942 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:01:38,942 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:01:38,942 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:01:38,942 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:01:38,942 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:01:38,942 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:01:38,942 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:01:38,942 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:01:38,942 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:01:38,942 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:01:38,942 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:01:38,942 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:01:38,942 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:01:38,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:01:38,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:01:38,943 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:01:38,943 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:01:38,943 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:01:38,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:01:38,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:01:38,943 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:01:38,944 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:01:38,944 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:01:38,944 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:01:38,944 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:01:38,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:01:38,944 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:01:38,944 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:01:38,944 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:01:38,944 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:01:38,944 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 32bb1a8f237f620d8564fbe646b4542e6d02d07be2c2e5b8eafb2c14f730fdc9 [2025-01-09 10:01:39,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:01:39,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:01:39,208 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:01:39,209 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:01:39,209 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:01:39,210 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-97.i [2025-01-09 10:01:40,289 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/05345e4cc/35eabbdfd5a041ecbeab172f7ede3a1d/FLAG4480d4237 [2025-01-09 10:01:40,502 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:01:40,515 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-97.i [2025-01-09 10:01:40,528 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/05345e4cc/35eabbdfd5a041ecbeab172f7ede3a1d/FLAG4480d4237 [2025-01-09 10:01:40,541 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/05345e4cc/35eabbdfd5a041ecbeab172f7ede3a1d [2025-01-09 10:01:40,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:01:40,543 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:01:40,544 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:01:40,544 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:01:40,548 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:01:40,548 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:01:40" (1/1) ... [2025-01-09 10:01:40,549 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@178c604e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:40, skipping insertion in model container [2025-01-09 10:01:40,549 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:01:40" (1/1) ... [2025-01-09 10:01:40,561 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:01:40,649 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-97.i[915,928] [2025-01-09 10:01:40,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:01:40,706 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:01:40,712 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-97.i[915,928] [2025-01-09 10:01:40,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:01:40,745 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:01:40,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:40 WrapperNode [2025-01-09 10:01:40,746 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:01:40,746 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:01:40,746 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:01:40,747 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:01:40,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:40" (1/1) ... [2025-01-09 10:01:40,762 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:40" (1/1) ... [2025-01-09 10:01:40,801 INFO L138 Inliner]: procedures = 26, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 273 [2025-01-09 10:01:40,801 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:01:40,802 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:01:40,802 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:01:40,803 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:01:40,809 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:40" (1/1) ... [2025-01-09 10:01:40,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:40" (1/1) ... [2025-01-09 10:01:40,812 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:40" (1/1) ... [2025-01-09 10:01:40,824 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]. [2025-01-09 10:01:40,824 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:40" (1/1) ... [2025-01-09 10:01:40,824 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:40" (1/1) ... [2025-01-09 10:01:40,838 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:40" (1/1) ... [2025-01-09 10:01:40,839 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:40" (1/1) ... [2025-01-09 10:01:40,841 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:40" (1/1) ... [2025-01-09 10:01:40,845 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:40" (1/1) ... [2025-01-09 10:01:40,846 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:40" (1/1) ... [2025-01-09 10:01:40,853 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:01:40,853 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:01:40,853 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:01:40,854 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:01:40,854 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:40" (1/1) ... [2025-01-09 10:01:40,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:01:40,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:01:40,880 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 10:01:40,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 10:01:40,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:01:40,895 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:01:40,895 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:01:40,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:01:40,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:01:40,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:01:40,957 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:01:40,959 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:01:41,334 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-01-09 10:01:41,334 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:01:41,345 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:01:41,345 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:01:41,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:01:41 BoogieIcfgContainer [2025-01-09 10:01:41,346 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:01:41,349 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:01:41,349 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:01:41,352 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:01:41,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:01:40" (1/3) ... [2025-01-09 10:01:41,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50931af6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:01:41, skipping insertion in model container [2025-01-09 10:01:41,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:40" (2/3) ... [2025-01-09 10:01:41,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50931af6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:01:41, skipping insertion in model container [2025-01-09 10:01:41,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:01:41" (3/3) ... [2025-01-09 10:01:41,355 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-97.i [2025-01-09 10:01:41,365 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:01:41,366 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-97.i that has 2 procedures, 119 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:01:41,416 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:01:41,427 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;@74dcc760, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:01:41,427 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:01:41,430 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-01-09 10:01:41,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-01-09 10:01:41,443 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:01:41,444 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:01:41,444 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:01:41,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:01:41,447 INFO L85 PathProgramCache]: Analyzing trace with hash -2060678027, now seen corresponding path program 1 times [2025-01-09 10:01:41,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:01:41,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969003514] [2025-01-09 10:01:41,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:01:41,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:01:41,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-01-09 10:01:41,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-01-09 10:01:41,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:01:41,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:01:41,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2025-01-09 10:01:41,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:01:41,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969003514] [2025-01-09 10:01:41,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969003514] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:01:41,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142314252] [2025-01-09 10:01:41,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:01:41,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:01:41,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:01:41,730 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 10:01:41,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 10:01:41,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-01-09 10:01:41,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-01-09 10:01:41,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:01:41,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:01:41,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:01:41,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:01:41,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2025-01-09 10:01:41,922 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:01:41,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142314252] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:01:41,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:01:41,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:01:41,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460530562] [2025-01-09 10:01:41,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:01:41,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:01:41,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:01:41,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:01:41,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:01:41,941 INFO L87 Difference]: Start difference. First operand has 119 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2025-01-09 10:01:41,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:01:41,961 INFO L93 Difference]: Finished difference Result 232 states and 402 transitions. [2025-01-09 10:01:41,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:01:41,962 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) Word has length 222 [2025-01-09 10:01:41,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:01:41,967 INFO L225 Difference]: With dead ends: 232 [2025-01-09 10:01:41,967 INFO L226 Difference]: Without dead ends: 116 [2025-01-09 10:01:41,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:01:41,971 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:01:41,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:01:41,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-01-09 10:01:41,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-01-09 10:01:41,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-01-09 10:01:42,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 181 transitions. [2025-01-09 10:01:42,001 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 181 transitions. Word has length 222 [2025-01-09 10:01:42,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:01:42,001 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 181 transitions. [2025-01-09 10:01:42,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2025-01-09 10:01:42,002 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 181 transitions. [2025-01-09 10:01:42,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-01-09 10:01:42,004 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:01:42,004 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:01:42,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 10:01:42,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 10:01:42,205 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:01:42,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:01:42,207 INFO L85 PathProgramCache]: Analyzing trace with hash 2035452147, now seen corresponding path program 1 times [2025-01-09 10:01:42,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:01:42,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286597210] [2025-01-09 10:01:42,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:01:42,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:01:42,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-01-09 10:01:42,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-01-09 10:01:42,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:01:42,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:01:42,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-01-09 10:01:42,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:01:42,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286597210] [2025-01-09 10:01:42,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286597210] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:01:42,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:01:42,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:01:42,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178111300] [2025-01-09 10:01:42,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:01:42,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:01:42,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:01:42,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:01:42,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:01:42,498 INFO L87 Difference]: Start difference. First operand 116 states and 181 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 10:01:42,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:01:42,545 INFO L93 Difference]: Finished difference Result 260 states and 405 transitions. [2025-01-09 10:01:42,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:01:42,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 222 [2025-01-09 10:01:42,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:01:42,549 INFO L225 Difference]: With dead ends: 260 [2025-01-09 10:01:42,549 INFO L226 Difference]: Without dead ends: 147 [2025-01-09 10:01:42,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:01:42,551 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 127 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:01:42,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 316 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:01:42,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-01-09 10:01:42,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2025-01-09 10:01:42,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 92 states have (on average 1.3369565217391304) internal successors, (123), 93 states have internal predecessors, (123), 51 states have call successors, (51), 2 states have call predecessors, (51), 2 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2025-01-09 10:01:42,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 225 transitions. [2025-01-09 10:01:42,567 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 225 transitions. Word has length 222 [2025-01-09 10:01:42,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:01:42,568 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 225 transitions. [2025-01-09 10:01:42,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 10:01:42,568 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 225 transitions. [2025-01-09 10:01:42,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-01-09 10:01:42,570 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:01:42,571 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:01:42,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:01:42,571 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:01:42,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:01:42,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1252589369, now seen corresponding path program 1 times [2025-01-09 10:01:42,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:01:42,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203562935] [2025-01-09 10:01:42,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:01:42,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:01:42,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-01-09 10:01:42,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-01-09 10:01:42,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:01:42,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:01:42,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-01-09 10:01:42,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:01:42,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203562935] [2025-01-09 10:01:42,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203562935] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:01:42,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:01:42,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:01:42,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463847428] [2025-01-09 10:01:42,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:01:42,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:01:42,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:01:42,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:01:42,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:01:42,700 INFO L87 Difference]: Start difference. First operand 146 states and 225 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 10:01:42,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:01:42,777 INFO L93 Difference]: Finished difference Result 366 states and 562 transitions. [2025-01-09 10:01:42,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:01:42,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 223 [2025-01-09 10:01:42,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:01:42,781 INFO L225 Difference]: With dead ends: 366 [2025-01-09 10:01:42,781 INFO L226 Difference]: Without dead ends: 249 [2025-01-09 10:01:42,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:01:42,787 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 165 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:01:42,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 461 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:01:42,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-01-09 10:01:42,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 236. [2025-01-09 10:01:42,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 145 states have (on average 1.2758620689655173) internal successors, (185), 147 states have internal predecessors, (185), 86 states have call successors, (86), 4 states have call predecessors, (86), 4 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 10:01:42,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 357 transitions. [2025-01-09 10:01:42,828 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 357 transitions. Word has length 223 [2025-01-09 10:01:42,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:01:42,829 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 357 transitions. [2025-01-09 10:01:42,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 10:01:42,829 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 357 transitions. [2025-01-09 10:01:42,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-01-09 10:01:42,832 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:01:42,832 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:01:42,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:01:42,832 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:01:42,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:01:42,833 INFO L85 PathProgramCache]: Analyzing trace with hash -27274309, now seen corresponding path program 1 times [2025-01-09 10:01:42,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:01:42,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26929691] [2025-01-09 10:01:42,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:01:42,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:01:42,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-01-09 10:01:42,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-01-09 10:01:42,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:01:42,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:01:43,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-01-09 10:01:43,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:01:43,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26929691] [2025-01-09 10:01:43,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26929691] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:01:43,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:01:43,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:01:43,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702847262] [2025-01-09 10:01:43,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:01:43,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:01:43,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:01:43,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:01:43,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:01:43,220 INFO L87 Difference]: Start difference. First operand 236 states and 357 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 10:01:43,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:01:43,606 INFO L93 Difference]: Finished difference Result 689 states and 1044 transitions. [2025-01-09 10:01:43,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:01:43,608 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 223 [2025-01-09 10:01:43,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:01:43,614 INFO L225 Difference]: With dead ends: 689 [2025-01-09 10:01:43,614 INFO L226 Difference]: Without dead ends: 482 [2025-01-09 10:01:43,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:01:43,616 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 261 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:01:43,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 603 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 10:01:43,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-01-09 10:01:43,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 331. [2025-01-09 10:01:43,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 220 states have (on average 1.3272727272727274) internal successors, (292), 221 states have internal predecessors, (292), 105 states have call successors, (105), 5 states have call predecessors, (105), 5 states have return successors, (105), 104 states have call predecessors, (105), 105 states have call successors, (105) [2025-01-09 10:01:43,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 502 transitions. [2025-01-09 10:01:43,671 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 502 transitions. Word has length 223 [2025-01-09 10:01:43,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:01:43,671 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 502 transitions. [2025-01-09 10:01:43,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 10:01:43,672 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 502 transitions. [2025-01-09 10:01:43,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-01-09 10:01:43,674 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:01:43,674 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:01:43,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:01:43,674 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:01:43,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:01:43,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1755297306, now seen corresponding path program 1 times [2025-01-09 10:01:43,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:01:43,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335035790] [2025-01-09 10:01:43,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:01:43,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:01:43,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-01-09 10:01:43,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-01-09 10:01:43,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:01:43,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:01:44,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-01-09 10:01:44,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:01:44,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335035790] [2025-01-09 10:01:44,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335035790] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:01:44,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:01:44,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 10:01:44,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571220967] [2025-01-09 10:01:44,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:01:44,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 10:01:44,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:01:44,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 10:01:44,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:01:44,193 INFO L87 Difference]: Start difference. First operand 331 states and 502 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 10:01:44,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:01:44,641 INFO L93 Difference]: Finished difference Result 763 states and 1146 transitions. [2025-01-09 10:01:44,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:01:44,641 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 224 [2025-01-09 10:01:44,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:01:44,646 INFO L225 Difference]: With dead ends: 763 [2025-01-09 10:01:44,647 INFO L226 Difference]: Without dead ends: 495 [2025-01-09 10:01:44,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 10:01:44,648 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 154 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:01:44,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 902 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 10:01:44,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-01-09 10:01:44,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 471. [2025-01-09 10:01:44,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 323 states have (on average 1.303405572755418) internal successors, (421), 324 states have internal predecessors, (421), 140 states have call successors, (140), 7 states have call predecessors, (140), 7 states have return successors, (140), 139 states have call predecessors, (140), 140 states have call successors, (140) [2025-01-09 10:01:44,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 701 transitions. [2025-01-09 10:01:44,700 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 701 transitions. Word has length 224 [2025-01-09 10:01:44,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:01:44,702 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 701 transitions. [2025-01-09 10:01:44,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 10:01:44,702 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 701 transitions. [2025-01-09 10:01:44,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-01-09 10:01:44,706 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:01:44,706 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:01:44,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:01:44,706 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:01:44,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:01:44,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1241380593, now seen corresponding path program 1 times [2025-01-09 10:01:44,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:01:44,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774870268] [2025-01-09 10:01:44,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:01:44,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:01:44,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-01-09 10:01:44,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-01-09 10:01:44,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:01:44,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:01:44,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-01-09 10:01:44,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:01:44,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774870268] [2025-01-09 10:01:44,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774870268] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:01:44,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:01:44,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:01:44,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128073904] [2025-01-09 10:01:44,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:01:44,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:01:44,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:01:44,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:01:44,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:01:44,874 INFO L87 Difference]: Start difference. First operand 471 states and 701 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 10:01:44,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:01:44,905 INFO L93 Difference]: Finished difference Result 880 states and 1307 transitions. [2025-01-09 10:01:44,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:01:44,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 225 [2025-01-09 10:01:44,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:01:44,909 INFO L225 Difference]: With dead ends: 880 [2025-01-09 10:01:44,909 INFO L226 Difference]: Without dead ends: 472 [2025-01-09 10:01:44,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:01:44,911 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:01:44,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 352 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:01:44,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-01-09 10:01:44,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2025-01-09 10:01:44,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 324 states have (on average 1.2962962962962963) internal successors, (420), 325 states have internal predecessors, (420), 140 states have call successors, (140), 7 states have call predecessors, (140), 7 states have return successors, (140), 139 states have call predecessors, (140), 140 states have call successors, (140) [2025-01-09 10:01:44,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 700 transitions. [2025-01-09 10:01:44,957 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 700 transitions. Word has length 225 [2025-01-09 10:01:44,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:01:44,958 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 700 transitions. [2025-01-09 10:01:44,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 10:01:44,958 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 700 transitions. [2025-01-09 10:01:44,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-01-09 10:01:44,960 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:01:44,960 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:01:44,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:01:44,960 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:01:44,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:01:44,961 INFO L85 PathProgramCache]: Analyzing trace with hash 654574579, now seen corresponding path program 1 times [2025-01-09 10:01:44,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:01:44,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120010476] [2025-01-09 10:01:44,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:01:44,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:01:44,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-01-09 10:01:44,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-01-09 10:01:44,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:01:44,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:01:45,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-01-09 10:01:45,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:01:45,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120010476] [2025-01-09 10:01:45,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120010476] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:01:45,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:01:45,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 10:01:45,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057146471] [2025-01-09 10:01:45,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:01:45,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 10:01:45,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:01:45,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 10:01:45,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:01:45,264 INFO L87 Difference]: Start difference. First operand 472 states and 700 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 10:01:45,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:01:45,973 INFO L93 Difference]: Finished difference Result 1135 states and 1666 transitions. [2025-01-09 10:01:45,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 10:01:45,975 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 225 [2025-01-09 10:01:45,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:01:45,981 INFO L225 Difference]: With dead ends: 1135 [2025-01-09 10:01:45,981 INFO L226 Difference]: Without dead ends: 996 [2025-01-09 10:01:45,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-09 10:01:45,983 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 357 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 10:01:45,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 891 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 10:01:45,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2025-01-09 10:01:46,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 760. [2025-01-09 10:01:46,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 538 states have (on average 1.3066914498141264) internal successors, (703), 539 states have internal predecessors, (703), 210 states have call successors, (210), 11 states have call predecessors, (210), 11 states have return successors, (210), 209 states have call predecessors, (210), 210 states have call successors, (210) [2025-01-09 10:01:46,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1123 transitions. [2025-01-09 10:01:46,100 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1123 transitions. Word has length 225 [2025-01-09 10:01:46,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:01:46,100 INFO L471 AbstractCegarLoop]: Abstraction has 760 states and 1123 transitions. [2025-01-09 10:01:46,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 10:01:46,101 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1123 transitions. [2025-01-09 10:01:46,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-01-09 10:01:46,103 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:01:46,103 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:01:46,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:01:46,104 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:01:46,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:01:46,104 INFO L85 PathProgramCache]: Analyzing trace with hash -626477754, now seen corresponding path program 1 times [2025-01-09 10:01:46,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:01:46,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212914347] [2025-01-09 10:01:46,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:01:46,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:01:46,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-01-09 10:01:46,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-01-09 10:01:46,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:01:46,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:01:46,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-01-09 10:01:46,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:01:46,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212914347] [2025-01-09 10:01:46,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212914347] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:01:46,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:01:46,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:01:46,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447539660] [2025-01-09 10:01:46,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:01:46,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:01:46,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:01:46,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:01:46,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:01:46,402 INFO L87 Difference]: Start difference. First operand 760 states and 1123 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 10:01:46,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:01:46,530 INFO L93 Difference]: Finished difference Result 1468 states and 2168 transitions. [2025-01-09 10:01:46,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:01:46,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 225 [2025-01-09 10:01:46,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:01:46,535 INFO L225 Difference]: With dead ends: 1468 [2025-01-09 10:01:46,535 INFO L226 Difference]: Without dead ends: 771 [2025-01-09 10:01:46,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:01:46,537 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 153 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:01:46,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 703 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:01:46,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2025-01-09 10:01:46,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 760. [2025-01-09 10:01:46,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 538 states have (on average 1.2769516728624535) internal successors, (687), 539 states have internal predecessors, (687), 210 states have call successors, (210), 11 states have call predecessors, (210), 11 states have return successors, (210), 209 states have call predecessors, (210), 210 states have call successors, (210) [2025-01-09 10:01:46,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1107 transitions. [2025-01-09 10:01:46,618 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1107 transitions. Word has length 225 [2025-01-09 10:01:46,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:01:46,619 INFO L471 AbstractCegarLoop]: Abstraction has 760 states and 1107 transitions. [2025-01-09 10:01:46,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 10:01:46,619 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1107 transitions. [2025-01-09 10:01:46,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-01-09 10:01:46,621 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:01:46,621 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:01:46,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:01:46,621 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:01:46,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:01:46,621 INFO L85 PathProgramCache]: Analyzing trace with hash 178115709, now seen corresponding path program 1 times [2025-01-09 10:01:46,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:01:46,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476663043] [2025-01-09 10:01:46,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:01:46,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:01:46,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-09 10:01:46,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-09 10:01:46,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:01:46,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:01:51,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-01-09 10:01:51,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:01:51,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476663043] [2025-01-09 10:01:51,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476663043] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:01:51,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:01:51,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 10:01:51,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129109202] [2025-01-09 10:01:51,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:01:51,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 10:01:51,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:01:51,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 10:01:51,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-01-09 10:01:51,342 INFO L87 Difference]: Start difference. First operand 760 states and 1107 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 10:01:53,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:01:53,064 INFO L93 Difference]: Finished difference Result 1472 states and 2079 transitions. [2025-01-09 10:01:53,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 10:01:53,065 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 229 [2025-01-09 10:01:53,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:01:53,073 INFO L225 Difference]: With dead ends: 1472 [2025-01-09 10:01:53,074 INFO L226 Difference]: Without dead ends: 1203 [2025-01-09 10:01:53,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2025-01-09 10:01:53,076 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 189 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 10:01:53,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 694 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 10:01:53,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2025-01-09 10:01:53,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1128. [2025-01-09 10:01:53,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 891 states have (on average 1.287317620650954) internal successors, (1147), 897 states have internal predecessors, (1147), 220 states have call successors, (220), 16 states have call predecessors, (220), 16 states have return successors, (220), 214 states have call predecessors, (220), 220 states have call successors, (220) [2025-01-09 10:01:53,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1587 transitions. [2025-01-09 10:01:53,217 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1587 transitions. Word has length 229 [2025-01-09 10:01:53,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:01:53,218 INFO L471 AbstractCegarLoop]: Abstraction has 1128 states and 1587 transitions. [2025-01-09 10:01:53,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 10:01:53,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1587 transitions. [2025-01-09 10:01:53,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-01-09 10:01:53,222 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:01:53,222 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:01:53,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 10:01:53,222 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:01:53,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:01:53,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1627322625, now seen corresponding path program 1 times [2025-01-09 10:01:53,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:01:53,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034053716] [2025-01-09 10:01:53,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:01:53,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:01:53,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-09 10:01:53,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-09 10:01:53,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:01:53,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 10:01:53,306 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 10:01:53,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-09 10:01:53,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-09 10:01:53,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:01:53,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 10:01:53,496 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 10:01:53,496 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 10:01:53,497 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 10:01:53,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 10:01:53,502 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:01:53,627 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 10:01:53,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 10:01:53 BoogieIcfgContainer [2025-01-09 10:01:53,633 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 10:01:53,634 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 10:01:53,634 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 10:01:53,634 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 10:01:53,634 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:01:41" (3/4) ... [2025-01-09 10:01:53,636 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 10:01:53,637 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 10:01:53,637 INFO L158 Benchmark]: Toolchain (without parser) took 13093.89ms. Allocated memory was 142.6MB in the beginning and 595.6MB in the end (delta: 453.0MB). Free memory was 107.3MB in the beginning and 391.8MB in the end (delta: -284.5MB). Peak memory consumption was 167.1MB. Max. memory is 16.1GB. [2025-01-09 10:01:53,638 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 10:01:53,639 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.82ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 91.1MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 10:01:53,639 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.12ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 87.4MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 10:01:53,639 INFO L158 Benchmark]: Boogie Preprocessor took 51.00ms. Allocated memory is still 142.6MB. Free memory was 87.4MB in the beginning and 81.1MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 10:01:53,639 INFO L158 Benchmark]: RCFGBuilder took 492.47ms. Allocated memory is still 142.6MB. Free memory was 81.1MB in the beginning and 51.6MB in the end (delta: 29.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 10:01:53,639 INFO L158 Benchmark]: TraceAbstraction took 12284.37ms. Allocated memory was 142.6MB in the beginning and 595.6MB in the end (delta: 453.0MB). Free memory was 50.7MB in the beginning and 391.9MB in the end (delta: -341.2MB). Peak memory consumption was 108.3MB. Max. memory is 16.1GB. [2025-01-09 10:01:53,640 INFO L158 Benchmark]: Witness Printer took 2.96ms. Allocated memory is still 595.6MB. Free memory was 391.9MB in the beginning and 391.8MB in the end (delta: 102.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 10:01:53,641 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.16ms. Allocated memory is still 201.3MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 201.82ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 91.1MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.12ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 87.4MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.00ms. Allocated memory is still 142.6MB. Free memory was 87.4MB in the beginning and 81.1MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 492.47ms. Allocated memory is still 142.6MB. Free memory was 81.1MB in the beginning and 51.6MB in the end (delta: 29.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 12284.37ms. Allocated memory was 142.6MB in the beginning and 595.6MB in the end (delta: 453.0MB). Free memory was 50.7MB in the beginning and 391.9MB in the end (delta: -341.2MB). Peak memory consumption was 108.3MB. Max. memory is 16.1GB. * Witness Printer took 2.96ms. Allocated memory is still 595.6MB. Free memory was 391.9MB in the beginning and 391.8MB in the end (delta: 102.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 81, overapproximation of someBinaryFLOATComparisonOperation at line 86, overapproximation of someBinaryFLOATComparisonOperation at line 136, overapproximation of someBinaryFLOATComparisonOperation at line 185, overapproximation of someBinaryFLOATComparisonOperation at line 189, overapproximation of someBinaryFLOATComparisonOperation at line 138, overapproximation of someBinaryFLOATComparisonOperation at line 195, overapproximation of someBinaryFLOATComparisonOperation at line 187. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 2; [L23] signed long int var_1_5 = 5; [L24] unsigned char var_1_8 = 0; [L25] float var_1_9 = 128.6; [L26] float var_1_10 = 32.5; [L27] unsigned char var_1_11 = 16; [L28] unsigned char var_1_12 = 64; [L29] unsigned char var_1_13 = 4; [L30] unsigned char var_1_14 = 4; [L31] unsigned long int var_1_15 = 0; [L32] signed short int var_1_16 = 0; [L33] signed char var_1_17 = 1; [L34] signed char var_1_18 = -1; [L35] signed char var_1_19 = 0; [L36] signed long int var_1_20 = -64; [L37] unsigned char var_1_22 = 0; [L38] unsigned char var_1_23 = 0; [L39] signed short int var_1_24 = -4; [L40] signed short int var_1_25 = -100; [L41] unsigned long int var_1_26 = 32; [L42] unsigned char var_1_27 = 1; [L43] unsigned long int var_1_28 = 100; [L44] unsigned long int var_1_29 = 1000000000; [L45] unsigned long int var_1_30 = 1000000000; [L46] unsigned long int var_1_31 = 10; [L47] unsigned long int var_1_32 = 10000; [L48] unsigned long int var_1_33 = 0; [L49] signed long int var_1_34 = -10; [L50] signed char var_1_35 = 25; [L51] signed char var_1_36 = -2; [L52] unsigned long int var_1_37 = 32; [L53] float var_1_38 = 4.6; [L54] float var_1_39 = 25.5; [L55] float var_1_40 = 99.25; [L56] signed long int last_1_var_1_5 = 5; VAL [isInitial=0, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0, var_1_9=643/5] [L199] isInitial = 1 [L200] FCALL initially() [L202] CALL updateLastVariables() [L192] last_1_var_1_5 = var_1_5 VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0, var_1_9=643/5] [L202] RET updateLastVariables() [L203] CALL updateVariables() [L135] var_1_9 = __VERIFIER_nondet_float() [L136] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L136] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L137] var_1_10 = __VERIFIER_nondet_float() [L138] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L138] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L139] var_1_11 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L140] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L141] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L141] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L142] var_1_12 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_12 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L143] RET assume_abort_if_not(var_1_12 >= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L144] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L144] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L145] var_1_13 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L146] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L147] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L147] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L148] var_1_14 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L149] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L150] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L150] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L151] var_1_18 = __VERIFIER_nondet_char() [L152] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L152] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L153] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L153] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L154] var_1_19 = __VERIFIER_nondet_char() [L155] CALL assume_abort_if_not(var_1_19 >= -15) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L155] RET assume_abort_if_not(var_1_19 >= -15) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L156] CALL assume_abort_if_not(var_1_19 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L156] RET assume_abort_if_not(var_1_19 <= 16) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L157] var_1_23 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L158] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L159] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L159] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L160] var_1_25 = __VERIFIER_nondet_short() [L161] CALL assume_abort_if_not(var_1_25 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L161] RET assume_abort_if_not(var_1_25 >= -32767) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L162] CALL assume_abort_if_not(var_1_25 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L162] RET assume_abort_if_not(var_1_25 <= 32766) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L163] var_1_27 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L164] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L165] CALL assume_abort_if_not(var_1_27 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L165] RET assume_abort_if_not(var_1_27 <= 1) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L166] var_1_28 = __VERIFIER_nondet_ulong() [L167] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L167] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L168] CALL assume_abort_if_not(var_1_28 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=0, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=0, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L168] RET assume_abort_if_not(var_1_28 <= 4294967294) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=0, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L169] var_1_29 = __VERIFIER_nondet_ulong() [L170] CALL assume_abort_if_not(var_1_29 >= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L170] RET assume_abort_if_not(var_1_29 >= 536870911) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L171] CALL assume_abort_if_not(var_1_29 <= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L171] RET assume_abort_if_not(var_1_29 <= 1073741824) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L172] var_1_30 = __VERIFIER_nondet_ulong() [L173] CALL assume_abort_if_not(var_1_30 >= 536870912) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L173] RET assume_abort_if_not(var_1_30 >= 536870912) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L174] CALL assume_abort_if_not(var_1_30 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L174] RET assume_abort_if_not(var_1_30 <= 1073741823) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L175] var_1_31 = __VERIFIER_nondet_ulong() [L176] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L176] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L177] CALL assume_abort_if_not(var_1_31 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L177] RET assume_abort_if_not(var_1_31 <= 1073741823) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L178] var_1_32 = __VERIFIER_nondet_ulong() [L179] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L179] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L180] CALL assume_abort_if_not(var_1_32 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L180] RET assume_abort_if_not(var_1_32 <= 2147483647) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L181] var_1_36 = __VERIFIER_nondet_char() [L182] CALL assume_abort_if_not(var_1_36 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=126, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=126, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L182] RET assume_abort_if_not(var_1_36 >= -127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=126, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L183] CALL assume_abort_if_not(var_1_36 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=126, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=126, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L183] RET assume_abort_if_not(var_1_36 <= 126) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=126, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L184] var_1_38 = __VERIFIER_nondet_float() [L185] CALL assume_abort_if_not((var_1_38 >= -922337.2036854776000e+13F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 9223372.036854776000e+12F && var_1_38 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=126, var_1_37=32, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=126, var_1_37=32, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L185] RET assume_abort_if_not((var_1_38 >= -922337.2036854776000e+13F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 9223372.036854776000e+12F && var_1_38 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=126, var_1_37=32, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L186] var_1_39 = __VERIFIER_nondet_float() [L187] CALL assume_abort_if_not((var_1_39 >= -922337.2036854776000e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=126, var_1_37=32, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=126, var_1_37=32, var_1_40=397/4, var_1_5=5, var_1_8=0] [L187] RET assume_abort_if_not((var_1_39 >= -922337.2036854776000e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=126, var_1_37=32, var_1_40=397/4, var_1_5=5, var_1_8=0] [L188] var_1_40 = __VERIFIER_nondet_float() [L189] CALL assume_abort_if_not((var_1_40 >= -922337.2036854776000e+13F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=126, var_1_37=32, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=126, var_1_37=32, var_1_5=5, var_1_8=0] [L189] RET assume_abort_if_not((var_1_40 >= -922337.2036854776000e+13F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=126, var_1_37=32, var_1_5=5, var_1_8=0] [L203] RET updateVariables() [L204] CALL step() [L60] var_1_24 = var_1_25 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=126, var_1_37=32, var_1_5=5, var_1_8=0] [L61] COND TRUE var_1_24 <= var_1_25 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=126, var_1_37=32, var_1_5=5, var_1_8=0] [L62] COND TRUE \read(var_1_27) [L63] var_1_26 = var_1_28 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=0, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=126, var_1_37=32, var_1_5=5, var_1_8=0] [L70] COND FALSE !(var_1_32 != var_1_29) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=0, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=126, var_1_37=32, var_1_5=5, var_1_8=0] [L75] COND TRUE ((((((((10) < 0 ) ? -(10) : (10)))) > (var_1_24)) ? (((((10) < 0 ) ? -(10) : (10)))) : (var_1_24))) == var_1_25 [L76] var_1_34 = var_1_29 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=0, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=25, var_1_36=126, var_1_37=32, var_1_5=5, var_1_8=0] [L78] COND TRUE \read(var_1_27) [L79] var_1_35 = var_1_36 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=0, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=126, var_1_36=126, var_1_37=32, var_1_5=5, var_1_8=0] [L81] COND FALSE !((var_1_38 * var_1_39) <= var_1_40) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=0, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=126, var_1_36=126, var_1_37=32, var_1_5=5, var_1_8=0] [L86] COND FALSE !(var_1_9 > var_1_10) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=0, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=126, var_1_36=126, var_1_37=32, var_1_5=5, var_1_8=0] [L89] var_1_20 = var_1_8 [L90] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=0, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=126, var_1_36=126, var_1_37=32, var_1_5=5, var_1_8=0] [L91] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=0, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=126, var_1_36=126, var_1_37=32, var_1_5=5, var_1_8=0] [L94] var_1_16 = (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=0, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=126, var_1_36=126, var_1_37=32, var_1_5=5, var_1_8=0] [L95] COND FALSE !(\read(var_1_22)) [L102] var_1_17 = -32 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=0, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=126, var_1_36=126, var_1_37=32, var_1_5=5, var_1_8=0] [L104] unsigned long int stepLocal_1 = var_1_20 + var_1_15; [L105] signed long int stepLocal_0 = var_1_20; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=0, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=126, var_1_36=126, var_1_37=32, var_1_5=5, var_1_8=0] [L106] COND TRUE stepLocal_1 < -200 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=0, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=126, var_1_36=126, var_1_37=32, var_1_5=5, var_1_8=0] [L107] COND FALSE !(\read(var_1_22)) [L114] var_1_1 = var_1_20 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=0, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=126, var_1_36=126, var_1_37=32, var_1_5=5, var_1_8=0] [L119] signed long int stepLocal_4 = 256; [L120] unsigned char stepLocal_3 = var_1_22; [L121] unsigned long int stepLocal_2 = var_1_15; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=256, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=0, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=126, var_1_36=126, var_1_37=32, var_1_5=5, var_1_8=0] [L122] COND FALSE !(stepLocal_4 > (var_1_15 - (last_1_var_1_5 + var_1_8))) VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=0, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=126, var_1_36=126, var_1_37=32, var_1_5=5, var_1_8=0] [L125] COND FALSE !(stepLocal_3 || var_1_22) [L130] var_1_5 = -10000 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=0, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=126, var_1_36=126, var_1_37=32, var_1_5=-10000, var_1_8=0] [L204] RET step() [L205] CALL, EXPR property() [L195] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=0, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=126, var_1_36=126, var_1_37=32, var_1_5=-10000, var_1_8=0] [L195] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=0, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=126, var_1_36=126, var_1_37=32, var_1_5=-10000, var_1_8=0] [L195] EXPR (var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=0, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=126, var_1_36=126, var_1_37=32, var_1_5=-10000, var_1_8=0] [L195] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=0, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=126, var_1_36=126, var_1_37=32, var_1_5=-10000, var_1_8=0] [L195] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=0, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=126, var_1_36=126, var_1_37=32, var_1_5=-10000, var_1_8=0] [L195] EXPR (((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=0, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=126, var_1_36=126, var_1_37=32, var_1_5=-10000, var_1_8=0] [L195-L196] return (((((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32)))) && (var_1_20 == ((signed long int) var_1_8))) && (var_1_22 == ((unsigned char) var_1_23)) ; [L205] RET, EXPR property() [L205] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=0, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=126, var_1_36=126, var_1_37=32, var_1_5=-10000, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=0, var_1_27=1, var_1_28=0, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=126, var_1_36=126, var_1_37=32, var_1_5=-10000, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 119 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.1s, OverallIterations: 10, TraceHistogramMax: 35, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1406 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1406 mSDsluCounter, 5103 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3040 mSDsCounter, 428 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1402 IncrementalHoareTripleChecker+Invalid, 1830 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 428 mSolverCounterUnsat, 2063 mSDtfsCounter, 1402 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 283 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1128occurred in iteration=9, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 9 MinimizatonAttempts, 511 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 2469 NumberOfCodeBlocks, 2469 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2230 ConstructedInterpolants, 0 QuantifiedInterpolants, 11724 SizeOfPredicates, 0 NumberOfNonLiveVariables, 501 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 23732/23800 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 10:01:53,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-97.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 32bb1a8f237f620d8564fbe646b4542e6d02d07be2c2e5b8eafb2c14f730fdc9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:01:55,474 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:01:55,565 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 10:01:55,569 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:01:55,569 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:01:55,590 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:01:55,590 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:01:55,591 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:01:55,591 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:01:55,591 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:01:55,591 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:01:55,591 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:01:55,591 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:01:55,591 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:01:55,591 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:01:55,592 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:01:55,592 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:01:55,592 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:01:55,592 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:01:55,592 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:01:55,592 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:01:55,592 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:01:55,592 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:01:55,592 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 10:01:55,592 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 10:01:55,592 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 10:01:55,593 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:01:55,593 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:01:55,593 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:01:55,593 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:01:55,593 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:01:55,593 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:01:55,593 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:01:55,593 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:01:55,593 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:01:55,593 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:01:55,594 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:01:55,594 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:01:55,594 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:01:55,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:01:55,594 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:01:55,594 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:01:55,594 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:01:55,594 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:01:55,594 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 10:01:55,594 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 10:01:55,594 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:01:55,594 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:01:55,595 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:01:55,595 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:01:55,595 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 32bb1a8f237f620d8564fbe646b4542e6d02d07be2c2e5b8eafb2c14f730fdc9 [2025-01-09 10:01:55,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:01:55,829 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:01:55,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:01:55,831 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:01:55,832 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:01:55,832 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-97.i [2025-01-09 10:01:57,049 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/29b05b09b/71abce67293447769afeba9308de6852/FLAG5e999b5b8 [2025-01-09 10:01:57,253 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:01:57,254 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-97.i [2025-01-09 10:01:57,262 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/29b05b09b/71abce67293447769afeba9308de6852/FLAG5e999b5b8 [2025-01-09 10:01:57,618 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/29b05b09b/71abce67293447769afeba9308de6852 [2025-01-09 10:01:57,620 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:01:57,621 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:01:57,628 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:01:57,628 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:01:57,635 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:01:57,635 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:01:57" (1/1) ... [2025-01-09 10:01:57,636 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@469f2ec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:57, skipping insertion in model container [2025-01-09 10:01:57,636 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:01:57" (1/1) ... [2025-01-09 10:01:57,656 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:01:57,768 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-97.i[915,928] [2025-01-09 10:01:57,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:01:57,846 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:01:57,857 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-97.i[915,928] [2025-01-09 10:01:57,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:01:57,895 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:01:57,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:57 WrapperNode [2025-01-09 10:01:57,898 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:01:57,899 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:01:57,899 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:01:57,899 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:01:57,904 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:57" (1/1) ... [2025-01-09 10:01:57,911 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:57" (1/1) ... [2025-01-09 10:01:57,929 INFO L138 Inliner]: procedures = 27, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 208 [2025-01-09 10:01:57,929 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:01:57,930 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:01:57,930 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:01:57,930 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:01:57,936 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:57" (1/1) ... [2025-01-09 10:01:57,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:57" (1/1) ... [2025-01-09 10:01:57,942 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:57" (1/1) ... [2025-01-09 10:01:57,957 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]. [2025-01-09 10:01:57,957 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:57" (1/1) ... [2025-01-09 10:01:57,958 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:57" (1/1) ... [2025-01-09 10:01:57,964 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:57" (1/1) ... [2025-01-09 10:01:57,965 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:57" (1/1) ... [2025-01-09 10:01:57,971 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:57" (1/1) ... [2025-01-09 10:01:57,973 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:57" (1/1) ... [2025-01-09 10:01:57,973 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:57" (1/1) ... [2025-01-09 10:01:57,981 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:01:57,981 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:01:57,981 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:01:57,981 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:01:57,982 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:57" (1/1) ... [2025-01-09 10:01:57,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:01:57,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:01:58,009 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 10:01:58,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 10:01:58,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:01:58,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 10:01:58,030 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:01:58,030 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:01:58,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:01:58,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:01:58,089 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:01:58,091 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:01:58,674 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-01-09 10:01:58,675 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:01:58,684 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:01:58,685 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:01:58,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:01:58 BoogieIcfgContainer [2025-01-09 10:01:58,686 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:01:58,688 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:01:58,688 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:01:58,692 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:01:58,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:01:57" (1/3) ... [2025-01-09 10:01:58,692 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@673982da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:01:58, skipping insertion in model container [2025-01-09 10:01:58,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:57" (2/3) ... [2025-01-09 10:01:58,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@673982da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:01:58, skipping insertion in model container [2025-01-09 10:01:58,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:01:58" (3/3) ... [2025-01-09 10:01:58,694 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-97.i [2025-01-09 10:01:58,705 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:01:58,707 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-97.i that has 2 procedures, 95 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:01:58,747 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:01:58,756 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;@4be245ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:01:58,756 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:01:58,759 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 58 states have internal predecessors, (79), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-01-09 10:01:58,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-01-09 10:01:58,767 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:01:58,767 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:01:58,767 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:01:58,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:01:58,771 INFO L85 PathProgramCache]: Analyzing trace with hash -311050939, now seen corresponding path program 1 times [2025-01-09 10:01:58,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 10:01:58,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690899468] [2025-01-09 10:01:58,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:01:58,778 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 [2025-01-09 10:01:58,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 10:01:58,780 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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) [2025-01-09 10:01:58,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 [2025-01-09 10:01:58,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-01-09 10:01:59,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-01-09 10:01:59,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:01:59,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:01:59,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:01:59,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:01:59,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 648 proven. 0 refuted. 0 times theorem prover too weak. 1732 trivial. 0 not checked. [2025-01-09 10:01:59,096 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:01:59,096 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 10:01:59,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1690899468] [2025-01-09 10:01:59,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1690899468] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:01:59,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:01:59,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 10:01:59,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697987175] [2025-01-09 10:01:59,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:01:59,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:01:59,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 10:01:59,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:01:59,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:01:59,116 INFO L87 Difference]: Start difference. First operand has 95 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 58 states have internal predecessors, (79), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-01-09 10:01:59,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:01:59,138 INFO L93 Difference]: Finished difference Result 184 states and 328 transitions. [2025-01-09 10:01:59,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:01:59,140 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 218 [2025-01-09 10:01:59,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:01:59,144 INFO L225 Difference]: With dead ends: 184 [2025-01-09 10:01:59,145 INFO L226 Difference]: Without dead ends: 92 [2025-01-09 10:01:59,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:01:59,148 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:01:59,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:01:59,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-01-09 10:01:59,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-01-09 10:01:59,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 55 states have internal predecessors, (74), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-01-09 10:01:59,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 144 transitions. [2025-01-09 10:01:59,182 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 144 transitions. Word has length 218 [2025-01-09 10:01:59,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:01:59,182 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 144 transitions. [2025-01-09 10:01:59,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-01-09 10:01:59,183 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 144 transitions. [2025-01-09 10:01:59,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-01-09 10:01:59,185 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:01:59,185 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:01:59,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 10:01:59,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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 [2025-01-09 10:01:59,386 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:01:59,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:01:59,387 INFO L85 PathProgramCache]: Analyzing trace with hash 882485443, now seen corresponding path program 1 times [2025-01-09 10:01:59,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 10:01:59,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1612782214] [2025-01-09 10:01:59,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:01:59,387 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 [2025-01-09 10:01:59,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 10:01:59,390 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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) [2025-01-09 10:01:59,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 [2025-01-09 10:01:59,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-01-09 10:01:59,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-01-09 10:01:59,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:01:59,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:01:59,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 10:01:59,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:01:59,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-01-09 10:01:59,659 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:01:59,660 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 10:01:59,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1612782214] [2025-01-09 10:01:59,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1612782214] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:01:59,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:01:59,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:01:59,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852634849] [2025-01-09 10:01:59,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:01:59,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:01:59,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 10:01:59,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:01:59,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:01:59,664 INFO L87 Difference]: Start difference. First operand 92 states and 144 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 10:01:59,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:01:59,722 INFO L93 Difference]: Finished difference Result 212 states and 331 transitions. [2025-01-09 10:01:59,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:01:59,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 218 [2025-01-09 10:01:59,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:01:59,727 INFO L225 Difference]: With dead ends: 212 [2025-01-09 10:01:59,727 INFO L226 Difference]: Without dead ends: 123 [2025-01-09 10:01:59,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:01:59,728 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 90 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:01:59,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 279 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:01:59,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-01-09 10:01:59,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2025-01-09 10:01:59,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 68 states have (on average 1.2647058823529411) internal successors, (86), 69 states have internal predecessors, (86), 51 states have call successors, (51), 2 states have call predecessors, (51), 2 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2025-01-09 10:01:59,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 188 transitions. [2025-01-09 10:01:59,746 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 188 transitions. Word has length 218 [2025-01-09 10:01:59,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:01:59,747 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 188 transitions. [2025-01-09 10:01:59,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 10:01:59,747 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 188 transitions. [2025-01-09 10:01:59,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-01-09 10:01:59,749 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:01:59,749 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:01:59,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 [2025-01-09 10:01:59,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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 [2025-01-09 10:01:59,950 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:01:59,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:01:59,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1007231617, now seen corresponding path program 1 times [2025-01-09 10:01:59,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 10:01:59,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1870072907] [2025-01-09 10:01:59,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:01:59,951 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 [2025-01-09 10:01:59,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 10:01:59,953 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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) [2025-01-09 10:01:59,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 [2025-01-09 10:02:00,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-01-09 10:02:00,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-01-09 10:02:00,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:02:00,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:02:00,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 10:02:00,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:02:00,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1204 proven. 57 refuted. 0 times theorem prover too weak. 1119 trivial. 0 not checked. [2025-01-09 10:02:00,363 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:02:00,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 45 proven. 57 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2025-01-09 10:02:00,593 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 10:02:00,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1870072907] [2025-01-09 10:02:00,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1870072907] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 10:02:00,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 10:02:00,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2025-01-09 10:02:00,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745032375] [2025-01-09 10:02:00,594 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 10:02:00,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 10:02:00,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 10:02:00,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 10:02:00,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 10:02:00,595 INFO L87 Difference]: Start difference. First operand 122 states and 188 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2025-01-09 10:02:01,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:02:01,073 INFO L93 Difference]: Finished difference Result 229 states and 341 transitions. [2025-01-09 10:02:01,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 10:02:01,074 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) Word has length 219 [2025-01-09 10:02:01,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:02:01,077 INFO L225 Difference]: With dead ends: 229 [2025-01-09 10:02:01,077 INFO L226 Difference]: Without dead ends: 136 [2025-01-09 10:02:01,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 430 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-01-09 10:02:01,078 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 158 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:02:01,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 203 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 10:02:01,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-01-09 10:02:01,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 121. [2025-01-09 10:02:01,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 69 states have internal predecessors, (81), 49 states have call successors, (49), 3 states have call predecessors, (49), 3 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2025-01-09 10:02:01,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 179 transitions. [2025-01-09 10:02:01,092 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 179 transitions. Word has length 219 [2025-01-09 10:02:01,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:02:01,093 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 179 transitions. [2025-01-09 10:02:01,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2025-01-09 10:02:01,093 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 179 transitions. [2025-01-09 10:02:01,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-01-09 10:02:01,095 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:02:01,095 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:02:01,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-01-09 10:02:01,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/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 [2025-01-09 10:02:01,296 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:02:01,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:02:01,297 INFO L85 PathProgramCache]: Analyzing trace with hash -306167039, now seen corresponding path program 1 times [2025-01-09 10:02:01,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 10:02:01,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1694753837] [2025-01-09 10:02:01,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:02:01,298 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 [2025-01-09 10:02:01,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 10:02:01,299 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/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) [2025-01-09 10:02:01,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-01-09 10:02:01,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-01-09 10:02:01,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-01-09 10:02:01,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:02:01,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:02:01,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 10:02:01,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:02:01,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-01-09 10:02:01,999 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:02:01,999 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 10:02:01,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1694753837] [2025-01-09 10:02:02,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1694753837] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:02:02,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:02:02,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:02:02,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104258569] [2025-01-09 10:02:02,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:02:02,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:02:02,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 10:02:02,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:02:02,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:02:02,002 INFO L87 Difference]: Start difference. First operand 121 states and 179 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 10:02:02,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:02:02,379 INFO L93 Difference]: Finished difference Result 268 states and 397 transitions. [2025-01-09 10:02:02,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:02:02,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 219 [2025-01-09 10:02:02,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:02:02,382 INFO L225 Difference]: With dead ends: 268 [2025-01-09 10:02:02,382 INFO L226 Difference]: Without dead ends: 173 [2025-01-09 10:02:02,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:02:02,383 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 138 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:02:02,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 522 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 10:02:02,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-01-09 10:02:02,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 162. [2025-01-09 10:02:02,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 86 states have (on average 1.1395348837209303) internal successors, (98), 87 states have internal predecessors, (98), 70 states have call successors, (70), 5 states have call predecessors, (70), 5 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2025-01-09 10:02:02,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 238 transitions. [2025-01-09 10:02:02,421 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 238 transitions. Word has length 219 [2025-01-09 10:02:02,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:02:02,422 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 238 transitions. [2025-01-09 10:02:02,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 10:02:02,422 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 238 transitions. [2025-01-09 10:02:02,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-01-09 10:02:02,426 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:02:02,426 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:02:02,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-01-09 10:02:02,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/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 [2025-01-09 10:02:02,627 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:02:02,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:02:02,629 INFO L85 PathProgramCache]: Analyzing trace with hash 226861750, now seen corresponding path program 1 times [2025-01-09 10:02:02,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 10:02:02,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [471747783] [2025-01-09 10:02:02,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:02:02,629 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 [2025-01-09 10:02:02,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 10:02:02,631 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/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) [2025-01-09 10:02:02,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-01-09 10:02:02,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 10:02:02,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 10:02:02,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:02:02,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:02:02,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 10:02:02,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:02:03,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-01-09 10:02:03,953 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:02:03,953 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 10:02:03,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [471747783] [2025-01-09 10:02:03,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [471747783] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:02:03,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:02:03,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:02:03,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407077615] [2025-01-09 10:02:03,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:02:03,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:02:03,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 10:02:03,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:02:03,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:02:03,954 INFO L87 Difference]: Start difference. First operand 162 states and 238 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 10:02:04,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:02:04,313 INFO L93 Difference]: Finished difference Result 359 states and 521 transitions. [2025-01-09 10:02:04,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:02:04,314 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 220 [2025-01-09 10:02:04,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:02:04,317 INFO L225 Difference]: With dead ends: 359 [2025-01-09 10:02:04,317 INFO L226 Difference]: Without dead ends: 264 [2025-01-09 10:02:04,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:02:04,320 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 82 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:02:04,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 437 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 10:02:04,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-01-09 10:02:04,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 255. [2025-01-09 10:02:04,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 141 states have (on average 1.1631205673758864) internal successors, (164), 142 states have internal predecessors, (164), 105 states have call successors, (105), 8 states have call predecessors, (105), 8 states have return successors, (105), 104 states have call predecessors, (105), 105 states have call successors, (105) [2025-01-09 10:02:04,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 374 transitions. [2025-01-09 10:02:04,384 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 374 transitions. Word has length 220 [2025-01-09 10:02:04,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:02:04,384 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 374 transitions. [2025-01-09 10:02:04,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 10:02:04,385 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 374 transitions. [2025-01-09 10:02:04,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-01-09 10:02:04,388 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:02:04,388 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:02:04,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-01-09 10:02:04,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/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 [2025-01-09 10:02:04,588 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:02:04,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:02:04,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1501871424, now seen corresponding path program 1 times [2025-01-09 10:02:04,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 10:02:04,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1776160473] [2025-01-09 10:02:04,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:02:04,590 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 [2025-01-09 10:02:04,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 10:02:04,592 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/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) [2025-01-09 10:02:04,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-01-09 10:02:04,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-01-09 10:02:04,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-01-09 10:02:04,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:02:04,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:02:04,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 10:02:04,807 INFO L279 TraceCheckSpWp]: Computing forward predicates...