./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-70.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-pe-co_file-70.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 29f3b33aa76fbd79b42fdd0c3fff670150c31cac386cea2ae8894bfbaea7ba77 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:55:36,709 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:55:36,760 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 10:55:36,764 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:55:36,764 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:55:36,785 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:55:36,785 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:55:36,785 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:55:36,786 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:55:36,786 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:55:36,786 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:55:36,786 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:55:36,786 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:55:36,786 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:55:36,786 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:55:36,786 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:55:36,786 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:55:36,786 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:55:36,786 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:55:36,786 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:55:36,786 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:55:36,787 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:55:36,787 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:55:36,787 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:55:36,787 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:55:36,787 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:55:36,787 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:55:36,787 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:55:36,787 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:55:36,787 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:55:36,787 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:55:36,787 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:55:36,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:55:36,787 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:55:36,787 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:55:36,787 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:55:36,787 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:55:36,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:55:36,787 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:55:36,787 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:55:36,787 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:55:36,788 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:55:36,788 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:55:36,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:55:36,788 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:55:36,788 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:55:36,788 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:55:36,788 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:55:36,788 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 -> 29f3b33aa76fbd79b42fdd0c3fff670150c31cac386cea2ae8894bfbaea7ba77 [2025-01-09 10:55:37,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:55:37,013 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:55:37,015 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:55:37,016 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:55:37,016 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:55:37,017 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-pe-co_file-70.i [2025-01-09 10:55:38,117 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cad24ce89/763c19b36d474953bddc2e02f335bd12/FLAG15beb2c04 [2025-01-09 10:55:38,318 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:55:38,318 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-70.i [2025-01-09 10:55:38,323 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cad24ce89/763c19b36d474953bddc2e02f335bd12/FLAG15beb2c04 [2025-01-09 10:55:38,333 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cad24ce89/763c19b36d474953bddc2e02f335bd12 [2025-01-09 10:55:38,336 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:55:38,337 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:55:38,338 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:55:38,338 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:55:38,341 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:55:38,342 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:55:38" (1/1) ... [2025-01-09 10:55:38,342 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4765a439 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:55:38, skipping insertion in model container [2025-01-09 10:55:38,342 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:55:38" (1/1) ... [2025-01-09 10:55:38,355 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:55:38,452 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-pe-co_file-70.i[919,932] [2025-01-09 10:55:38,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:55:38,529 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:55:38,538 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-pe-co_file-70.i[919,932] [2025-01-09 10:55:38,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:55:38,581 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:55:38,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:55:38 WrapperNode [2025-01-09 10:55:38,581 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:55:38,582 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:55:38,582 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:55:38,582 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:55:38,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:55:38" (1/1) ... [2025-01-09 10:55:38,593 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:55:38" (1/1) ... [2025-01-09 10:55:38,623 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 201 [2025-01-09 10:55:38,623 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:55:38,624 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:55:38,624 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:55:38,624 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:55:38,630 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:55:38" (1/1) ... [2025-01-09 10:55:38,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:55:38" (1/1) ... [2025-01-09 10:55:38,633 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:55:38" (1/1) ... [2025-01-09 10:55:38,651 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 10:55:38,651 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:55:38" (1/1) ... [2025-01-09 10:55:38,651 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:55:38" (1/1) ... [2025-01-09 10:55:38,663 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:55:38" (1/1) ... [2025-01-09 10:55:38,664 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:55:38" (1/1) ... [2025-01-09 10:55:38,672 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:55:38" (1/1) ... [2025-01-09 10:55:38,673 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:55:38" (1/1) ... [2025-01-09 10:55:38,679 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:55:38" (1/1) ... [2025-01-09 10:55:38,681 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:55:38,684 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:55:38,684 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:55:38,684 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:55:38,685 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:55:38" (1/1) ... [2025-01-09 10:55:38,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:55:38,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:55:38,709 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 10:55:38,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 10:55:38,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:55:38,727 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:55:38,727 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:55:38,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:55:38,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:55:38,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:55:38,786 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:55:38,787 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:55:39,118 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-09 10:55:39,118 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:55:39,128 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:55:39,129 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:55:39,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:55:39 BoogieIcfgContainer [2025-01-09 10:55:39,129 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:55:39,131 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:55:39,131 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:55:39,134 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:55:39,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:55:38" (1/3) ... [2025-01-09 10:55:39,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50efcdfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:55:39, skipping insertion in model container [2025-01-09 10:55:39,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:55:38" (2/3) ... [2025-01-09 10:55:39,136 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50efcdfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:55:39, skipping insertion in model container [2025-01-09 10:55:39,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:55:39" (3/3) ... [2025-01-09 10:55:39,137 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-70.i [2025-01-09 10:55:39,152 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:55:39,153 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-70.i that has 2 procedures, 85 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:55:39,201 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:55:39,211 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;@7e5ae90c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:55:39,211 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:55:39,215 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 57 states have (on average 1.456140350877193) internal successors, (83), 58 states have internal predecessors, (83), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-09 10:55:39,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 10:55:39,224 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:55:39,225 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:55:39,225 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:55:39,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:55:39,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1924299250, now seen corresponding path program 1 times [2025-01-09 10:55:39,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:55:39,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590473483] [2025-01-09 10:55:39,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:55:39,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:55:39,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 10:55:39,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 10:55:39,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:55:39,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:55:39,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-01-09 10:55:39,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:55:39,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590473483] [2025-01-09 10:55:39,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590473483] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:55:39,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535307566] [2025-01-09 10:55:39,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:55:39,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:55:39,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:55:39,500 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 10:55:39,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 10:55:39,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 10:55:39,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 10:55:39,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:55:39,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:55:39,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:55:39,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:55:39,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-01-09 10:55:39,680 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:55:39,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535307566] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:55:39,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:55:39,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:55:39,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954235326] [2025-01-09 10:55:39,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:55:39,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:55:39,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:55:39,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:55:39,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:55:39,705 INFO L87 Difference]: Start difference. First operand has 85 states, 57 states have (on average 1.456140350877193) internal successors, (83), 58 states have internal predecessors, (83), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 10:55:39,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:55:39,726 INFO L93 Difference]: Finished difference Result 164 states and 286 transitions. [2025-01-09 10:55:39,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:55:39,728 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 164 [2025-01-09 10:55:39,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:55:39,733 INFO L225 Difference]: With dead ends: 164 [2025-01-09 10:55:39,734 INFO L226 Difference]: Without dead ends: 82 [2025-01-09 10:55:39,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:55:39,738 INFO L435 NwaCegarLoop]: 126 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, 126 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:55:39,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:55:39,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-09 10:55:39,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-01-09 10:55:39,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 55 states have internal predecessors, (76), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-09 10:55:39,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 126 transitions. [2025-01-09 10:55:39,768 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 126 transitions. Word has length 164 [2025-01-09 10:55:39,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:55:39,768 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 126 transitions. [2025-01-09 10:55:39,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 10:55:39,768 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 126 transitions. [2025-01-09 10:55:39,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 10:55:39,770 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:55:39,770 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:55:39,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 10:55:39,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 10:55:39,971 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:55:39,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:55:39,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1248294900, now seen corresponding path program 1 times [2025-01-09 10:55:39,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:55:39,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415679023] [2025-01-09 10:55:39,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:55:39,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:55:39,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 10:55:40,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 10:55:40,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:55:40,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:55:40,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-01-09 10:55:40,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:55:40,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415679023] [2025-01-09 10:55:40,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415679023] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:55:40,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:55:40,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:55:40,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211195786] [2025-01-09 10:55:40,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:55:40,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:55:40,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:55:40,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:55:40,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:55:40,188 INFO L87 Difference]: Start difference. First operand 82 states and 126 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 10:55:40,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:55:40,279 INFO L93 Difference]: Finished difference Result 230 states and 354 transitions. [2025-01-09 10:55:40,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:55:40,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 164 [2025-01-09 10:55:40,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:55:40,283 INFO L225 Difference]: With dead ends: 230 [2025-01-09 10:55:40,284 INFO L226 Difference]: Without dead ends: 151 [2025-01-09 10:55:40,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:55:40,287 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 112 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:55:40,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 309 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:55:40,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-01-09 10:55:40,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2025-01-09 10:55:40,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 96 states have (on average 1.3333333333333333) internal successors, (128), 96 states have internal predecessors, (128), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 10:55:40,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 228 transitions. [2025-01-09 10:55:40,308 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 228 transitions. Word has length 164 [2025-01-09 10:55:40,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:55:40,309 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 228 transitions. [2025-01-09 10:55:40,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 10:55:40,309 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 228 transitions. [2025-01-09 10:55:40,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 10:55:40,313 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:55:40,313 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:55:40,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:55:40,314 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:55:40,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:55:40,314 INFO L85 PathProgramCache]: Analyzing trace with hash 661488886, now seen corresponding path program 1 times [2025-01-09 10:55:40,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:55:40,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384677472] [2025-01-09 10:55:40,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:55:40,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:55:40,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 10:55:40,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 10:55:40,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:55:40,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:55:40,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-01-09 10:55:40,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:55:40,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384677472] [2025-01-09 10:55:40,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384677472] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:55:40,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:55:40,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:55:40,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570391565] [2025-01-09 10:55:40,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:55:40,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:55:40,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:55:40,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:55:40,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:55:40,753 INFO L87 Difference]: Start difference. First operand 149 states and 228 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 10:55:40,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:55:40,844 INFO L93 Difference]: Finished difference Result 408 states and 614 transitions. [2025-01-09 10:55:40,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:55:40,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 164 [2025-01-09 10:55:40,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:55:40,847 INFO L225 Difference]: With dead ends: 408 [2025-01-09 10:55:40,847 INFO L226 Difference]: Without dead ends: 262 [2025-01-09 10:55:40,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 10:55:40,848 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 142 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:55:40,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 304 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:55:40,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-01-09 10:55:40,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 221. [2025-01-09 10:55:40,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 160 states have (on average 1.3875) internal successors, (222), 162 states have internal predecessors, (222), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 10:55:40,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 334 transitions. [2025-01-09 10:55:40,883 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 334 transitions. Word has length 164 [2025-01-09 10:55:40,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:55:40,884 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 334 transitions. [2025-01-09 10:55:40,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 10:55:40,884 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 334 transitions. [2025-01-09 10:55:40,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 10:55:40,888 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:55:40,888 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:55:40,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:55:40,888 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:55:40,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:55:40,889 INFO L85 PathProgramCache]: Analyzing trace with hash -349628364, now seen corresponding path program 1 times [2025-01-09 10:55:40,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:55:40,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140001518] [2025-01-09 10:55:40,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:55:40,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:55:40,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 10:55:41,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 10:55:41,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:55:41,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:55:41,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 33 proven. 39 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-01-09 10:55:41,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:55:41,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140001518] [2025-01-09 10:55:41,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140001518] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:55:41,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237914179] [2025-01-09 10:55:41,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:55:41,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:55:41,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:55:41,875 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 10:55:41,877 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 10:55:41,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 10:55:41,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 10:55:41,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:55:41,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:55:42,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 10:55:42,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:55:43,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 633 proven. 72 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2025-01-09 10:55:43,235 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:55:44,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 66 proven. 75 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2025-01-09 10:55:44,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237914179] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 10:55:44,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 10:55:44,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 12] total 28 [2025-01-09 10:55:44,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406234617] [2025-01-09 10:55:44,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 10:55:44,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 10:55:44,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:55:44,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 10:55:44,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2025-01-09 10:55:44,417 INFO L87 Difference]: Start difference. First operand 221 states and 334 transitions. Second operand has 28 states, 27 states have (on average 4.074074074074074) internal successors, (110), 26 states have internal predecessors, (110), 8 states have call successors, (75), 4 states have call predecessors, (75), 8 states have return successors, (75), 8 states have call predecessors, (75), 8 states have call successors, (75) [2025-01-09 10:55:49,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 10:55:58,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 10:56:01,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:56:01,168 INFO L93 Difference]: Finished difference Result 1332 states and 1945 transitions. [2025-01-09 10:56:01,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2025-01-09 10:56:01,169 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.074074074074074) internal successors, (110), 26 states have internal predecessors, (110), 8 states have call successors, (75), 4 states have call predecessors, (75), 8 states have return successors, (75), 8 states have call predecessors, (75), 8 states have call successors, (75) Word has length 164 [2025-01-09 10:56:01,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:56:01,175 INFO L225 Difference]: With dead ends: 1332 [2025-01-09 10:56:01,176 INFO L226 Difference]: Without dead ends: 1114 [2025-01-09 10:56:01,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3200 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1862, Invalid=7644, Unknown=0, NotChecked=0, Total=9506 [2025-01-09 10:56:01,179 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 1408 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 2405 mSolverCounterSat, 865 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1410 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 3272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 865 IncrementalHoareTripleChecker+Valid, 2405 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:56:01,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1410 Valid, 1180 Invalid, 3272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [865 Valid, 2405 Invalid, 2 Unknown, 0 Unchecked, 12.4s Time] [2025-01-09 10:56:01,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2025-01-09 10:56:01,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 699. [2025-01-09 10:56:01,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 491 states have (on average 1.3421588594704685) internal successors, (659), 498 states have internal predecessors, (659), 185 states have call successors, (185), 22 states have call predecessors, (185), 22 states have return successors, (185), 178 states have call predecessors, (185), 185 states have call successors, (185) [2025-01-09 10:56:01,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1029 transitions. [2025-01-09 10:56:01,311 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 1029 transitions. Word has length 164 [2025-01-09 10:56:01,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:56:01,312 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 1029 transitions. [2025-01-09 10:56:01,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.074074074074074) internal successors, (110), 26 states have internal predecessors, (110), 8 states have call successors, (75), 4 states have call predecessors, (75), 8 states have return successors, (75), 8 states have call predecessors, (75), 8 states have call successors, (75) [2025-01-09 10:56:01,312 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1029 transitions. [2025-01-09 10:56:01,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 10:56:01,313 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:56:01,314 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:56:01,320 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 10:56:01,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:56:01,514 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:56:01,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:56:01,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1987648762, now seen corresponding path program 1 times [2025-01-09 10:56:01,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:56:01,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903055560] [2025-01-09 10:56:01,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:56:01,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:56:01,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 10:56:01,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 10:56:01,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:56:01,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:56:01,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 9 proven. 63 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-01-09 10:56:01,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:56:01,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903055560] [2025-01-09 10:56:01,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903055560] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:56:01,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548624821] [2025-01-09 10:56:01,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:56:01,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:56:01,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:56:01,716 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 10:56:01,718 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 10:56:01,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 10:56:01,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 10:56:01,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:56:01,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:56:01,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 10:56:01,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:56:02,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 282 proven. 63 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2025-01-09 10:56:02,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:56:02,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 9 proven. 63 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-01-09 10:56:02,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548624821] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 10:56:02,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 10:56:02,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-01-09 10:56:02,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336123353] [2025-01-09 10:56:02,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 10:56:02,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 10:56:02,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:56:02,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 10:56:02,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:56:02,226 INFO L87 Difference]: Start difference. First operand 699 states and 1029 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2025-01-09 10:56:02,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:56:02,421 INFO L93 Difference]: Finished difference Result 1004 states and 1456 transitions. [2025-01-09 10:56:02,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 10:56:02,422 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 164 [2025-01-09 10:56:02,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:56:02,427 INFO L225 Difference]: With dead ends: 1004 [2025-01-09 10:56:02,427 INFO L226 Difference]: Without dead ends: 430 [2025-01-09 10:56:02,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 325 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-01-09 10:56:02,428 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 120 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:56:02,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 233 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:56:02,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-01-09 10:56:02,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 388. [2025-01-09 10:56:02,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 255 states have (on average 1.2431372549019608) internal successors, (317), 256 states have internal predecessors, (317), 112 states have call successors, (112), 20 states have call predecessors, (112), 20 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) [2025-01-09 10:56:02,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 541 transitions. [2025-01-09 10:56:02,483 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 541 transitions. Word has length 164 [2025-01-09 10:56:02,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:56:02,484 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 541 transitions. [2025-01-09 10:56:02,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2025-01-09 10:56:02,484 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 541 transitions. [2025-01-09 10:56:02,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 10:56:02,485 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:56:02,485 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:56:02,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 10:56:02,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:56:02,686 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:56:02,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:56:02,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1384120171, now seen corresponding path program 1 times [2025-01-09 10:56:02,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:56:02,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079827429] [2025-01-09 10:56:02,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:56:02,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:56:02,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 10:56:02,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 10:56:02,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:56:02,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:56:03,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-01-09 10:56:03,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:56:03,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079827429] [2025-01-09 10:56:03,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079827429] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:56:03,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:56:03,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 10:56:03,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138969366] [2025-01-09 10:56:03,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:56:03,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 10:56:03,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:56:03,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 10:56:03,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 10:56:03,779 INFO L87 Difference]: Start difference. First operand 388 states and 541 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 10:56:05,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:56:05,746 INFO L93 Difference]: Finished difference Result 663 states and 913 transitions. [2025-01-09 10:56:05,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 10:56:05,746 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 165 [2025-01-09 10:56:05,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:56:05,749 INFO L225 Difference]: With dead ends: 663 [2025-01-09 10:56:05,749 INFO L226 Difference]: Without dead ends: 439 [2025-01-09 10:56:05,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2025-01-09 10:56:05,751 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 350 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:56:05,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 563 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 10:56:05,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-01-09 10:56:05,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 396. [2025-01-09 10:56:05,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 262 states have (on average 1.2404580152671756) internal successors, (325), 263 states have internal predecessors, (325), 112 states have call successors, (112), 21 states have call predecessors, (112), 21 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) [2025-01-09 10:56:05,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 549 transitions. [2025-01-09 10:56:05,824 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 549 transitions. Word has length 165 [2025-01-09 10:56:05,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:56:05,825 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 549 transitions. [2025-01-09 10:56:05,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 10:56:05,825 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 549 transitions. [2025-01-09 10:56:05,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 10:56:05,826 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:56:05,826 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:56:05,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:56:05,827 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:56:05,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:56:05,827 INFO L85 PathProgramCache]: Analyzing trace with hash 390887191, now seen corresponding path program 1 times [2025-01-09 10:56:05,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:56:05,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792665662] [2025-01-09 10:56:05,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:56:05,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:56:05,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 10:56:05,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 10:56:05,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:56:05,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 10:56:05,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [318689952] [2025-01-09 10:56:05,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:56:05,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:56:05,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:56:05,908 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 10:56:05,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 10:56:05,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 10:56:06,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 10:56:06,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:56:06,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 10:56:06,040 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 10:56:06,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 10:56:06,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 10:56:06,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:56:06,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 10:56:06,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 10:56:06,178 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 10:56:06,179 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 10:56:06,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 10:56:06,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-01-09 10:56:06,384 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:56:06,487 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 10:56:06,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 10:56:06 BoogieIcfgContainer [2025-01-09 10:56:06,494 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 10:56:06,494 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 10:56:06,494 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 10:56:06,495 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 10:56:06,496 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:55:39" (3/4) ... [2025-01-09 10:56:06,497 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 10:56:06,498 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 10:56:06,499 INFO L158 Benchmark]: Toolchain (without parser) took 28161.68ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 105.5MB in the beginning and 166.5MB in the end (delta: -61.0MB). Peak memory consumption was 121.2MB. Max. memory is 16.1GB. [2025-01-09 10:56:06,499 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 10:56:06,499 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.51ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 89.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 10:56:06,499 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.64ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 85.3MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 10:56:06,500 INFO L158 Benchmark]: Boogie Preprocessor took 59.83ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 79.7MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 10:56:06,500 INFO L158 Benchmark]: RCFGBuilder took 444.77ms. Allocated memory is still 142.6MB. Free memory was 79.7MB in the beginning and 52.4MB in the end (delta: 27.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 10:56:06,501 INFO L158 Benchmark]: TraceAbstraction took 27362.77ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 51.7MB in the beginning and 166.6MB in the end (delta: -114.9MB). Peak memory consumption was 70.8MB. Max. memory is 16.1GB. [2025-01-09 10:56:06,501 INFO L158 Benchmark]: Witness Printer took 4.02ms. Allocated memory is still 327.2MB. Free memory was 166.6MB in the beginning and 166.5MB in the end (delta: 101.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 10:56:06,502 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.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 243.51ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 89.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.64ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 85.3MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 59.83ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 79.7MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 444.77ms. Allocated memory is still 142.6MB. Free memory was 79.7MB in the beginning and 52.4MB in the end (delta: 27.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 27362.77ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 51.7MB in the beginning and 166.6MB in the end (delta: -114.9MB). Peak memory consumption was 70.8MB. Max. memory is 16.1GB. * Witness Printer took 4.02ms. Allocated memory is still 327.2MB. Free memory was 166.6MB in the beginning and 166.5MB in the end (delta: 101.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 179, overapproximation of someBinaryDOUBLEComparisonOperation at line 133, overapproximation of someBinaryDOUBLEComparisonOperation at line 65, overapproximation of someBinaryDOUBLEComparisonOperation at line 131, overapproximation of someBinaryDOUBLEComparisonOperation at line 160, overapproximation of someBinaryDOUBLEComparisonOperation at line 135, overapproximation of someBinaryDOUBLEComparisonOperation at line 111, overapproximation of someBinaryDOUBLEComparisonOperation at line 158. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.05; [L23] double var_1_6 = 0.0; [L24] double var_1_7 = 49.5; [L25] double var_1_8 = 16.75; [L26] unsigned short int var_1_9 = 1; [L27] unsigned long int var_1_11 = 8; [L28] unsigned char var_1_12 = 0; [L29] unsigned char var_1_13 = 1; [L30] unsigned char var_1_14 = 32; [L31] unsigned char var_1_15 = 50; [L32] unsigned char var_1_16 = 8; [L33] unsigned char var_1_17 = 32; [L34] unsigned long int var_1_18 = 2; [L35] unsigned long int var_1_19 = 3876014737; [L36] unsigned char var_1_20 = 0; [L37] unsigned short int var_1_21 = 25; [L38] unsigned char var_1_27 = 1; [L39] unsigned char var_1_30 = 1; [L40] unsigned char var_1_31 = 1; [L41] unsigned char var_1_32 = 0; [L42] unsigned long int var_1_33 = 2; [L43] unsigned short int var_1_34 = 0; [L44] signed short int var_1_35 = -10; [L45] double var_1_36 = 128.5; [L46] double var_1_37 = 128.25; [L47] unsigned char var_1_40 = 2; [L48] unsigned char var_1_41 = 25; [L49] unsigned short int var_1_42 = 8; [L50] unsigned long int var_1_43 = 3563499258; [L51] unsigned long int var_1_44 = 1249494912; [L52] double last_1_var_1_1 = 5.05; [L53] unsigned short int last_1_var_1_9 = 1; [L54] unsigned long int last_1_var_1_11 = 8; [L55] unsigned char last_1_var_1_14 = 32; [L56] unsigned char last_1_var_1_20 = 0; VAL [isInitial=0, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_6=0, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L183] isInitial = 1 [L184] FCALL initially() [L186] CALL updateLastVariables() [L172] last_1_var_1_1 = var_1_1 [L173] last_1_var_1_9 = var_1_9 [L174] last_1_var_1_11 = var_1_11 [L175] last_1_var_1_14 = var_1_14 [L176] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_6=0, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L186] RET updateLastVariables() [L187] CALL updateVariables() [L130] var_1_6 = __VERIFIER_nondet_double() [L131] CALL assume_abort_if_not((var_1_6 >= 2305843.009213691390e+12F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L131] RET assume_abort_if_not((var_1_6 >= 2305843.009213691390e+12F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L132] var_1_7 = __VERIFIER_nondet_double() [L133] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 2305843.009213691390e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_8=67/4, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_8=67/4, var_1_9=1] [L133] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 2305843.009213691390e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_8=67/4, var_1_9=1] [L134] var_1_8 = __VERIFIER_nondet_double() [L135] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L135] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L136] var_1_13 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L137] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L138] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L138] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L139] var_1_15 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L140] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L141] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L141] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L142] var_1_16 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L143] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L144] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L144] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L145] var_1_17 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L146] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L147] CALL assume_abort_if_not(var_1_17 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L147] RET assume_abort_if_not(var_1_17 <= 254) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L148] var_1_19 = __VERIFIER_nondet_ulong() [L149] CALL assume_abort_if_not(var_1_19 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L149] RET assume_abort_if_not(var_1_19 >= 3221225470) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L150] CALL assume_abort_if_not(var_1_19 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L150] RET assume_abort_if_not(var_1_19 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L151] var_1_30 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_30 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L152] RET assume_abort_if_not(var_1_30 >= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L153] CALL assume_abort_if_not(var_1_30 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L153] RET assume_abort_if_not(var_1_30 <= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L154] var_1_32 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_32 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L155] RET assume_abort_if_not(var_1_32 >= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L156] CALL assume_abort_if_not(var_1_32 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L156] RET assume_abort_if_not(var_1_32 <= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L157] var_1_36 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854776000e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L158] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854776000e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L159] var_1_37 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L160] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L161] var_1_41 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_41 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L162] RET assume_abort_if_not(var_1_41 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L163] CALL assume_abort_if_not(var_1_41 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L163] RET assume_abort_if_not(var_1_41 <= 254) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L164] var_1_43 = __VERIFIER_nondet_ulong() [L165] CALL assume_abort_if_not(var_1_43 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1249494912, var_1_9=1] [L165] RET assume_abort_if_not(var_1_43 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1249494912, var_1_9=1] [L166] CALL assume_abort_if_not(var_1_43 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1249494912, var_1_9=1] [L166] RET assume_abort_if_not(var_1_43 <= 4294967295) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1249494912, var_1_9=1] [L167] var_1_44 = __VERIFIER_nondet_ulong() [L168] CALL assume_abort_if_not(var_1_44 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_9=1] [L168] RET assume_abort_if_not(var_1_44 >= 1073741823) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_9=1] [L169] CALL assume_abort_if_not(var_1_44 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_9=1] [L169] RET assume_abort_if_not(var_1_44 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_9=1] [L187] RET updateVariables() [L188] CALL step() [L60] COND TRUE \read(var_1_13) [L61] var_1_18 = ((var_1_19 - last_1_var_1_9) - last_1_var_1_11) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=8589934581, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_9=1] [L65] COND FALSE !(var_1_6 > ((((var_1_8) < (last_1_var_1_1)) ? (var_1_8) : (last_1_var_1_1)))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=8589934581, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_9=1] [L74] COND TRUE (8 - 64) <= (var_1_9 - var_1_9) [L75] var_1_14 = (((((var_1_15 + var_1_16)) < (var_1_17)) ? ((var_1_15 + var_1_16)) : (var_1_17))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=8589934581, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_9=1] [L79] signed long int stepLocal_0 = - ((((var_1_9) < (var_1_9)) ? (var_1_9) : (var_1_9))); VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, stepLocal_0=-1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=8589934581, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_9=1] [L80] COND FALSE !(var_1_18 >= stepLocal_0) [L83] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=8589934581, var_1_19=8589934590, var_1_1=2, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L85] COND TRUE (var_1_14 / var_1_19) <= ((((var_1_18) < (var_1_14)) ? (var_1_18) : (var_1_14))) [L86] var_1_20 = var_1_13 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=8589934581, var_1_19=8589934590, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L88] COND TRUE \read(var_1_20) [L89] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=8589934581, var_1_19=8589934590, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L91] var_1_11 = (var_1_9 + (((((var_1_18) < (var_1_9)) ? (var_1_18) : (var_1_9))) + 2u)) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=8589934581, var_1_19=8589934590, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L92] COND FALSE !(((((var_1_9) < (var_1_18)) ? (var_1_9) : (var_1_18))) > var_1_9) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=8589934581, var_1_19=8589934590, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L95] COND FALSE !((var_1_9 <= var_1_14) && var_1_20) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=8589934581, var_1_19=8589934590, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L106] COND TRUE var_1_18 > (- var_1_18) [L107] var_1_31 = (var_1_30 && var_1_32) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=8589934581, var_1_19=8589934590, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L109] var_1_33 = var_1_14 [L110] var_1_34 = (var_1_14 + 4) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=8589934581, var_1_19=8589934590, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=4, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L111] COND FALSE !(((var_1_36 - var_1_37) + var_1_1) == var_1_1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=8589934581, var_1_19=8589934590, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=4, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L114] COND FALSE !(var_1_14 >= (~ var_1_18)) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=8589934581, var_1_19=8589934590, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=4, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L117] COND TRUE \read(var_1_20) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=8589934581, var_1_19=8589934590, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=4, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L118] COND FALSE !(var_1_11 < 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=8589934581, var_1_19=8589934590, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=4, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L188] RET step() [L189] CALL, EXPR property() [L179-L180] return (((((((var_1_18 >= (- ((((var_1_9) < (var_1_9)) ? (var_1_9) : (var_1_9))))) ? (var_1_1 == ((double) (((var_1_6 - var_1_7) - ((((64.75) > (128.725)) ? (64.75) : (128.725)))) + var_1_8))) : (var_1_1 == ((double) var_1_7))) && ((var_1_6 > ((((var_1_8) < (last_1_var_1_1)) ? (var_1_8) : (last_1_var_1_1)))) ? ((! ((last_1_var_1_1 == var_1_7) && (last_1_var_1_20 || last_1_var_1_20))) ? ((! (var_1_6 <= var_1_7)) ? (var_1_9 == ((unsigned short int) ((((last_1_var_1_14) < (last_1_var_1_14)) ? (last_1_var_1_14) : (last_1_var_1_14))))) : 1) : (var_1_9 == ((unsigned short int) last_1_var_1_14))) : 1)) && (var_1_11 == ((unsigned long int) (var_1_9 + (((((var_1_18) < (var_1_9)) ? (var_1_18) : (var_1_9))) + 2u))))) && (var_1_20 ? (var_1_12 == ((unsigned char) var_1_13)) : 1)) && (((8 - 64) <= (var_1_9 - var_1_9)) ? (var_1_14 == ((unsigned char) (((((var_1_15 + var_1_16)) < (var_1_17)) ? ((var_1_15 + var_1_16)) : (var_1_17))))) : (var_1_14 == ((unsigned char) var_1_17)))) && (var_1_13 ? (var_1_18 == ((unsigned long int) ((var_1_19 - last_1_var_1_9) - last_1_var_1_11))) : (var_1_18 == ((unsigned long int) (((((var_1_19 - var_1_17)) > (var_1_15)) ? ((var_1_19 - var_1_17)) : (var_1_15))))))) && (((var_1_14 / var_1_19) <= ((((var_1_18) < (var_1_14)) ? (var_1_18) : (var_1_14)))) ? (var_1_20 == ((unsigned char) var_1_13)) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=8589934581, var_1_19=8589934590, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=4, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L189] RET, EXPR property() [L189] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=8589934581, var_1_19=8589934590, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=4, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=8589934581, var_1_19=8589934590, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=4, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.2s, OverallIterations: 7, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 19.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 2137 SdHoareTripleChecker+Valid, 13.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2132 mSDsluCounter, 2715 SdHoareTripleChecker+Invalid, 13.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1902 mSDsCounter, 1206 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3102 IncrementalHoareTripleChecker+Invalid, 4310 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1206 mSolverCounterUnsat, 813 mSDtfsCounter, 3102 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 953 GetRequests, 827 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3254 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=699occurred in iteration=4, InterpolantAutomatonStates: 106, 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, 6 MinimizatonAttempts, 543 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 1807 NumberOfCodeBlocks, 1807 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1794 ConstructedInterpolants, 0 QuantifiedInterpolants, 10671 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1180 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 11 InterpolantComputations, 4 PerfectInterpolantSequences, 12777/13200 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 10:56:06,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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-pe-co_file-70.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 29f3b33aa76fbd79b42fdd0c3fff670150c31cac386cea2ae8894bfbaea7ba77 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:56:08,361 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:56:08,436 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 10:56:08,441 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:56:08,441 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:56:08,466 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:56:08,467 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:56:08,467 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:56:08,467 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:56:08,467 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:56:08,467 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:56:08,467 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:56:08,468 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:56:08,468 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:56:08,468 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:56:08,468 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:56:08,468 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:56:08,468 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:56:08,468 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:56:08,468 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:56:08,468 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:56:08,468 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:56:08,468 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:56:08,468 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 10:56:08,468 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 10:56:08,468 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 10:56:08,469 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:56:08,469 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:56:08,469 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:56:08,469 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:56:08,469 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:56:08,469 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:56:08,469 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:56:08,469 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:56:08,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:56:08,470 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:56:08,470 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:56:08,470 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:56:08,470 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:56:08,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:56:08,470 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:56:08,470 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:56:08,470 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:56:08,470 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:56:08,470 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 10:56:08,470 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 10:56:08,470 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:56:08,470 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:56:08,470 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:56:08,470 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:56:08,470 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 -> 29f3b33aa76fbd79b42fdd0c3fff670150c31cac386cea2ae8894bfbaea7ba77 [2025-01-09 10:56:08,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:56:08,697 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:56:08,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:56:08,700 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:56:08,700 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:56:08,701 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-pe-co_file-70.i [2025-01-09 10:56:09,950 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/82c1adc33/7108344b5d0a4b6096184b941b0220e8/FLAG07389bdcd [2025-01-09 10:56:10,135 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:56:10,138 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-70.i [2025-01-09 10:56:10,145 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/82c1adc33/7108344b5d0a4b6096184b941b0220e8/FLAG07389bdcd [2025-01-09 10:56:10,161 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/82c1adc33/7108344b5d0a4b6096184b941b0220e8 [2025-01-09 10:56:10,163 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:56:10,164 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:56:10,165 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:56:10,166 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:56:10,169 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:56:10,170 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:56:10" (1/1) ... [2025-01-09 10:56:10,170 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bb74009 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:56:10, skipping insertion in model container [2025-01-09 10:56:10,171 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:56:10" (1/1) ... [2025-01-09 10:56:10,187 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:56:10,302 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-pe-co_file-70.i[919,932] [2025-01-09 10:56:10,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:56:10,377 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:56:10,384 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-pe-co_file-70.i[919,932] [2025-01-09 10:56:10,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:56:10,416 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:56:10,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:56:10 WrapperNode [2025-01-09 10:56:10,417 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:56:10,418 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:56:10,418 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:56:10,418 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:56:10,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:56:10" (1/1) ... [2025-01-09 10:56:10,429 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:56:10" (1/1) ... [2025-01-09 10:56:10,450 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 183 [2025-01-09 10:56:10,454 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:56:10,454 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:56:10,454 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:56:10,454 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:56:10,461 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:56:10" (1/1) ... [2025-01-09 10:56:10,461 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:56:10" (1/1) ... [2025-01-09 10:56:10,463 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:56:10" (1/1) ... [2025-01-09 10:56:10,475 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 10:56:10,475 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:56:10" (1/1) ... [2025-01-09 10:56:10,475 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:56:10" (1/1) ... [2025-01-09 10:56:10,481 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:56:10" (1/1) ... [2025-01-09 10:56:10,482 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:56:10" (1/1) ... [2025-01-09 10:56:10,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:56:10" (1/1) ... [2025-01-09 10:56:10,487 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:56:10" (1/1) ... [2025-01-09 10:56:10,492 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:56:10" (1/1) ... [2025-01-09 10:56:10,494 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:56:10,495 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:56:10,495 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:56:10,495 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:56:10,499 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:56:10" (1/1) ... [2025-01-09 10:56:10,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:56:10,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:56:10,535 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 10:56:10,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 10:56:10,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:56:10,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 10:56:10,556 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:56:10,556 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:56:10,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:56:10,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:56:10,625 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:56:10,626 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:56:17,587 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-09 10:56:17,588 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:56:17,600 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:56:17,601 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:56:17,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:56:17 BoogieIcfgContainer [2025-01-09 10:56:17,601 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:56:17,602 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:56:17,602 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:56:17,605 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:56:17,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:56:10" (1/3) ... [2025-01-09 10:56:17,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b46a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:56:17, skipping insertion in model container [2025-01-09 10:56:17,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:56:10" (2/3) ... [2025-01-09 10:56:17,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b46a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:56:17, skipping insertion in model container [2025-01-09 10:56:17,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:56:17" (3/3) ... [2025-01-09 10:56:17,607 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-70.i [2025-01-09 10:56:17,616 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:56:17,618 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-70.i that has 2 procedures, 79 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:56:17,663 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:56:17,672 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;@116ef205, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:56:17,673 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:56:17,676 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 52 states have internal predecessors, (73), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-09 10:56:17,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 10:56:17,687 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:56:17,688 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:56:17,689 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:56:17,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:56:17,694 INFO L85 PathProgramCache]: Analyzing trace with hash -914801574, now seen corresponding path program 1 times [2025-01-09 10:56:17,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 10:56:17,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1309585650] [2025-01-09 10:56:17,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:56:17,703 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 10:56:17,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 10:56:17,705 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 10:56:17,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 10:56:17,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 10:56:18,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 10:56:18,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:56:18,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:56:18,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:56:18,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:56:18,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 368 proven. 0 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2025-01-09 10:56:18,224 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:56:18,225 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 10:56:18,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1309585650] [2025-01-09 10:56:18,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1309585650] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:56:18,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:56:18,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 10:56:18,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240340260] [2025-01-09 10:56:18,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:56:18,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:56:18,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 10:56:18,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:56:18,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:56:18,244 INFO L87 Difference]: Start difference. First operand has 79 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 52 states have internal predecessors, (73), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) 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, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 10:56:18,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:56:18,263 INFO L93 Difference]: Finished difference Result 151 states and 264 transitions. [2025-01-09 10:56:18,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:56:18,265 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, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 164 [2025-01-09 10:56:18,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:56:18,273 INFO L225 Difference]: With dead ends: 151 [2025-01-09 10:56:18,273 INFO L226 Difference]: Without dead ends: 75 [2025-01-09 10:56:18,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:56:18,280 INFO L435 NwaCegarLoop]: 113 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, 113 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:56:18,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:56:18,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-01-09 10:56:18,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-01-09 10:56:18,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-09 10:56:18,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 113 transitions. [2025-01-09 10:56:18,320 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 113 transitions. Word has length 164 [2025-01-09 10:56:18,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:56:18,321 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 113 transitions. [2025-01-09 10:56:18,321 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, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 10:56:18,321 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 113 transitions. [2025-01-09 10:56:18,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 10:56:18,324 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:56:18,324 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:56:18,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 10:56:18,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 10:56:18,525 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:56:18,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:56:18,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1590805924, now seen corresponding path program 1 times [2025-01-09 10:56:18,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 10:56:18,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1546600590] [2025-01-09 10:56:18,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:56:18,526 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 10:56:18,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 10:56:18,528 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 10:56:18,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 10:56:18,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 10:56:18,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 10:56:18,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:56:18,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:56:18,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 10:56:18,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:56:22,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 618 proven. 39 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked. [2025-01-09 10:56:22,701 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:56:23,173 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 10:56:23,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1546600590] [2025-01-09 10:56:23,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1546600590] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:56:23,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1387364035] [2025-01-09 10:56:23,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:56:23,174 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 10:56:23,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 10:56:23,198 INFO L229 MonitoredProcess]: Starting monitored process 4 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 10:56:23,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-01-09 10:56:23,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 10:56:23,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 10:56:23,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:56:23,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:56:23,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 10:56:23,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:56:23,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-01-09 10:56:23,565 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:56:23,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1387364035] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:56:23,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:56:23,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2025-01-09 10:56:23,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963271858] [2025-01-09 10:56:23,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:56:23,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:56:23,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 10:56:23,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:56:23,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-01-09 10:56:23,567 INFO L87 Difference]: Start difference. First operand 75 states and 113 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 10:56:25,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 10:56:25,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:56:25,770 INFO L93 Difference]: Finished difference Result 216 states and 328 transitions. [2025-01-09 10:56:25,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:56:25,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 164 [2025-01-09 10:56:25,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:56:25,772 INFO L225 Difference]: With dead ends: 216 [2025-01-09 10:56:25,772 INFO L226 Difference]: Without dead ends: 144 [2025-01-09 10:56:25,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-01-09 10:56:25,776 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 99 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:56:25,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 296 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 10:56:25,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-01-09 10:56:25,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2025-01-09 10:56:25,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 89 states have (on average 1.2921348314606742) internal successors, (115), 89 states have internal predecessors, (115), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 10:56:25,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 215 transitions. [2025-01-09 10:56:25,799 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 215 transitions. Word has length 164 [2025-01-09 10:56:25,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:56:25,800 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 215 transitions. [2025-01-09 10:56:25,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 10:56:25,800 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 215 transitions. [2025-01-09 10:56:25,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 10:56:25,801 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:56:25,801 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:56:25,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 10:56:26,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2025-01-09 10:56:26,202 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,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-01-09 10:56:26,202 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:56:26,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:56:26,203 INFO L85 PathProgramCache]: Analyzing trace with hash 2117355358, now seen corresponding path program 1 times [2025-01-09 10:56:26,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 10:56:26,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1680640759] [2025-01-09 10:56:26,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:56:26,203 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 10:56:26,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 10:56:26,205 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 10:56:26,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-01-09 10:56:26,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 10:56:26,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 10:56:26,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:56:26,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:56:26,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 10:56:26,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:56:28,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 618 proven. 39 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked. [2025-01-09 10:56:28,203 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:56:28,675 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 10:56:28,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1680640759] [2025-01-09 10:56:28,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1680640759] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:56:28,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1087959409] [2025-01-09 10:56:28,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:56:28,675 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 10:56:28,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 10:56:28,677 INFO L229 MonitoredProcess]: Starting monitored process 6 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 10:56:28,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-01-09 10:56:28,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 10:56:28,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 10:56:28,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:56:28,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:56:28,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 10:56:28,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:56:29,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-01-09 10:56:29,063 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:56:29,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1087959409] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:56:29,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:56:29,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2025-01-09 10:56:29,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300299754] [2025-01-09 10:56:29,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:56:29,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:56:29,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 10:56:29,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:56:29,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-01-09 10:56:29,065 INFO L87 Difference]: Start difference. First operand 142 states and 215 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 10:56:31,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 10:56:32,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:56:32,467 INFO L93 Difference]: Finished difference Result 355 states and 527 transitions. [2025-01-09 10:56:32,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:56:32,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 164 [2025-01-09 10:56:32,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:56:32,469 INFO L225 Difference]: With dead ends: 355 [2025-01-09 10:56:32,469 INFO L226 Difference]: Without dead ends: 216 [2025-01-09 10:56:32,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-01-09 10:56:32,471 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 197 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:56:32,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 466 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-01-09 10:56:32,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-01-09 10:56:32,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 207. [2025-01-09 10:56:32,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 146 states have (on average 1.3424657534246576) internal successors, (196), 148 states have internal predecessors, (196), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 10:56:32,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 308 transitions. [2025-01-09 10:56:32,500 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 308 transitions. Word has length 164 [2025-01-09 10:56:32,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:56:32,500 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 308 transitions. [2025-01-09 10:56:32,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 10:56:32,500 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 308 transitions. [2025-01-09 10:56:32,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 10:56:32,502 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:56:32,502 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:56:32,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2025-01-09 10:56:32,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-01-09 10:56:32,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 10:56:32,902 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:56:32,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:56:32,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1106238108, now seen corresponding path program 1 times [2025-01-09 10:56:32,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 10:56:32,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1713250316] [2025-01-09 10:56:32,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:56:32,903 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 10:56:32,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 10:56:32,905 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 10:56:32,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-01-09 10:56:32,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 10:56:33,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 10:56:33,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:56:33,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:56:33,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 10:56:33,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:56:35,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 618 proven. 39 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked. [2025-01-09 10:56:35,021 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:56:35,511 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 10:56:35,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1713250316] [2025-01-09 10:56:35,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1713250316] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:56:35,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [81640615] [2025-01-09 10:56:35,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:56:35,511 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 10:56:35,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 10:56:35,513 INFO L229 MonitoredProcess]: Starting monitored process 8 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 10:56:35,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2025-01-09 10:56:35,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 10:56:36,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 10:56:36,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:56:36,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:56:36,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 10:56:36,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:56:36,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-01-09 10:56:36,894 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:56:36,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [81640615] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:56:36,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:56:36,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2025-01-09 10:56:36,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616894001] [2025-01-09 10:56:36,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:56:36,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:56:36,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 10:56:36,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:56:36,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-01-09 10:56:36,896 INFO L87 Difference]: Start difference. First operand 207 states and 308 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 10:56:38,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 10:56:41,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.83s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 10:56:43,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 10:56:45,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 10:56:47,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 10:56:49,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 10:56:49,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:56:49,659 INFO L93 Difference]: Finished difference Result 795 states and 1183 transitions. [2025-01-09 10:56:49,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:56:49,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 164 [2025-01-09 10:56:49,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:56:49,666 INFO L225 Difference]: With dead ends: 795 [2025-01-09 10:56:49,666 INFO L226 Difference]: Without dead ends: 591 [2025-01-09 10:56:49,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2025-01-09 10:56:49,668 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 102 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2025-01-09 10:56:49,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 518 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 12.6s Time] [2025-01-09 10:56:49,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-01-09 10:56:49,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 447. [2025-01-09 10:56:49,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 326 states have (on average 1.3496932515337423) internal successors, (440), 330 states have internal predecessors, (440), 112 states have call successors, (112), 8 states have call predecessors, (112), 8 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2025-01-09 10:56:49,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 664 transitions. [2025-01-09 10:56:49,713 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 664 transitions. Word has length 164 [2025-01-09 10:56:49,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:56:49,713 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 664 transitions. [2025-01-09 10:56:49,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 10:56:49,713 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 664 transitions. [2025-01-09 10:56:49,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 10:56:49,715 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:56:49,715 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:56:49,730 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 (7)] Ended with exit code 0 [2025-01-09 10:56:49,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2025-01-09 10:56:50,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-01-09 10:56:50,116 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:56:50,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:56:50,116 INFO L85 PathProgramCache]: Analyzing trace with hash 426179738, now seen corresponding path program 1 times [2025-01-09 10:56:50,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 10:56:50,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [37061756] [2025-01-09 10:56:50,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:56:50,116 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 10:56:50,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 10:56:50,118 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 10:56:50,120 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 (9)] Waiting until timeout for monitored process [2025-01-09 10:56:50,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 10:56:50,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 10:56:50,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:56:50,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:56:50,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 10:56:50,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:56:52,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 618 proven. 39 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked. [2025-01-09 10:56:52,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:56:53,174 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 10:56:53,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [37061756] [2025-01-09 10:56:53,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [37061756] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:56:53,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [318203107] [2025-01-09 10:56:53,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:56:53,174 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 10:56:53,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 10:56:53,176 INFO L229 MonitoredProcess]: Starting monitored process 10 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 10:56:53,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2025-01-09 10:56:53,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 10:56:53,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 10:56:53,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:56:53,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:56:53,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 10:56:53,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:56:56,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 618 proven. 39 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked. [2025-01-09 10:56:56,131 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:56:56,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [318203107] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:56:56,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 10:56:56,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2025-01-09 10:56:56,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216365555] [2025-01-09 10:56:56,448 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 10:56:56,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 10:56:56,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 10:56:56,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 10:56:56,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-01-09 10:56:56,449 INFO L87 Difference]: Start difference. First operand 447 states and 664 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 10:56:59,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 10:57:01,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 10:57:04,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 10:57:05,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 10:57:08,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 10:57:08,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:57:08,828 INFO L93 Difference]: Finished difference Result 1080 states and 1596 transitions. [2025-01-09 10:57:08,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 10:57:08,829 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 164 [2025-01-09 10:57:08,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:57:08,832 INFO L225 Difference]: With dead ends: 1080 [2025-01-09 10:57:08,832 INFO L226 Difference]: Without dead ends: 636 [2025-01-09 10:57:08,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 501 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2025-01-09 10:57:08,834 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 280 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:57:08,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 474 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 12.0s Time] [2025-01-09 10:57:08,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2025-01-09 10:57:08,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 582. [2025-01-09 10:57:08,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 406 states have (on average 1.3152709359605912) internal successors, (534), 411 states have internal predecessors, (534), 162 states have call successors, (162), 13 states have call predecessors, (162), 13 states have return successors, (162), 157 states have call predecessors, (162), 162 states have call successors, (162) [2025-01-09 10:57:08,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 858 transitions. [2025-01-09 10:57:08,871 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 858 transitions. Word has length 164 [2025-01-09 10:57:08,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:57:08,872 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 858 transitions. [2025-01-09 10:57:08,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 10:57:08,872 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 858 transitions. [2025-01-09 10:57:08,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 10:57:08,874 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:57:08,874 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:57:08,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2025-01-09 10:57:09,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2025-01-09 10:57:09,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-01-09 10:57:09,275 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:57:09,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:57:09,276 INFO L85 PathProgramCache]: Analyzing trace with hash -251646754, now seen corresponding path program 1 times [2025-01-09 10:57:09,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 10:57:09,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [140086985] [2025-01-09 10:57:09,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:57:09,276 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 10:57:09,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 10:57:09,278 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 10:57:09,278 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 (11)] Waiting until timeout for monitored process [2025-01-09 10:57:09,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 10:57:09,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 10:57:09,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:57:09,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:57:09,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 10:57:09,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:57:09,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 282 proven. 63 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2025-01-09 10:57:09,911 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:57:10,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 9 proven. 63 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-01-09 10:57:10,179 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 10:57:10,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [140086985] [2025-01-09 10:57:10,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [140086985] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 10:57:10,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 10:57:10,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-01-09 10:57:10,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098759018] [2025-01-09 10:57:10,180 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 10:57:10,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 10:57:10,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 10:57:10,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 10:57:10,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:57:10,181 INFO L87 Difference]: Start difference. First operand 582 states and 858 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47)