./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-27.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_fillercodestructure_filler-pr-ci_file-27.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 b198c2e9899cdd18ef24e3a73621a4aef3e13c5394aa42c7346238e62ac07c4d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:02:05,654 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:02:05,728 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 11:02:05,736 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:02:05,736 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:02:05,755 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:02:05,756 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:02:05,756 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:02:05,757 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:02:05,757 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:02:05,757 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:02:05,758 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:02:05,758 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:02:05,758 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:02:05,758 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:02:05,759 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:02:05,759 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:02:05,759 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:02:05,759 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 11:02:05,759 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:02:05,759 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:02:05,759 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:02:05,759 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:02:05,759 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:02:05,759 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:02:05,759 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:02:05,759 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:02:05,759 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:02:05,759 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:02:05,759 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:02:05,759 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:02:05,759 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:02:05,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:02:05,760 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:02:05,760 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:02:05,760 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:02:05,760 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:02:05,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:02:05,760 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:02:05,760 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:02:05,760 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:02:05,760 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:02:05,760 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 11:02:05,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 11:02:05,760 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:02:05,761 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:02:05,761 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:02:05,762 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:02:05,762 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 -> b198c2e9899cdd18ef24e3a73621a4aef3e13c5394aa42c7346238e62ac07c4d [2025-01-09 11:02:06,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:02:06,062 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:02:06,064 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:02:06,065 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:02:06,065 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:02:06,066 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-27.i [2025-01-09 11:02:07,353 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef7c2d1bd/60d2e08df962457e8ee73eb1d78ed160/FLAG06d19c2c5 [2025-01-09 11:02:07,735 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:02:07,737 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-27.i [2025-01-09 11:02:07,748 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef7c2d1bd/60d2e08df962457e8ee73eb1d78ed160/FLAG06d19c2c5 [2025-01-09 11:02:07,941 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef7c2d1bd/60d2e08df962457e8ee73eb1d78ed160 [2025-01-09 11:02:07,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:02:07,945 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:02:07,947 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:02:07,947 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:02:07,951 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:02:07,952 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:02:07" (1/1) ... [2025-01-09 11:02:07,952 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ef353e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:02:07, skipping insertion in model container [2025-01-09 11:02:07,953 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:02:07" (1/1) ... [2025-01-09 11:02:07,969 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:02:08,093 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_fillercodestructure_filler-pr-ci_file-27.i[919,932] [2025-01-09 11:02:08,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:02:08,161 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:02:08,170 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_fillercodestructure_filler-pr-ci_file-27.i[919,932] [2025-01-09 11:02:08,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:02:08,227 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:02:08,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:02:08 WrapperNode [2025-01-09 11:02:08,229 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:02:08,230 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:02:08,230 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:02:08,231 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:02:08,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:02:08" (1/1) ... [2025-01-09 11:02:08,243 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:02:08" (1/1) ... [2025-01-09 11:02:08,282 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 195 [2025-01-09 11:02:08,282 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:02:08,283 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:02:08,283 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:02:08,284 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:02:08,291 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:02:08" (1/1) ... [2025-01-09 11:02:08,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:02:08" (1/1) ... [2025-01-09 11:02:08,296 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:02:08" (1/1) ... [2025-01-09 11:02:08,311 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 11:02:08,314 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:02:08" (1/1) ... [2025-01-09 11:02:08,315 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:02:08" (1/1) ... [2025-01-09 11:02:08,328 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:02:08" (1/1) ... [2025-01-09 11:02:08,332 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:02:08" (1/1) ... [2025-01-09 11:02:08,335 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:02:08" (1/1) ... [2025-01-09 11:02:08,338 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:02:08" (1/1) ... [2025-01-09 11:02:08,339 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:02:08" (1/1) ... [2025-01-09 11:02:08,345 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:02:08,346 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:02:08,346 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:02:08,346 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:02:08,347 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:02:08" (1/1) ... [2025-01-09 11:02:08,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:02:08,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:02:08,377 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 11:02:08,379 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 11:02:08,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:02:08,396 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:02:08,396 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:02:08,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 11:02:08,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:02:08,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:02:08,473 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:02:08,474 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:02:08,835 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 11:02:08,835 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:02:08,847 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:02:08,848 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:02:08,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:02:08 BoogieIcfgContainer [2025-01-09 11:02:08,848 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:02:08,850 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:02:08,851 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:02:08,855 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:02:08,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:02:07" (1/3) ... [2025-01-09 11:02:08,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56248dd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:02:08, skipping insertion in model container [2025-01-09 11:02:08,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:02:08" (2/3) ... [2025-01-09 11:02:08,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56248dd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:02:08, skipping insertion in model container [2025-01-09 11:02:08,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:02:08" (3/3) ... [2025-01-09 11:02:08,857 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-27.i [2025-01-09 11:02:08,867 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:02:08,870 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-27.i that has 2 procedures, 89 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:02:08,925 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:02:08,936 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;@7618ed7a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:02:08,937 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:02:08,941 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 60 states have (on average 1.45) internal successors, (87), 61 states have internal predecessors, (87), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 11:02:08,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 11:02:08,954 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:02:08,955 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:02:08,956 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:02:08,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:02:08,962 INFO L85 PathProgramCache]: Analyzing trace with hash -898971177, now seen corresponding path program 1 times [2025-01-09 11:02:08,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:02:08,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059641708] [2025-01-09 11:02:08,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:02:08,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:02:09,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 11:02:09,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 11:02:09,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:02:09,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:02:09,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-01-09 11:02:09,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:02:09,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059641708] [2025-01-09 11:02:09,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059641708] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:02:09,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456682723] [2025-01-09 11:02:09,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:02:09,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:02:09,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:02:09,341 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 11:02:09,342 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 11:02:09,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 11:02:09,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 11:02:09,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:02:09,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:02:09,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 11:02:09,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:02:09,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-01-09 11:02:09,570 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:02:09,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456682723] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:02:09,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 11:02:09,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 11:02:09,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183624074] [2025-01-09 11:02:09,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:02:09,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 11:02:09,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:02:09,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 11:02:09,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:02:09,598 INFO L87 Difference]: Start difference. First operand has 89 states, 60 states have (on average 1.45) internal successors, (87), 61 states have internal predecessors, (87), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 11:02:09,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:02:09,627 INFO L93 Difference]: Finished difference Result 171 states and 297 transitions. [2025-01-09 11:02:09,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 11:02:09,629 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 171 [2025-01-09 11:02:09,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:02:09,637 INFO L225 Difference]: With dead ends: 171 [2025-01-09 11:02:09,637 INFO L226 Difference]: Without dead ends: 85 [2025-01-09 11:02:09,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 172 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 11:02:09,644 INFO L435 NwaCegarLoop]: 131 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, 131 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 11:02:09,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:02:09,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-01-09 11:02:09,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-01-09 11:02:09,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 57 states have internal predecessors, (79), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 11:02:09,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 131 transitions. [2025-01-09 11:02:09,681 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 131 transitions. Word has length 171 [2025-01-09 11:02:09,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:02:09,682 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 131 transitions. [2025-01-09 11:02:09,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 11:02:09,682 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 131 transitions. [2025-01-09 11:02:09,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 11:02:09,686 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:02:09,687 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:02:09,696 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 11:02:09,888 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 11:02:09,888 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:02:09,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:02:09,889 INFO L85 PathProgramCache]: Analyzing trace with hash -2005045045, now seen corresponding path program 1 times [2025-01-09 11:02:09,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:02:09,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119300757] [2025-01-09 11:02:09,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:02:09,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:02:09,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 11:02:09,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 11:02:09,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:02:09,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:02:10,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 11:02:10,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:02:10,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119300757] [2025-01-09 11:02:10,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119300757] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:02:10,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:02:10,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:02:10,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683368292] [2025-01-09 11:02:10,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:02:10,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:02:10,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:02:10,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:02:10,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:02:10,461 INFO L87 Difference]: Start difference. First operand 85 states and 131 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 11:02:10,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:02:10,545 INFO L93 Difference]: Finished difference Result 249 states and 387 transitions. [2025-01-09 11:02:10,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:02:10,548 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2025-01-09 11:02:10,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:02:10,551 INFO L225 Difference]: With dead ends: 249 [2025-01-09 11:02:10,551 INFO L226 Difference]: Without dead ends: 167 [2025-01-09 11:02:10,555 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 11:02:10,556 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 72 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:02:10,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 368 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:02:10,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-01-09 11:02:10,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 163. [2025-01-09 11:02:10,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 108 states have (on average 1.3703703703703705) internal successors, (148), 108 states have internal predecessors, (148), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 11:02:10,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 252 transitions. [2025-01-09 11:02:10,598 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 252 transitions. Word has length 171 [2025-01-09 11:02:10,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:02:10,599 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 252 transitions. [2025-01-09 11:02:10,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 11:02:10,600 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 252 transitions. [2025-01-09 11:02:10,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-01-09 11:02:10,602 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:02:10,602 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:02:10,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 11:02:10,603 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:02:10,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:02:10,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1114388077, now seen corresponding path program 1 times [2025-01-09 11:02:10,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:02:10,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51952908] [2025-01-09 11:02:10,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:02:10,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:02:10,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 11:02:10,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 11:02:10,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:02:10,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:02:11,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 11:02:11,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:02:11,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51952908] [2025-01-09 11:02:11,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51952908] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:02:11,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:02:11,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 11:02:11,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215255876] [2025-01-09 11:02:11,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:02:11,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 11:02:11,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:02:11,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 11:02:11,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:02:11,009 INFO L87 Difference]: Start difference. First operand 163 states and 252 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 11:02:11,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:02:11,241 INFO L93 Difference]: Finished difference Result 468 states and 718 transitions. [2025-01-09 11:02:11,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 11:02:11,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2025-01-09 11:02:11,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:02:11,249 INFO L225 Difference]: With dead ends: 468 [2025-01-09 11:02:11,249 INFO L226 Difference]: Without dead ends: 308 [2025-01-09 11:02:11,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 11:02:11,251 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 169 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:02:11,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 462 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:02:11,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-01-09 11:02:11,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 302. [2025-01-09 11:02:11,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 202 states have (on average 1.3465346534653466) internal successors, (272), 204 states have internal predecessors, (272), 94 states have call successors, (94), 5 states have call predecessors, (94), 5 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2025-01-09 11:02:11,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 460 transitions. [2025-01-09 11:02:11,340 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 460 transitions. Word has length 172 [2025-01-09 11:02:11,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:02:11,341 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 460 transitions. [2025-01-09 11:02:11,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 11:02:11,341 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 460 transitions. [2025-01-09 11:02:11,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-01-09 11:02:11,347 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:02:11,347 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:02:11,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 11:02:11,347 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:02:11,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:02:11,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1537089903, now seen corresponding path program 1 times [2025-01-09 11:02:11,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:02:11,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290890203] [2025-01-09 11:02:11,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:02:11,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:02:11,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 11:02:11,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 11:02:11,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:02:11,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:02:11,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 11:02:11,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:02:11,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290890203] [2025-01-09 11:02:11,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290890203] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:02:11,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:02:11,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:02:11,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427038963] [2025-01-09 11:02:11,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:02:11,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:02:11,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:02:11,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:02:11,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:02:11,746 INFO L87 Difference]: Start difference. First operand 302 states and 460 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 11:02:11,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:02:11,967 INFO L93 Difference]: Finished difference Result 464 states and 713 transitions. [2025-01-09 11:02:11,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:02:11,968 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2025-01-09 11:02:11,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:02:11,975 INFO L225 Difference]: With dead ends: 464 [2025-01-09 11:02:11,975 INFO L226 Difference]: Without dead ends: 304 [2025-01-09 11:02:11,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:02:11,977 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 129 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:02:11,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 180 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:02:11,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-01-09 11:02:12,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2025-01-09 11:02:12,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 204 states have (on average 1.3431372549019607) internal successors, (274), 206 states have internal predecessors, (274), 94 states have call successors, (94), 5 states have call predecessors, (94), 5 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2025-01-09 11:02:12,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 462 transitions. [2025-01-09 11:02:12,048 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 462 transitions. Word has length 172 [2025-01-09 11:02:12,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:02:12,049 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 462 transitions. [2025-01-09 11:02:12,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 11:02:12,050 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 462 transitions. [2025-01-09 11:02:12,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-09 11:02:12,053 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:02:12,054 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:02:12,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 11:02:12,054 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:02:12,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:02:12,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1217586588, now seen corresponding path program 1 times [2025-01-09 11:02:12,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:02:12,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787157117] [2025-01-09 11:02:12,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:02:12,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:02:12,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 11:02:12,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 11:02:12,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:02:12,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 11:02:12,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [974575150] [2025-01-09 11:02:12,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:02:12,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:02:12,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:02:12,237 INFO L229 MonitoredProcess]: Starting monitored process 3 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 11:02:12,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 11:02:12,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 11:02:12,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 11:02:12,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:02:12,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:02:12,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 11:02:12,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:02:12,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 333 proven. 9 refuted. 0 times theorem prover too weak. 958 trivial. 0 not checked. [2025-01-09 11:02:12,666 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:02:13,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:02:13,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787157117] [2025-01-09 11:02:13,071 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 11:02:13,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974575150] [2025-01-09 11:02:13,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974575150] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:02:13,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 11:02:13,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-01-09 11:02:13,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808416256] [2025-01-09 11:02:13,071 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 11:02:13,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 11:02:13,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:02:13,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 11:02:13,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 11:02:13,073 INFO L87 Difference]: Start difference. First operand 304 states and 462 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 11:02:13,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:02:13,343 INFO L93 Difference]: Finished difference Result 550 states and 812 transitions. [2025-01-09 11:02:13,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 11:02:13,348 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 173 [2025-01-09 11:02:13,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:02:13,352 INFO L225 Difference]: With dead ends: 550 [2025-01-09 11:02:13,352 INFO L226 Difference]: Without dead ends: 324 [2025-01-09 11:02:13,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-09 11:02:13,354 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 72 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:02:13,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 223 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:02:13,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-01-09 11:02:13,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 308. [2025-01-09 11:02:13,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 205 states have (on average 1.2634146341463415) internal successors, (259), 207 states have internal predecessors, (259), 94 states have call successors, (94), 8 states have call predecessors, (94), 8 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2025-01-09 11:02:13,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 447 transitions. [2025-01-09 11:02:13,410 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 447 transitions. Word has length 173 [2025-01-09 11:02:13,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:02:13,410 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 447 transitions. [2025-01-09 11:02:13,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 11:02:13,411 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 447 transitions. [2025-01-09 11:02:13,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-09 11:02:13,412 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:02:13,412 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:02:13,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 11:02:13,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:02:13,613 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:02:13,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:02:13,614 INFO L85 PathProgramCache]: Analyzing trace with hash -2026933214, now seen corresponding path program 1 times [2025-01-09 11:02:13,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:02:13,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433347709] [2025-01-09 11:02:13,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:02:13,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:02:13,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 11:02:13,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 11:02:13,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:02:13,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 11:02:13,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [224728772] [2025-01-09 11:02:13,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:02:13,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:02:13,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:02:13,739 INFO L229 MonitoredProcess]: Starting monitored process 4 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 11:02:13,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 11:02:13,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 11:02:14,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 11:02:14,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:02:14,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 11:02:14,147 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 11:02:14,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 11:02:14,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 11:02:14,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:02:14,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 11:02:14,340 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 11:02:14,340 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 11:02:14,341 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 11:02:14,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 11:02:14,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:02:14,547 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-09 11:02:14,683 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 11:02:14,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 11:02:14 BoogieIcfgContainer [2025-01-09 11:02:14,687 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 11:02:14,688 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 11:02:14,688 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 11:02:14,688 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 11:02:14,690 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:02:08" (3/4) ... [2025-01-09 11:02:14,692 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 11:02:14,693 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 11:02:14,694 INFO L158 Benchmark]: Toolchain (without parser) took 6748.58ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 104.4MB in the beginning and 130.7MB in the end (delta: -26.3MB). Peak memory consumption was 139.2MB. Max. memory is 16.1GB. [2025-01-09 11:02:14,697 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:02:14,697 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.55ms. Allocated memory is still 142.6MB. Free memory was 104.4MB in the beginning and 89.1MB in the end (delta: 15.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 11:02:14,697 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.54ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 85.4MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:02:14,698 INFO L158 Benchmark]: Boogie Preprocessor took 62.36ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 81.6MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 11:02:14,698 INFO L158 Benchmark]: RCFGBuilder took 502.36ms. Allocated memory is still 142.6MB. Free memory was 81.6MB in the beginning and 55.5MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 11:02:14,698 INFO L158 Benchmark]: TraceAbstraction took 5837.21ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 54.6MB in the beginning and 130.8MB in the end (delta: -76.2MB). Peak memory consumption was 88.9MB. Max. memory is 16.1GB. [2025-01-09 11:02:14,698 INFO L158 Benchmark]: Witness Printer took 5.18ms. Allocated memory is still 302.0MB. Free memory was 130.8MB in the beginning and 130.7MB in the end (delta: 87.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 11:02:14,700 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.18ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 282.55ms. Allocated memory is still 142.6MB. Free memory was 104.4MB in the beginning and 89.1MB in the end (delta: 15.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.54ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 85.4MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 62.36ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 81.6MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 502.36ms. Allocated memory is still 142.6MB. Free memory was 81.6MB in the beginning and 55.5MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5837.21ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 54.6MB in the beginning and 130.8MB in the end (delta: -76.2MB). Peak memory consumption was 88.9MB. Max. memory is 16.1GB. * Witness Printer took 5.18ms. Allocated memory is still 302.0MB. Free memory was 130.8MB in the beginning and 130.7MB in the end (delta: 87.7kB). Peak memory consumption was 8.4MB. 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 shiftRight at line 67, overapproximation of someBinaryFLOATComparisonOperation at line 55, overapproximation of someBinaryFLOATComparisonOperation at line 144, overapproximation of someBinaryFLOATComparisonOperation at line 177, overapproximation of someBinaryFLOATComparisonOperation at line 146, overapproximation of someBinaryFLOATComparisonOperation at line 140, overapproximation of someBinaryFLOATComparisonOperation at line 151, overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of someBinaryFLOATComparisonOperation at line 152, overapproximation of someBinaryFLOATComparisonOperation at line 177, overapproximation of someBinaryFLOATComparisonOperation at line 142, overapproximation of someBinaryArithmeticFLOAToperation at line 94. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 3.9; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] float var_1_4 = 31.5; [L26] float var_1_5 = 25.4; [L27] float var_1_6 = 9.5; [L28] float var_1_7 = 63.2; [L29] unsigned long int var_1_8 = 1; [L30] signed short int var_1_10 = -50; [L31] unsigned long int var_1_11 = 8; [L32] unsigned char var_1_12 = 32; [L33] float var_1_13 = 15.625; [L34] unsigned char var_1_14 = 1; [L35] unsigned char var_1_15 = 0; [L36] unsigned char var_1_16 = 1; [L37] unsigned char var_1_17 = 1; [L38] unsigned char var_1_19 = 0; [L39] unsigned char var_1_20 = 8; [L40] unsigned short int var_1_21 = 16; [L41] unsigned short int var_1_22 = 128; [L42] signed short int var_1_23 = 128; [L43] unsigned short int var_1_25 = 32; [L44] unsigned char var_1_29 = 1; [L45] unsigned long int var_1_31 = 0; [L46] unsigned char var_1_32 = 1; [L47] unsigned short int var_1_33 = 1000; [L48] signed char var_1_38 = 25; [L49] unsigned short int var_1_39 = 200; [L50] unsigned char var_1_43 = 10; [L51] unsigned char var_1_47 = 0; VAL [isInitial=0, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=0, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L181] isInitial = 1 [L182] FCALL initially() [L184] FCALL updateLastVariables() [L185] CALL updateVariables() [L133] var_1_2 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L134] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L135] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L135] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L136] var_1_3 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L137] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L138] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L138] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L139] var_1_4 = __VERIFIER_nondet_float() [L140] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L140] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L141] var_1_5 = __VERIFIER_nondet_float() [L142] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L142] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L143] var_1_6 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_7=316/5, var_1_8=1] [L144] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_7=316/5, var_1_8=1] [L145] var_1_7 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L146] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L147] var_1_11 = __VERIFIER_nondet_ulong() [L148] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L148] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L149] CALL assume_abort_if_not(var_1_11 <= 33) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L149] RET assume_abort_if_not(var_1_11 <= 33) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L150] var_1_13 = __VERIFIER_nondet_float() [L151] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L151] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L152] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L152] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L153] var_1_15 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L154] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L155] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L155] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L156] var_1_16 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L157] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L158] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L158] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L159] var_1_17 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L160] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L161] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L161] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L162] var_1_19 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L163] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L164] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L164] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L165] var_1_33 = __VERIFIER_nondet_ushort() [L166] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L166] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L167] CALL assume_abort_if_not(var_1_33 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L167] RET assume_abort_if_not(var_1_33 <= 65535) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L168] CALL assume_abort_if_not(var_1_33 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L168] RET assume_abort_if_not(var_1_33 != 0) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L169] var_1_39 = __VERIFIER_nondet_ushort() [L170] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=15, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=15, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L170] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=15, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L171] CALL assume_abort_if_not(var_1_39 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=15, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=15, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L171] RET assume_abort_if_not(var_1_39 <= 65535) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=15, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L172] CALL assume_abort_if_not(var_1_39 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L172] RET assume_abort_if_not(var_1_39 != 0) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L185] RET updateVariables() [L186] CALL step() [L55] COND TRUE var_1_6 == (var_1_4 / var_1_13) [L56] var_1_12 = var_1_11 VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=-21474836464, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L58] var_1_47 = var_1_11 [L59] var_1_20 = var_1_11 VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=-21474836464, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=-21474836464, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=-21474836464, var_1_8=1] [L60] COND TRUE var_1_11 >= var_1_21 [L61] var_1_31 = ((((var_1_21) > (((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12))))) ? (var_1_21) : (((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))))) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=-21474836464, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=-21474836464, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=-21474836464, var_1_8=1] [L63] COND TRUE ((((var_1_21) < (var_1_33)) ? (var_1_21) : (var_1_33))) < (var_1_39 + var_1_11) [L64] var_1_43 = ((((var_1_11) < ((((((100 + var_1_11)) > (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? ((100 + var_1_11)) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))))) ? (var_1_11) : ((((((100 + var_1_11)) > (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? ((100 + var_1_11)) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))))))) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=-21474836464, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=-21474836464, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-21474836464, var_1_47=-21474836464, var_1_8=1] [L66] var_1_21 = 8 VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=-21474836464, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=-21474836464, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-21474836464, var_1_47=-21474836464, var_1_8=1] [L67] EXPR 2u >> var_1_11 VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=-21474836464, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=-21474836464, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-21474836464, var_1_47=-21474836464, var_1_8=1] [L67] COND FALSE !((var_1_21 + var_1_12) > (2u >> var_1_11)) [L74] COND FALSE !(var_1_11 < var_1_11) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=-21474836464, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=-21474836464, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-21474836464, var_1_47=-21474836464, var_1_8=1] [L79] COND FALSE !(! var_1_2) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=-21474836464, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=-21474836464, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-21474836464, var_1_47=-21474836464, var_1_8=1] [L90] unsigned char stepLocal_1 = var_1_14; [L91] unsigned char stepLocal_0 = var_1_14; VAL [isInitial=1, stepLocal_0=1, stepLocal_1=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=-21474836464, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=-21474836464, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-21474836464, var_1_47=-21474836464, var_1_8=1] [L92] COND TRUE var_1_14 || stepLocal_0 VAL [isInitial=1, stepLocal_1=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=-21474836464, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=-21474836464, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-21474836464, var_1_47=-21474836464, var_1_8=1] [L93] COND TRUE stepLocal_1 || var_1_14 [L94] var_1_1 = (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=-21474836464, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=-21474836464, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-21474836464, var_1_47=-21474836464, var_1_8=1] [L101] COND FALSE !(var_1_6 > (- var_1_7)) [L106] var_1_8 = var_1_20 VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=-21474836464, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=-21474836464, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-21474836464, var_1_47=-21474836464, var_1_8=16] [L108] var_1_22 = var_1_8 [L109] var_1_23 = var_1_12 [L110] var_1_29 = var_1_19 VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=-21474836464, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=-21474836464, var_1_21=8, var_1_22=16, var_1_23=16, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-21474836464, var_1_47=-21474836464, var_1_8=16] [L111] COND FALSE !(var_1_12 < (~ (var_1_12 / var_1_33))) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=-21474836464, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=-21474836464, var_1_21=8, var_1_22=16, var_1_23=16, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-21474836464, var_1_47=-21474836464, var_1_8=16] [L120] COND FALSE !(var_1_12 < (var_1_12 / var_1_33)) [L123] var_1_32 = ((! var_1_19) && var_1_15) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=-21474836464, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=-21474836464, var_1_21=8, var_1_22=16, var_1_23=16, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-21474836464, var_1_47=-21474836464, var_1_8=16] [L126] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=-21474836464, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=-21474836464, var_1_21=8, var_1_22=16, var_1_23=16, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-21474836464, var_1_47=-21474836464, var_1_8=16] [L186] RET step() [L187] CALL, EXPR property() [L177] EXPR (((var_1_14 || var_1_14) ? ((var_1_14 || var_1_14) ? (var_1_1 == ((float) (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7))) : (var_1_1 == ((float) 1.0000000075E8f))) : (var_1_1 == ((float) var_1_7))) && ((var_1_6 > (- var_1_7)) ? ((var_1_5 == (((((var_1_6 * var_1_7)) > (var_1_1)) ? ((var_1_6 * var_1_7)) : (var_1_1)))) ? (var_1_8 == ((unsigned long int) 8u)) : 1) : (var_1_8 == ((unsigned long int) var_1_20)))) && (((var_1_21 + var_1_12) > (2u >> var_1_11)) ? ((var_1_12 != var_1_21) ? (var_1_10 == ((signed short int) var_1_11)) : (var_1_10 == ((signed short int) 128))) : 1) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=-21474836464, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=-21474836464, var_1_21=8, var_1_22=16, var_1_23=16, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-21474836464, var_1_47=-21474836464, var_1_8=16] [L177-L178] return ((((((((var_1_14 || var_1_14) ? ((var_1_14 || var_1_14) ? (var_1_1 == ((float) (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7))) : (var_1_1 == ((float) 1.0000000075E8f))) : (var_1_1 == ((float) var_1_7))) && ((var_1_6 > (- var_1_7)) ? ((var_1_5 == (((((var_1_6 * var_1_7)) > (var_1_1)) ? ((var_1_6 * var_1_7)) : (var_1_1)))) ? (var_1_8 == ((unsigned long int) 8u)) : 1) : (var_1_8 == ((unsigned long int) var_1_20)))) && (((var_1_21 + var_1_12) > (2u >> var_1_11)) ? ((var_1_12 != var_1_21) ? (var_1_10 == ((signed short int) var_1_11)) : (var_1_10 == ((signed short int) 128))) : 1)) && ((var_1_6 == (var_1_4 / var_1_13)) ? (var_1_12 == ((unsigned char) var_1_11)) : 1)) && ((! var_1_2) ? ((var_1_2 || var_1_3) ? (var_1_14 == ((unsigned char) ((! (! var_1_15)) && (var_1_16 && var_1_17)))) : ((((((var_1_12) > (var_1_12)) ? (var_1_12) : (var_1_12))) >= var_1_21) ? (var_1_14 == ((unsigned char) (var_1_2 || var_1_16))) : (var_1_14 == ((unsigned char) (! var_1_19))))) : 1)) && (var_1_20 == ((unsigned char) var_1_11))) && (var_1_21 == ((unsigned short int) 8))) && (var_1_22 == ((unsigned short int) var_1_8)) ; [L187] RET, EXPR property() [L187] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=-21474836464, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=-21474836464, var_1_21=8, var_1_22=16, var_1_23=16, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-21474836464, var_1_47=-21474836464, var_1_8=16] [L19] reach_error() VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=-21474836464, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=-21474836464, var_1_21=8, var_1_22=16, var_1_23=16, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-21474836464, var_1_47=-21474836464, var_1_8=16] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 6, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 462 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 442 mSDsluCounter, 1364 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 709 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 326 IncrementalHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 655 mSDtfsCounter, 326 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 391 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=308occurred in iteration=5, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 5 MinimizatonAttempts, 26 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1549 NumberOfCodeBlocks, 1549 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1024 ConstructedInterpolants, 0 QuantifiedInterpolants, 1731 SizeOfPredicates, 2 NumberOfNonLiveVariables, 790 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 7741/7800 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 11:02:14,726 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_fillercodestructure_filler-pr-ci_file-27.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 b198c2e9899cdd18ef24e3a73621a4aef3e13c5394aa42c7346238e62ac07c4d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:02:17,109 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:02:17,209 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 11:02:17,219 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:02:17,220 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:02:17,251 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:02:17,253 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:02:17,253 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:02:17,254 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:02:17,254 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:02:17,254 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:02:17,254 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:02:17,254 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:02:17,255 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:02:17,256 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:02:17,256 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:02:17,256 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:02:17,256 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:02:17,256 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:02:17,256 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:02:17,256 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:02:17,256 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:02:17,256 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:02:17,257 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 11:02:17,257 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 11:02:17,257 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 11:02:17,257 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:02:17,257 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:02:17,257 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:02:17,257 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:02:17,257 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:02:17,257 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:02:17,257 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:02:17,257 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:02:17,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:02:17,258 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:02:17,258 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:02:17,258 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:02:17,259 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:02:17,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:02:17,259 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:02:17,259 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:02:17,259 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:02:17,259 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:02:17,259 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 11:02:17,260 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 11:02:17,260 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:02:17,260 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:02:17,260 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:02:17,260 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:02:17,260 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 -> b198c2e9899cdd18ef24e3a73621a4aef3e13c5394aa42c7346238e62ac07c4d [2025-01-09 11:02:17,563 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:02:17,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:02:17,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:02:17,574 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:02:17,575 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:02:17,577 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-27.i [2025-01-09 11:02:18,987 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/71a2a3f63/ec65f0d58fb045598514ca6fa256bdb1/FLAG2915c1c13 [2025-01-09 11:02:19,262 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:02:19,265 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-27.i [2025-01-09 11:02:19,275 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/71a2a3f63/ec65f0d58fb045598514ca6fa256bdb1/FLAG2915c1c13 [2025-01-09 11:02:19,558 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/71a2a3f63/ec65f0d58fb045598514ca6fa256bdb1 [2025-01-09 11:02:19,560 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:02:19,561 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:02:19,562 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:02:19,563 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:02:19,566 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:02:19,567 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:02:19" (1/1) ... [2025-01-09 11:02:19,567 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12e52d7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:02:19, skipping insertion in model container [2025-01-09 11:02:19,567 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:02:19" (1/1) ... [2025-01-09 11:02:19,584 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:02:19,708 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_fillercodestructure_filler-pr-ci_file-27.i[919,932] [2025-01-09 11:02:19,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:02:19,779 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:02:19,788 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_fillercodestructure_filler-pr-ci_file-27.i[919,932] [2025-01-09 11:02:19,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:02:19,844 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:02:19,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:02:19 WrapperNode [2025-01-09 11:02:19,846 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:02:19,847 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:02:19,848 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:02:19,848 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:02:19,853 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:02:19" (1/1) ... [2025-01-09 11:02:19,866 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:02:19" (1/1) ... [2025-01-09 11:02:19,903 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 176 [2025-01-09 11:02:19,904 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:02:19,904 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:02:19,904 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:02:19,904 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:02:19,922 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:02:19" (1/1) ... [2025-01-09 11:02:19,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:02:19" (1/1) ... [2025-01-09 11:02:19,927 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:02:19" (1/1) ... [2025-01-09 11:02:19,950 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 11:02:19,950 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:02:19" (1/1) ... [2025-01-09 11:02:19,951 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:02:19" (1/1) ... [2025-01-09 11:02:19,967 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:02:19" (1/1) ... [2025-01-09 11:02:19,971 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:02:19" (1/1) ... [2025-01-09 11:02:19,974 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:02:19" (1/1) ... [2025-01-09 11:02:19,979 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:02:19" (1/1) ... [2025-01-09 11:02:19,980 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:02:19" (1/1) ... [2025-01-09 11:02:19,989 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:02:19,989 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:02:19,990 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:02:19,990 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:02:19,991 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:02:19" (1/1) ... [2025-01-09 11:02:19,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:02:20,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:02:20,024 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 11:02:20,028 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 11:02:20,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:02:20,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 11:02:20,052 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:02:20,052 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:02:20,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:02:20,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:02:20,142 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:02:20,144 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:02:26,099 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 11:02:26,100 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:02:26,108 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:02:26,110 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:02:26,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:02:26 BoogieIcfgContainer [2025-01-09 11:02:26,110 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:02:26,113 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:02:26,113 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:02:26,117 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:02:26,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:02:19" (1/3) ... [2025-01-09 11:02:26,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ed60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:02:26, skipping insertion in model container [2025-01-09 11:02:26,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:02:19" (2/3) ... [2025-01-09 11:02:26,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ed60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:02:26, skipping insertion in model container [2025-01-09 11:02:26,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:02:26" (3/3) ... [2025-01-09 11:02:26,119 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-27.i [2025-01-09 11:02:26,130 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:02:26,133 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-27.i that has 2 procedures, 82 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:02:26,189 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:02:26,198 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;@4d114235, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:02:26,199 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:02:26,202 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 54 states have internal predecessors, (77), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 11:02:26,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 11:02:26,213 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:02:26,214 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:02:26,214 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:02:26,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:02:26,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1620841004, now seen corresponding path program 1 times [2025-01-09 11:02:26,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:02:26,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [161083892] [2025-01-09 11:02:26,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:02:26,226 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 11:02:26,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:02:26,229 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 11:02:26,230 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 11:02:26,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 11:02:26,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 11:02:26,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:02:26,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:02:26,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 11:02:26,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:02:26,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2025-01-09 11:02:26,725 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:02:26,726 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:02:26,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [161083892] [2025-01-09 11:02:26,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [161083892] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:02:26,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:02:26,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 11:02:26,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234083952] [2025-01-09 11:02:26,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:02:26,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 11:02:26,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:02:26,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 11:02:26,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:02:26,753 INFO L87 Difference]: Start difference. First operand has 82 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 54 states have internal predecessors, (77), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 11:02:26,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:02:26,782 INFO L93 Difference]: Finished difference Result 155 states and 273 transitions. [2025-01-09 11:02:26,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 11:02:26,784 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 168 [2025-01-09 11:02:26,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:02:26,792 INFO L225 Difference]: With dead ends: 155 [2025-01-09 11:02:26,792 INFO L226 Difference]: Without dead ends: 76 [2025-01-09 11:02:26,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 167 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 11:02:26,798 INFO L435 NwaCegarLoop]: 114 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, 114 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 11:02:26,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:02:26,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-01-09 11:02:26,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-01-09 11:02:26,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 48 states have internal predecessors, (62), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 11:02:26,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 114 transitions. [2025-01-09 11:02:26,840 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 114 transitions. Word has length 168 [2025-01-09 11:02:26,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:02:26,841 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 114 transitions. [2025-01-09 11:02:26,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 11:02:26,841 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 114 transitions. [2025-01-09 11:02:26,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 11:02:26,844 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:02:26,844 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:02:26,858 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 11:02:27,045 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 11:02:27,045 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:02:27,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:02:27,046 INFO L85 PathProgramCache]: Analyzing trace with hash 187157344, now seen corresponding path program 1 times [2025-01-09 11:02:27,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:02:27,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214962778] [2025-01-09 11:02:27,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:02:27,047 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 11:02:27,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:02:27,051 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 11:02:27,052 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 11:02:27,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 11:02:27,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 11:02:27,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:02:27,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:02:27,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 11:02:27,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:02:28,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 619 proven. 48 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2025-01-09 11:02:28,205 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:02:28,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 11:02:28,574 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:02:28,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1214962778] [2025-01-09 11:02:28,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1214962778] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 11:02:28,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 11:02:28,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-01-09 11:02:28,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489779057] [2025-01-09 11:02:28,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:02:28,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:02:28,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:02:28,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:02:28,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 11:02:28,577 INFO L87 Difference]: Start difference. First operand 76 states and 114 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 11:02:30,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:02:30,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:02:30,274 INFO L93 Difference]: Finished difference Result 153 states and 228 transitions. [2025-01-09 11:02:30,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:02:30,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 168 [2025-01-09 11:02:30,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:02:30,303 INFO L225 Difference]: With dead ends: 153 [2025-01-09 11:02:30,303 INFO L226 Difference]: Without dead ends: 80 [2025-01-09 11:02:30,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 11:02:30,304 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 59 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 11:02:30,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 148 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 11:02:30,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-01-09 11:02:30,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-01-09 11:02:30,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 51 states have (on average 1.2549019607843137) internal successors, (64), 51 states have internal predecessors, (64), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 11:02:30,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 116 transitions. [2025-01-09 11:02:30,316 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 116 transitions. Word has length 168 [2025-01-09 11:02:30,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:02:30,317 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 116 transitions. [2025-01-09 11:02:30,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 11:02:30,317 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 116 transitions. [2025-01-09 11:02:30,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 11:02:30,319 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:02:30,319 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:02:30,335 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 11:02:30,520 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 11:02:30,520 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:02:30,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:02:30,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1605571867, now seen corresponding path program 1 times [2025-01-09 11:02:30,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:02:30,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [296874177] [2025-01-09 11:02:30,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:02:30,522 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 11:02:30,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:02:30,524 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 11:02:30,525 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 11:02:30,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 11:02:30,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 11:02:30,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:02:30,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:02:30,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 11:02:30,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:02:31,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 11:02:31,708 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:02:31,708 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:02:31,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [296874177] [2025-01-09 11:02:31,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [296874177] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:02:31,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:02:31,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:02:31,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374980118] [2025-01-09 11:02:31,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:02:31,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:02:31,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:02:31,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:02:31,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:02:31,710 INFO L87 Difference]: Start difference. First operand 80 states and 116 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 11:02:34,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:02:34,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:02:34,863 INFO L93 Difference]: Finished difference Result 234 states and 342 transitions. [2025-01-09 11:02:34,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:02:34,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169 [2025-01-09 11:02:34,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:02:34,895 INFO L225 Difference]: With dead ends: 234 [2025-01-09 11:02:34,895 INFO L226 Difference]: Without dead ends: 157 [2025-01-09 11:02:34,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 166 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 11:02:34,896 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 25 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:02:34,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 348 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-01-09 11:02:34,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-01-09 11:02:34,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2025-01-09 11:02:34,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 96 states have (on average 1.2291666666666667) internal successors, (118), 96 states have internal predecessors, (118), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 11:02:34,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 222 transitions. [2025-01-09 11:02:34,918 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 222 transitions. Word has length 169 [2025-01-09 11:02:34,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:02:34,922 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 222 transitions. [2025-01-09 11:02:34,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 11:02:34,923 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 222 transitions. [2025-01-09 11:02:34,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-01-09 11:02:34,925 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:02:34,925 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:02:34,939 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 (4)] Ended with exit code 0 [2025-01-09 11:02:35,125 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 11:02:35,126 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:02:35,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:02:35,127 INFO L85 PathProgramCache]: Analyzing trace with hash -344123931, now seen corresponding path program 1 times [2025-01-09 11:02:35,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:02:35,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1119663990] [2025-01-09 11:02:35,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:02:35,127 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 11:02:35,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:02:35,129 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 11:02:35,130 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 11:02:35,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 11:02:35,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 11:02:35,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:02:35,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:02:35,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 11:02:35,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:02:37,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 788 proven. 90 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2025-01-09 11:02:37,325 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:02:39,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 117 proven. 99 refuted. 0 times theorem prover too weak. 1084 trivial. 0 not checked. [2025-01-09 11:02:39,197 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:02:39,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1119663990] [2025-01-09 11:02:39,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1119663990] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 11:02:39,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 11:02:39,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2025-01-09 11:02:39,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510530941] [2025-01-09 11:02:39,198 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 11:02:39,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 11:02:39,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:02:39,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 11:02:39,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2025-01-09 11:02:39,199 INFO L87 Difference]: Start difference. First operand 153 states and 222 transitions. Second operand has 21 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 21 states have internal predecessors, (73), 4 states have call successors, (39), 4 states have call predecessors, (39), 10 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) [2025-01-09 11:02:45,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.81s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:02:48,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:02:48,054 INFO L93 Difference]: Finished difference Result 399 states and 546 transitions. [2025-01-09 11:02:48,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-01-09 11:02:48,055 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 21 states have internal predecessors, (73), 4 states have call successors, (39), 4 states have call predecessors, (39), 10 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) Word has length 170 [2025-01-09 11:02:48,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:02:48,060 INFO L225 Difference]: With dead ends: 399 [2025-01-09 11:02:48,063 INFO L226 Difference]: Without dead ends: 322 [2025-01-09 11:02:48,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 323 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 627 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=620, Invalid=1830, Unknown=0, NotChecked=0, Total=2450 [2025-01-09 11:02:48,065 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 201 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:02:48,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 680 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2025-01-09 11:02:48,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-01-09 11:02:48,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 287. [2025-01-09 11:02:48,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 180 states have (on average 1.1722222222222223) internal successors, (211), 181 states have internal predecessors, (211), 90 states have call successors, (90), 16 states have call predecessors, (90), 16 states have return successors, (90), 89 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 11:02:48,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 391 transitions. [2025-01-09 11:02:48,124 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 391 transitions. Word has length 170 [2025-01-09 11:02:48,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:02:48,126 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 391 transitions. [2025-01-09 11:02:48,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 21 states have internal predecessors, (73), 4 states have call successors, (39), 4 states have call predecessors, (39), 10 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) [2025-01-09 11:02:48,127 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 391 transitions. [2025-01-09 11:02:48,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-01-09 11:02:48,130 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:02:48,130 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:02:48,147 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 11:02:48,331 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 11:02:48,331 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:02:48,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:02:48,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1572277646, now seen corresponding path program 1 times [2025-01-09 11:02:48,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:02:48,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2077040723] [2025-01-09 11:02:48,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:02:48,332 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 11:02:48,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:02:48,336 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 11:02:48,338 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 11:02:48,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 11:02:48,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 11:02:48,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:02:48,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:02:48,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 11:02:48,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:02:52,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 46 proven. 576 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2025-01-09 11:02:52,768 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:02:53,505 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:02:53,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2077040723] [2025-01-09 11:02:53,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2077040723] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:02:53,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [871267705] [2025-01-09 11:02:53,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:02:53,505 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 11:02:53,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 11:02:53,526 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 11:02:53,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2025-01-09 11:02:53,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 11:02:54,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 11:02:54,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:02:54,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:02:54,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-09 11:02:54,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:03:36,971 WARN L286 SmtUtils]: Spent 9.08s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)