./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-47.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-47.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 5092b9874183dfc38681d21126dd96b4ef139ca1702e11549aa108a46ad20342 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:07:16,550 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:07:16,604 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 09:07:16,609 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:07:16,610 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:07:16,630 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:07:16,631 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:07:16,631 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:07:16,631 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:07:16,632 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:07:16,632 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:07:16,632 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:07:16,633 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:07:16,633 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:07:16,633 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:07:16,634 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:07:16,634 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:07:16,634 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:07:16,634 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:07:16,634 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:07:16,634 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:07:16,634 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:07:16,634 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:07:16,634 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:07:16,634 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:07:16,634 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:07:16,634 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:07:16,634 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:07:16,635 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:07:16,635 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:07:16,635 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:07:16,635 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:07:16,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:07:16,635 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:07:16,635 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:07:16,635 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:07:16,635 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:07:16,636 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:07:16,636 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:07:16,636 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:07:16,636 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:07:16,636 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:07:16,636 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:07:16,636 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:07:16,636 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:07:16,636 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:07:16,636 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:07:16,637 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:07:16,637 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 -> 5092b9874183dfc38681d21126dd96b4ef139ca1702e11549aa108a46ad20342 [2025-01-09 09:07:16,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:07:16,887 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:07:16,890 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:07:16,891 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:07:16,891 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:07:16,892 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-47.i [2025-01-09 09:07:18,042 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b90444363/24cf172c306647a9bd7f7e7ace234615/FLAG0fbac4616 [2025-01-09 09:07:18,317 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:07:18,318 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-47.i [2025-01-09 09:07:18,327 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b90444363/24cf172c306647a9bd7f7e7ace234615/FLAG0fbac4616 [2025-01-09 09:07:18,637 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b90444363/24cf172c306647a9bd7f7e7ace234615 [2025-01-09 09:07:18,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:07:18,641 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:07:18,643 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:07:18,643 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:07:18,647 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:07:18,648 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:07:18" (1/1) ... [2025-01-09 09:07:18,648 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@188a41cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:18, skipping insertion in model container [2025-01-09 09:07:18,649 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:07:18" (1/1) ... [2025-01-09 09:07:18,661 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:07:18,747 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-47.i[913,926] [2025-01-09 09:07:18,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:07:18,821 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:07:18,831 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-47.i[913,926] [2025-01-09 09:07:18,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:07:18,882 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:07:18,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:18 WrapperNode [2025-01-09 09:07:18,883 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:07:18,883 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:07:18,883 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:07:18,883 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:07:18,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:18" (1/1) ... [2025-01-09 09:07:18,894 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:18" (1/1) ... [2025-01-09 09:07:18,932 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 200 [2025-01-09 09:07:18,935 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:07:18,935 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:07:18,935 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:07:18,935 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:07:18,942 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:18" (1/1) ... [2025-01-09 09:07:18,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:18" (1/1) ... [2025-01-09 09:07:18,945 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:18" (1/1) ... [2025-01-09 09:07:18,960 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 09:07:18,960 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:18" (1/1) ... [2025-01-09 09:07:18,960 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:18" (1/1) ... [2025-01-09 09:07:18,969 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:18" (1/1) ... [2025-01-09 09:07:18,970 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:18" (1/1) ... [2025-01-09 09:07:18,973 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:18" (1/1) ... [2025-01-09 09:07:18,974 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:18" (1/1) ... [2025-01-09 09:07:18,975 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:18" (1/1) ... [2025-01-09 09:07:18,977 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:07:18,978 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:07:18,978 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:07:18,978 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:07:18,979 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:18" (1/1) ... [2025-01-09 09:07:18,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:07:18,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:07:19,001 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 09:07:19,004 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 09:07:19,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:07:19,018 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:07:19,018 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:07:19,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:07:19,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:07:19,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:07:19,077 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:07:19,078 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:07:19,325 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-01-09 09:07:19,325 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:07:19,332 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:07:19,332 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:07:19,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:07:19 BoogieIcfgContainer [2025-01-09 09:07:19,333 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:07:19,334 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:07:19,334 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:07:19,337 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:07:19,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:07:18" (1/3) ... [2025-01-09 09:07:19,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d24d09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:07:19, skipping insertion in model container [2025-01-09 09:07:19,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:18" (2/3) ... [2025-01-09 09:07:19,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d24d09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:07:19, skipping insertion in model container [2025-01-09 09:07:19,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:07:19" (3/3) ... [2025-01-09 09:07:19,339 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-47.i [2025-01-09 09:07:19,349 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:07:19,350 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-47.i that has 2 procedures, 88 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:07:19,383 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:07:19,392 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;@1a76c386, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:07:19,392 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:07:19,396 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 64 states have (on average 1.46875) internal successors, (94), 65 states have internal predecessors, (94), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 09:07:19,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 09:07:19,405 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:07:19,405 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:07:19,406 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:07:19,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:07:19,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1645645468, now seen corresponding path program 1 times [2025-01-09 09:07:19,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:07:19,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637628607] [2025-01-09 09:07:19,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:07:19,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:07:19,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 09:07:19,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 09:07:19,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:07:19,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:07:19,658 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-01-09 09:07:19,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:07:19,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637628607] [2025-01-09 09:07:19,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637628607] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:07:19,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575557708] [2025-01-09 09:07:19,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:07:19,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:07:19,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:07:19,661 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 09:07:19,665 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 09:07:19,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 09:07:19,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 09:07:19,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:07:19,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:07:19,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:07:19,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:07:19,792 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-01-09 09:07:19,793 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:07:19,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575557708] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:07:19,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:07:19,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:07:19,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127471433] [2025-01-09 09:07:19,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:07:19,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:07:19,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:07:19,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:07:19,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:07:19,815 INFO L87 Difference]: Start difference. First operand has 88 states, 64 states have (on average 1.46875) internal successors, (94), 65 states have internal predecessors, (94), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 09:07:19,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:07:19,831 INFO L93 Difference]: Finished difference Result 170 states and 288 transitions. [2025-01-09 09:07:19,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:07:19,833 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 140 [2025-01-09 09:07:19,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:07:19,837 INFO L225 Difference]: With dead ends: 170 [2025-01-09 09:07:19,837 INFO L226 Difference]: Without dead ends: 85 [2025-01-09 09:07:19,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 141 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 09:07:19,841 INFO L435 NwaCegarLoop]: 127 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, 127 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 09:07:19,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:07:19,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-01-09 09:07:19,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-01-09 09:07:19,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.3709677419354838) internal successors, (85), 62 states have internal predecessors, (85), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 09:07:19,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2025-01-09 09:07:19,875 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 127 transitions. Word has length 140 [2025-01-09 09:07:19,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:07:19,876 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 127 transitions. [2025-01-09 09:07:19,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 09:07:19,876 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 127 transitions. [2025-01-09 09:07:19,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 09:07:19,879 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:07:19,880 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:07:19,886 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 09:07:20,081 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 09:07:20,081 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:07:20,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:07:20,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1389152389, now seen corresponding path program 1 times [2025-01-09 09:07:20,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:07:20,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581132218] [2025-01-09 09:07:20,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:07:20,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:07:20,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 09:07:20,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 09:07:20,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:07:20,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:07:20,824 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 09:07:20,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:07:20,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581132218] [2025-01-09 09:07:20,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581132218] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:07:20,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:07:20,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:07:20,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103988694] [2025-01-09 09:07:20,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:07:20,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:07:20,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:07:20,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:07:20,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:07:20,827 INFO L87 Difference]: Start difference. First operand 85 states and 127 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 09:07:21,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:07:21,041 INFO L93 Difference]: Finished difference Result 250 states and 376 transitions. [2025-01-09 09:07:21,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:07:21,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 141 [2025-01-09 09:07:21,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:07:21,046 INFO L225 Difference]: With dead ends: 250 [2025-01-09 09:07:21,046 INFO L226 Difference]: Without dead ends: 168 [2025-01-09 09:07:21,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:07:21,047 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 94 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:07:21,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 341 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:07:21,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-01-09 09:07:21,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 125. [2025-01-09 09:07:21,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 80 states have (on average 1.2875) internal successors, (103), 80 states have internal predecessors, (103), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 09:07:21,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 187 transitions. [2025-01-09 09:07:21,074 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 187 transitions. Word has length 141 [2025-01-09 09:07:21,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:07:21,075 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 187 transitions. [2025-01-09 09:07:21,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 09:07:21,075 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 187 transitions. [2025-01-09 09:07:21,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 09:07:21,081 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:07:21,081 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:07:21,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:07:21,081 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:07:21,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:07:21,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1216871165, now seen corresponding path program 1 times [2025-01-09 09:07:21,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:07:21,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784167655] [2025-01-09 09:07:21,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:07:21,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:07:21,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 09:07:21,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 09:07:21,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:07:21,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:07:21,470 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 09:07:21,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:07:21,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784167655] [2025-01-09 09:07:21,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784167655] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:07:21,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:07:21,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:07:21,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557685635] [2025-01-09 09:07:21,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:07:21,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:07:21,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:07:21,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:07:21,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:07:21,476 INFO L87 Difference]: Start difference. First operand 125 states and 187 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 09:07:21,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:07:21,637 INFO L93 Difference]: Finished difference Result 250 states and 375 transitions. [2025-01-09 09:07:21,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:07:21,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 141 [2025-01-09 09:07:21,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:07:21,641 INFO L225 Difference]: With dead ends: 250 [2025-01-09 09:07:21,641 INFO L226 Difference]: Without dead ends: 168 [2025-01-09 09:07:21,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:07:21,644 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 105 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:07:21,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 469 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:07:21,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-01-09 09:07:21,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 137. [2025-01-09 09:07:21,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 92 states have (on average 1.2934782608695652) internal successors, (119), 92 states have internal predecessors, (119), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 09:07:21,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 203 transitions. [2025-01-09 09:07:21,685 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 203 transitions. Word has length 141 [2025-01-09 09:07:21,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:07:21,685 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 203 transitions. [2025-01-09 09:07:21,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 09:07:21,686 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 203 transitions. [2025-01-09 09:07:21,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 09:07:21,687 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:07:21,687 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:07:21,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:07:21,687 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:07:21,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:07:21,687 INFO L85 PathProgramCache]: Analyzing trace with hash -927998210, now seen corresponding path program 1 times [2025-01-09 09:07:21,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:07:21,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139454072] [2025-01-09 09:07:21,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:07:21,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:07:21,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 09:07:21,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 09:07:21,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:07:21,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:07:22,438 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 09:07:22,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:07:22,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139454072] [2025-01-09 09:07:22,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139454072] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:07:22,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:07:22,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 09:07:22,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924555956] [2025-01-09 09:07:22,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:07:22,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 09:07:22,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:07:22,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 09:07:22,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 09:07:22,441 INFO L87 Difference]: Start difference. First operand 137 states and 203 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 09:07:23,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:07:23,142 INFO L93 Difference]: Finished difference Result 402 states and 598 transitions. [2025-01-09 09:07:23,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 09:07:23,143 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 143 [2025-01-09 09:07:23,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:07:23,146 INFO L225 Difference]: With dead ends: 402 [2025-01-09 09:07:23,146 INFO L226 Difference]: Without dead ends: 320 [2025-01-09 09:07:23,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-01-09 09:07:23,151 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 219 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 09:07:23,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 676 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 09:07:23,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-01-09 09:07:23,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 308. [2025-01-09 09:07:23,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 218 states have (on average 1.298165137614679) internal successors, (283), 219 states have internal predecessors, (283), 84 states have call successors, (84), 5 states have call predecessors, (84), 5 states have return successors, (84), 83 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 09:07:23,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 451 transitions. [2025-01-09 09:07:23,226 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 451 transitions. Word has length 143 [2025-01-09 09:07:23,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:07:23,227 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 451 transitions. [2025-01-09 09:07:23,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 09:07:23,227 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 451 transitions. [2025-01-09 09:07:23,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 09:07:23,230 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:07:23,230 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:07:23,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:07:23,230 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:07:23,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:07:23,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1832628969, now seen corresponding path program 1 times [2025-01-09 09:07:23,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:07:23,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116366519] [2025-01-09 09:07:23,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:07:23,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:07:23,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 09:07:23,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 09:07:23,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:07:23,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:07:23,359 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 09:07:23,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:07:23,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116366519] [2025-01-09 09:07:23,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116366519] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:07:23,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:07:23,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:07:23,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26927740] [2025-01-09 09:07:23,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:07:23,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:07:23,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:07:23,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:07:23,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:07:23,361 INFO L87 Difference]: Start difference. First operand 308 states and 451 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 09:07:23,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:07:23,474 INFO L93 Difference]: Finished difference Result 486 states and 720 transitions. [2025-01-09 09:07:23,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:07:23,475 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 144 [2025-01-09 09:07:23,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:07:23,477 INFO L225 Difference]: With dead ends: 486 [2025-01-09 09:07:23,478 INFO L226 Difference]: Without dead ends: 404 [2025-01-09 09:07:23,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:07:23,479 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 106 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:07:23,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 490 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:07:23,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-01-09 09:07:23,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 341. [2025-01-09 09:07:23,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 251 states have (on average 1.302788844621514) internal successors, (327), 252 states have internal predecessors, (327), 84 states have call successors, (84), 5 states have call predecessors, (84), 5 states have return successors, (84), 83 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 09:07:23,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 495 transitions. [2025-01-09 09:07:23,543 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 495 transitions. Word has length 144 [2025-01-09 09:07:23,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:07:23,544 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 495 transitions. [2025-01-09 09:07:23,544 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 09:07:23,544 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 495 transitions. [2025-01-09 09:07:23,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 09:07:23,545 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:07:23,545 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:07:23,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:07:23,545 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:07:23,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:07:23,546 INFO L85 PathProgramCache]: Analyzing trace with hash 72835712, now seen corresponding path program 1 times [2025-01-09 09:07:23,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:07:23,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525879038] [2025-01-09 09:07:23,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:07:23,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:07:23,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 09:07:23,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 09:07:23,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:07:23,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:07:24,329 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 63 proven. 51 refuted. 0 times theorem prover too weak. 726 trivial. 0 not checked. [2025-01-09 09:07:24,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:07:24,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525879038] [2025-01-09 09:07:24,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525879038] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:07:24,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427066071] [2025-01-09 09:07:24,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:07:24,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:07:24,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:07:24,332 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 09:07:24,333 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 09:07:24,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 09:07:24,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 09:07:24,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:07:24,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:07:24,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 09:07:24,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:07:25,331 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 309 proven. 90 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2025-01-09 09:07:25,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:07:26,336 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 114 proven. 57 refuted. 0 times theorem prover too weak. 669 trivial. 0 not checked. [2025-01-09 09:07:26,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427066071] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:07:26,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:07:26,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 12] total 32 [2025-01-09 09:07:26,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832734743] [2025-01-09 09:07:26,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:07:26,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-09 09:07:26,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:07:26,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-09 09:07:26,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2025-01-09 09:07:26,339 INFO L87 Difference]: Start difference. First operand 341 states and 495 transitions. Second operand has 32 states, 30 states have (on average 4.266666666666667) internal successors, (128), 28 states have internal predecessors, (128), 9 states have call successors, (63), 5 states have call predecessors, (63), 11 states have return successors, (63), 12 states have call predecessors, (63), 9 states have call successors, (63) [2025-01-09 09:07:30,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:07:30,167 INFO L93 Difference]: Finished difference Result 951 states and 1322 transitions. [2025-01-09 09:07:30,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2025-01-09 09:07:30,168 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 4.266666666666667) internal successors, (128), 28 states have internal predecessors, (128), 9 states have call successors, (63), 5 states have call predecessors, (63), 11 states have return successors, (63), 12 states have call predecessors, (63), 9 states have call successors, (63) Word has length 144 [2025-01-09 09:07:30,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:07:30,172 INFO L225 Difference]: With dead ends: 951 [2025-01-09 09:07:30,172 INFO L226 Difference]: Without dead ends: 678 [2025-01-09 09:07:30,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2903 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2010, Invalid=6920, Unknown=0, NotChecked=0, Total=8930 [2025-01-09 09:07:30,176 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 1249 mSDsluCounter, 1219 mSDsCounter, 0 mSdLazyCounter, 1880 mSolverCounterSat, 546 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1253 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 2426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 546 IncrementalHoareTripleChecker+Valid, 1880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 09:07:30,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1253 Valid, 1372 Invalid, 2426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [546 Valid, 1880 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 09:07:30,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2025-01-09 09:07:30,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 418. [2025-01-09 09:07:30,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 338 states have (on average 1.2958579881656804) internal successors, (438), 339 states have internal predecessors, (438), 65 states have call successors, (65), 14 states have call predecessors, (65), 14 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2025-01-09 09:07:30,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 568 transitions. [2025-01-09 09:07:30,239 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 568 transitions. Word has length 144 [2025-01-09 09:07:30,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:07:30,239 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 568 transitions. [2025-01-09 09:07:30,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 4.266666666666667) internal successors, (128), 28 states have internal predecessors, (128), 9 states have call successors, (63), 5 states have call predecessors, (63), 11 states have return successors, (63), 12 states have call predecessors, (63), 9 states have call successors, (63) [2025-01-09 09:07:30,240 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 568 transitions. [2025-01-09 09:07:30,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 09:07:30,242 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:07:30,242 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:07:30,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 09:07:30,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:07:30,446 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:07:30,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:07:30,446 INFO L85 PathProgramCache]: Analyzing trace with hash -267446781, now seen corresponding path program 1 times [2025-01-09 09:07:30,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:07:30,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605947647] [2025-01-09 09:07:30,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:07:30,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:07:30,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 09:07:30,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 09:07:30,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:07:30,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:07:30,755 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-01-09 09:07:30,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:07:30,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605947647] [2025-01-09 09:07:30,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605947647] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:07:30,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822766855] [2025-01-09 09:07:30,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:07:30,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:07:30,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:07:30,762 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 09:07:30,763 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 09:07:30,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 09:07:31,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 09:07:31,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:07:31,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:07:31,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 09:07:31,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:07:31,828 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 194 proven. 144 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2025-01-09 09:07:31,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:07:32,036 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-01-09 09:07:32,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822766855] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:07:32,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:07:32,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 6] total 21 [2025-01-09 09:07:32,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777510521] [2025-01-09 09:07:32,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:07:32,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 09:07:32,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:07:32,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 09:07:32,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2025-01-09 09:07:32,038 INFO L87 Difference]: Start difference. First operand 418 states and 568 transitions. Second operand has 21 states, 21 states have (on average 5.142857142857143) internal successors, (108), 20 states have internal predecessors, (108), 7 states have call successors, (63), 4 states have call predecessors, (63), 8 states have return successors, (63), 7 states have call predecessors, (63), 7 states have call successors, (63) [2025-01-09 09:07:32,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:07:32,485 INFO L93 Difference]: Finished difference Result 740 states and 1006 transitions. [2025-01-09 09:07:32,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 09:07:32,486 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.142857142857143) internal successors, (108), 20 states have internal predecessors, (108), 7 states have call successors, (63), 4 states have call predecessors, (63), 8 states have return successors, (63), 7 states have call predecessors, (63), 7 states have call successors, (63) Word has length 145 [2025-01-09 09:07:32,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:07:32,488 INFO L225 Difference]: With dead ends: 740 [2025-01-09 09:07:32,488 INFO L226 Difference]: Without dead ends: 396 [2025-01-09 09:07:32,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=521, Unknown=0, NotChecked=0, Total=702 [2025-01-09 09:07:32,489 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 252 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:07:32,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 876 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 09:07:32,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-01-09 09:07:32,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 385. [2025-01-09 09:07:32,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 305 states have (on average 1.278688524590164) internal successors, (390), 306 states have internal predecessors, (390), 65 states have call successors, (65), 14 states have call predecessors, (65), 14 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2025-01-09 09:07:32,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 520 transitions. [2025-01-09 09:07:32,518 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 520 transitions. Word has length 145 [2025-01-09 09:07:32,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:07:32,518 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 520 transitions. [2025-01-09 09:07:32,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.142857142857143) internal successors, (108), 20 states have internal predecessors, (108), 7 states have call successors, (63), 4 states have call predecessors, (63), 8 states have return successors, (63), 7 states have call predecessors, (63), 7 states have call successors, (63) [2025-01-09 09:07:32,519 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 520 transitions. [2025-01-09 09:07:32,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 09:07:32,519 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:07:32,520 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:07:32,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 09:07:32,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:07:32,724 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:07:32,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:07:32,725 INFO L85 PathProgramCache]: Analyzing trace with hash 824787543, now seen corresponding path program 1 times [2025-01-09 09:07:32,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:07:32,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834870916] [2025-01-09 09:07:32,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:07:32,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:07:32,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 09:07:32,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 09:07:32,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:07:32,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:07:33,110 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 66 proven. 96 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2025-01-09 09:07:33,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:07:33,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834870916] [2025-01-09 09:07:33,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834870916] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:07:33,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780647359] [2025-01-09 09:07:33,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:07:33,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:07:33,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:07:33,112 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 09:07:33,121 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 09:07:33,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 09:07:33,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 09:07:33,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:07:33,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:07:33,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-09 09:07:33,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:07:34,036 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 547 proven. 105 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2025-01-09 09:07:34,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:07:34,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780647359] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:07:34,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 09:07:34,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 19] total 22 [2025-01-09 09:07:34,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953953322] [2025-01-09 09:07:34,727 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 09:07:34,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 09:07:34,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:07:34,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 09:07:34,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=752, Unknown=0, NotChecked=0, Total=992 [2025-01-09 09:07:34,728 INFO L87 Difference]: Start difference. First operand 385 states and 520 transitions. Second operand has 22 states, 22 states have (on average 4.0) internal successors, (88), 20 states have internal predecessors, (88), 5 states have call successors, (39), 5 states have call predecessors, (39), 8 states have return successors, (39), 7 states have call predecessors, (39), 5 states have call successors, (39) [2025-01-09 09:07:36,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:07:36,608 INFO L93 Difference]: Finished difference Result 1037 states and 1359 transitions. [2025-01-09 09:07:36,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-01-09 09:07:36,608 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.0) internal successors, (88), 20 states have internal predecessors, (88), 5 states have call successors, (39), 5 states have call predecessors, (39), 8 states have return successors, (39), 7 states have call predecessors, (39), 5 states have call successors, (39) Word has length 146 [2025-01-09 09:07:36,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:07:36,612 INFO L225 Difference]: With dead ends: 1037 [2025-01-09 09:07:36,612 INFO L226 Difference]: Without dead ends: 855 [2025-01-09 09:07:36,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1706 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1478, Invalid=5002, Unknown=0, NotChecked=0, Total=6480 [2025-01-09 09:07:36,614 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 614 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 1847 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 1979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 09:07:36,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 1166 Invalid, 1979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1847 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 09:07:36,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2025-01-09 09:07:36,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 346. [2025-01-09 09:07:36,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 263 states have (on average 1.2167300380228137) internal successors, (320), 263 states have internal predecessors, (320), 63 states have call successors, (63), 19 states have call predecessors, (63), 19 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2025-01-09 09:07:36,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 446 transitions. [2025-01-09 09:07:36,652 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 446 transitions. Word has length 146 [2025-01-09 09:07:36,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:07:36,652 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 446 transitions. [2025-01-09 09:07:36,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.0) internal successors, (88), 20 states have internal predecessors, (88), 5 states have call successors, (39), 5 states have call predecessors, (39), 8 states have return successors, (39), 7 states have call predecessors, (39), 5 states have call successors, (39) [2025-01-09 09:07:36,653 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 446 transitions. [2025-01-09 09:07:36,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 09:07:36,653 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:07:36,653 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:07:36,662 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 09:07:36,854 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,SelfDestructingSolverStorable7 [2025-01-09 09:07:36,854 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:07:36,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:07:36,854 INFO L85 PathProgramCache]: Analyzing trace with hash -538722043, now seen corresponding path program 1 times [2025-01-09 09:07:36,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:07:36,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084173244] [2025-01-09 09:07:36,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:07:36,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:07:36,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 09:07:36,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 09:07:36,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:07:36,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 09:07:36,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1710332697] [2025-01-09 09:07:36,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:07:36,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:07:36,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:07:36,911 INFO L229 MonitoredProcess]: Starting monitored process 6 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 09:07:36,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 09:07:36,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 09:07:37,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 09:07:37,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:07:37,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:07:37,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 09:07:37,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:07:37,527 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 168 proven. 54 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2025-01-09 09:07:37,527 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:07:37,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:07:37,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084173244] [2025-01-09 09:07:37,796 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 09:07:37,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710332697] [2025-01-09 09:07:37,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710332697] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:07:37,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:07:37,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-01-09 09:07:37,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986487673] [2025-01-09 09:07:37,797 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 09:07:37,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 09:07:37,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:07:37,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 09:07:37,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 09:07:37,798 INFO L87 Difference]: Start difference. First operand 346 states and 446 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 09:07:37,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:07:38,000 INFO L93 Difference]: Finished difference Result 620 states and 802 transitions. [2025-01-09 09:07:38,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 09:07:38,000 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 146 [2025-01-09 09:07:38,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:07:38,002 INFO L225 Difference]: With dead ends: 620 [2025-01-09 09:07:38,002 INFO L226 Difference]: Without dead ends: 358 [2025-01-09 09:07:38,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-01-09 09:07:38,004 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 50 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:07:38,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 504 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:07:38,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-01-09 09:07:38,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 348. [2025-01-09 09:07:38,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 265 states have (on average 1.2150943396226415) internal successors, (322), 265 states have internal predecessors, (322), 63 states have call successors, (63), 19 states have call predecessors, (63), 19 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2025-01-09 09:07:38,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 448 transitions. [2025-01-09 09:07:38,039 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 448 transitions. Word has length 146 [2025-01-09 09:07:38,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:07:38,039 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 448 transitions. [2025-01-09 09:07:38,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 09:07:38,039 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 448 transitions. [2025-01-09 09:07:38,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 09:07:38,040 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:07:38,040 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:07:38,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 09:07:38,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:07:38,245 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:07:38,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:07:38,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1236285319, now seen corresponding path program 1 times [2025-01-09 09:07:38,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:07:38,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753262508] [2025-01-09 09:07:38,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:07:38,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:07:38,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 09:07:38,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 09:07:38,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:07:38,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 09:07:38,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [861743402] [2025-01-09 09:07:38,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:07:38,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:07:38,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:07:38,320 INFO L229 MonitoredProcess]: Starting monitored process 7 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 09:07:38,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 09:07:38,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 09:07:38,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 09:07:38,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:07:38,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 09:07:38,625 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 09:07:38,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 09:07:38,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 09:07:38,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:07:38,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 09:07:38,725 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 09:07:38,726 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 09:07:38,726 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 09:07:38,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 09:07:38,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 09:07:38,931 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:07:38,982 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 09:07:38,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:07:38 BoogieIcfgContainer [2025-01-09 09:07:38,985 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 09:07:38,985 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 09:07:38,985 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 09:07:38,985 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 09:07:38,986 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:07:19" (3/4) ... [2025-01-09 09:07:38,987 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 09:07:38,988 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 09:07:38,988 INFO L158 Benchmark]: Toolchain (without parser) took 20347.85ms. Allocated memory was 142.6MB in the beginning and 503.3MB in the end (delta: 360.7MB). Free memory was 110.9MB in the beginning and 279.2MB in the end (delta: -168.4MB). Peak memory consumption was 192.0MB. Max. memory is 16.1GB. [2025-01-09 09:07:38,988 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 09:07:38,988 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.42ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 95.8MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 09:07:38,989 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.51ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 92.5MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 09:07:38,989 INFO L158 Benchmark]: Boogie Preprocessor took 42.27ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 86.3MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 09:07:38,989 INFO L158 Benchmark]: RCFGBuilder took 354.97ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 59.0MB in the end (delta: 27.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 09:07:38,989 INFO L158 Benchmark]: TraceAbstraction took 19650.40ms. Allocated memory was 142.6MB in the beginning and 503.3MB in the end (delta: 360.7MB). Free memory was 59.0MB in the beginning and 279.4MB in the end (delta: -220.4MB). Peak memory consumption was 141.7MB. Max. memory is 16.1GB. [2025-01-09 09:07:38,989 INFO L158 Benchmark]: Witness Printer took 2.59ms. Allocated memory is still 503.3MB. Free memory was 279.4MB in the beginning and 279.2MB in the end (delta: 161.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 09:07:38,990 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 239.42ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 95.8MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.51ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 92.5MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.27ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 86.3MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 354.97ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 59.0MB in the end (delta: 27.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 19650.40ms. Allocated memory was 142.6MB in the beginning and 503.3MB in the end (delta: 360.7MB). Free memory was 59.0MB in the beginning and 279.4MB in the end (delta: -220.4MB). Peak memory consumption was 141.7MB. Max. memory is 16.1GB. * Witness Printer took 2.59ms. Allocated memory is still 503.3MB. Free memory was 279.4MB in the beginning and 279.2MB in the end (delta: 161.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 someBinaryFLOATComparisonOperation at line 115, overapproximation of someBinaryFLOATComparisonOperation at line 113, overapproximation of someBinaryFLOATComparisonOperation at line 133, overapproximation of someBinaryFLOATComparisonOperation at line 111, overapproximation of bitwiseOr at line 87, overapproximation of someBinaryDOUBLEComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 93, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 133. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 8; [L23] double var_1_3 = 0.875; [L24] unsigned short int var_1_4 = 49926; [L25] unsigned short int var_1_5 = 500; [L26] unsigned short int var_1_6 = 10; [L27] unsigned char var_1_8 = 64; [L28] unsigned short int var_1_9 = 5; [L29] unsigned char var_1_11 = 10; [L30] float var_1_12 = 0.19999999999999996; [L31] float var_1_13 = 9.2; [L32] float var_1_14 = 5.8; [L33] float var_1_15 = 31.25; [L34] unsigned char var_1_16 = 1; [L35] unsigned char var_1_17 = 0; [L36] unsigned char var_1_18 = 0; [L37] unsigned char var_1_19 = 1; [L38] unsigned short int var_1_20 = 256; [L39] unsigned short int var_1_21 = 23544; [L40] unsigned long int var_1_22 = 64; [L41] unsigned char last_1_var_1_8 = 64; [L42] unsigned char last_1_var_1_19 = 1; [L43] unsigned short int last_1_var_1_20 = 256; [L44] unsigned long int last_1_var_1_22 = 64; VAL [isInitial=0, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_3=7/8, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L137] isInitial = 1 [L138] FCALL initially() [L140] CALL updateLastVariables() [L127] last_1_var_1_8 = var_1_8 [L128] last_1_var_1_19 = var_1_19 [L129] last_1_var_1_20 = var_1_20 [L130] last_1_var_1_22 = var_1_22 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_3=7/8, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L140] RET updateLastVariables() [L141] CALL updateVariables() [L92] var_1_3 = __VERIFIER_nondet_double() [L93] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L93] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L94] CALL assume_abort_if_not(var_1_3 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L94] RET assume_abort_if_not(var_1_3 != 0.0F) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L95] var_1_4 = __VERIFIER_nondet_ushort() [L96] CALL assume_abort_if_not(var_1_4 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L96] RET assume_abort_if_not(var_1_4 >= 49150) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L97] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L97] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L98] var_1_5 = __VERIFIER_nondet_ushort() [L99] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_6=10, var_1_8=64, var_1_9=5] [L99] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_6=10, var_1_8=64, var_1_9=5] [L100] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=10, var_1_8=64, var_1_9=5] [L100] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=10, var_1_8=64, var_1_9=5] [L101] var_1_6 = __VERIFIER_nondet_ushort() [L102] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_8=64, var_1_9=5] [L102] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_8=64, var_1_9=5] [L103] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=5] [L103] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=5] [L104] var_1_9 = __VERIFIER_nondet_ushort() [L105] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64] [L105] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64] [L106] CALL assume_abort_if_not(var_1_9 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L106] RET assume_abort_if_not(var_1_9 <= 32767) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L107] var_1_11 = __VERIFIER_nondet_uchar() [L108] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L108] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L109] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L109] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L110] var_1_13 = __VERIFIER_nondet_float() [L111] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L111] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L112] var_1_14 = __VERIFIER_nondet_float() [L113] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L113] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L114] var_1_15 = __VERIFIER_nondet_float() [L115] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L115] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L116] var_1_17 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L117] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L118] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L118] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L119] var_1_18 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L120] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L121] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L121] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L122] var_1_21 = __VERIFIER_nondet_ushort() [L123] CALL assume_abort_if_not(var_1_21 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L123] RET assume_abort_if_not(var_1_21 >= 16383) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L124] CALL assume_abort_if_not(var_1_21 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L124] RET assume_abort_if_not(var_1_21 <= 32767) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L141] RET updateVariables() [L142] CALL step() [L48] COND TRUE (last_1_var_1_8 + last_1_var_1_20) > (((((last_1_var_1_8) < 0 ) ? -(last_1_var_1_8) : (last_1_var_1_8))) + last_1_var_1_22) [L49] var_1_16 = (last_1_var_1_19 || var_1_17) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L53] unsigned short int stepLocal_0 = var_1_5; VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_0=16383, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L54] COND FALSE !(stepLocal_0 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L59] unsigned short int stepLocal_2 = var_1_4; VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_2=131070, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L60] COND TRUE var_1_8 <= stepLocal_2 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L61] COND TRUE \read(var_1_16) [L62] var_1_20 = (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=32831, var_1_21=32767, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L69] COND TRUE \read(var_1_16) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=32831, var_1_21=32767, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L70] COND FALSE !((var_1_8 * var_1_8) < var_1_11) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=32831, var_1_21=32767, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L76] COND TRUE var_1_12 >= (1.3 / var_1_3) [L77] var_1_1 = ((var_1_4 - var_1_8) - var_1_8) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=65406, var_1_20=32831, var_1_21=32767, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L81] unsigned char stepLocal_1 = var_1_1 < 64; VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_1=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=65406, var_1_20=32831, var_1_21=32767, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L82] COND TRUE \read(var_1_16) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_1=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=65406, var_1_20=32831, var_1_21=32767, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L83] COND TRUE stepLocal_1 || var_1_16 [L84] var_1_19 = var_1_17 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=65406, var_1_20=32831, var_1_21=32767, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L87] EXPR 2 ^ var_1_20 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=65406, var_1_20=32831, var_1_21=32767, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L87] EXPR (((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20)) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=65406, var_1_20=32831, var_1_21=32767, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L87] COND FALSE !(var_1_1 >= (((((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20))))) [L142] RET step() [L143] CALL, EXPR property() [L133] EXPR (((((((var_1_12 >= (1.3 / var_1_3)) ? (var_1_1 == ((unsigned short int) ((var_1_4 - var_1_8) - var_1_8))) : (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_4)) ? (var_1_8) : (var_1_4)))))) && ((var_1_5 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) ? (last_1_var_1_19 ? (var_1_8 == ((unsigned char) var_1_11)) : 1) : 1)) && (var_1_16 ? (((var_1_8 * var_1_8) < var_1_11) ? (var_1_12 == ((float) ((((((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) > (var_1_15)) ? (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) : (var_1_15))))) : 1) : (var_1_12 == ((float) var_1_14)))) && (((last_1_var_1_8 + last_1_var_1_20) > (((((last_1_var_1_8) < 0 ) ? -(last_1_var_1_8) : (last_1_var_1_8))) + last_1_var_1_22)) ? (var_1_16 == ((unsigned char) (last_1_var_1_19 || var_1_17))) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_16 ? (((var_1_1 < 64) || var_1_16) ? (var_1_19 == ((unsigned char) var_1_17)) : 1) : 1)) && ((var_1_8 <= var_1_4) ? (var_1_16 ? (var_1_20 == ((unsigned short int) (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))))) : (var_1_20 == ((unsigned short int) 16))) : (var_1_20 == ((unsigned short int) (var_1_4 - var_1_8))))) && ((var_1_1 >= (((((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20))))) ? (var_1_22 == ((unsigned long int) var_1_1)) : 1) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=65406, var_1_20=32831, var_1_21=32767, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L133-L134] return (((((((var_1_12 >= (1.3 / var_1_3)) ? (var_1_1 == ((unsigned short int) ((var_1_4 - var_1_8) - var_1_8))) : (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_4)) ? (var_1_8) : (var_1_4)))))) && ((var_1_5 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) ? (last_1_var_1_19 ? (var_1_8 == ((unsigned char) var_1_11)) : 1) : 1)) && (var_1_16 ? (((var_1_8 * var_1_8) < var_1_11) ? (var_1_12 == ((float) ((((((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) > (var_1_15)) ? (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) : (var_1_15))))) : 1) : (var_1_12 == ((float) var_1_14)))) && (((last_1_var_1_8 + last_1_var_1_20) > (((((last_1_var_1_8) < 0 ) ? -(last_1_var_1_8) : (last_1_var_1_8))) + last_1_var_1_22)) ? (var_1_16 == ((unsigned char) (last_1_var_1_19 || var_1_17))) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_16 ? (((var_1_1 < 64) || var_1_16) ? (var_1_19 == ((unsigned char) var_1_17)) : 1) : 1)) && ((var_1_8 <= var_1_4) ? (var_1_16 ? (var_1_20 == ((unsigned short int) (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))))) : (var_1_20 == ((unsigned short int) 16))) : (var_1_20 == ((unsigned short int) (var_1_4 - var_1_8))))) && ((var_1_1 >= (((((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20))))) ? (var_1_22 == ((unsigned long int) var_1_1)) : 1) ; [L143] RET, EXPR property() [L143] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=65406, var_1_20=32831, var_1_21=32767, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=65406, var_1_20=32831, var_1_21=32767, var_1_22=64, var_1_4=131070, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.6s, OverallIterations: 10, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2703 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2689 mSDsluCounter, 6021 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4732 mSDsCounter, 934 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5248 IncrementalHoareTripleChecker+Invalid, 6182 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 934 mSolverCounterUnsat, 1289 mSDtfsCounter, 5248 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1429 GetRequests, 1200 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4789 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=418occurred in iteration=6, InterpolantAutomatonStates: 190, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 939 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 2303 NumberOfCodeBlocks, 2303 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2139 ConstructedInterpolants, 0 QuantifiedInterpolants, 13972 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1661 ConjunctsInSsa, 93 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 11855/12600 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 09:07:39,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-47.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 5092b9874183dfc38681d21126dd96b4ef139ca1702e11549aa108a46ad20342 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:07:40,974 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:07:41,049 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 09:07:41,055 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:07:41,055 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:07:41,104 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:07:41,105 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:07:41,105 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:07:41,105 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:07:41,105 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:07:41,105 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:07:41,105 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:07:41,105 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:07:41,106 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:07:41,106 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:07:41,106 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:07:41,106 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:07:41,106 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:07:41,106 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:07:41,106 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:07:41,106 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:07:41,106 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:07:41,106 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:07:41,106 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 09:07:41,106 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 09:07:41,106 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 09:07:41,106 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:07:41,106 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:07:41,106 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:07:41,115 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:07:41,116 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:07:41,119 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:07:41,119 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:07:41,120 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:07:41,120 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:07:41,120 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:07:41,120 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:07:41,120 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:07:41,120 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:07:41,120 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:07:41,120 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:07:41,120 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:07:41,120 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:07:41,120 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:07:41,120 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 09:07:41,120 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 09:07:41,120 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:07:41,120 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:07:41,120 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:07:41,120 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:07:41,120 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 -> 5092b9874183dfc38681d21126dd96b4ef139ca1702e11549aa108a46ad20342 [2025-01-09 09:07:41,440 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:07:41,452 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:07:41,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:07:41,455 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:07:41,455 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:07:41,457 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-47.i [2025-01-09 09:07:42,615 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fa2962a39/db54c649f9a343e2b62379f9bbaa4d58/FLAG3ca9b5f67 [2025-01-09 09:07:42,888 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:07:42,889 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-47.i [2025-01-09 09:07:42,895 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fa2962a39/db54c649f9a343e2b62379f9bbaa4d58/FLAG3ca9b5f67 [2025-01-09 09:07:43,221 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fa2962a39/db54c649f9a343e2b62379f9bbaa4d58 [2025-01-09 09:07:43,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:07:43,225 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:07:43,227 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:07:43,227 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:07:43,230 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:07:43,231 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:07:43" (1/1) ... [2025-01-09 09:07:43,231 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d75a94b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:43, skipping insertion in model container [2025-01-09 09:07:43,231 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:07:43" (1/1) ... [2025-01-09 09:07:43,247 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:07:43,346 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-47.i[913,926] [2025-01-09 09:07:43,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:07:43,402 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:07:43,410 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-47.i[913,926] [2025-01-09 09:07:43,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:07:43,440 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:07:43,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:43 WrapperNode [2025-01-09 09:07:43,441 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:07:43,442 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:07:43,442 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:07:43,442 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:07:43,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:43" (1/1) ... [2025-01-09 09:07:43,453 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:43" (1/1) ... [2025-01-09 09:07:43,475 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2025-01-09 09:07:43,480 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:07:43,480 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:07:43,480 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:07:43,480 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:07:43,487 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:43" (1/1) ... [2025-01-09 09:07:43,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:43" (1/1) ... [2025-01-09 09:07:43,491 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:43" (1/1) ... [2025-01-09 09:07:43,509 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 09:07:43,511 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:43" (1/1) ... [2025-01-09 09:07:43,512 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:43" (1/1) ... [2025-01-09 09:07:43,521 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:43" (1/1) ... [2025-01-09 09:07:43,522 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:43" (1/1) ... [2025-01-09 09:07:43,528 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:43" (1/1) ... [2025-01-09 09:07:43,529 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:43" (1/1) ... [2025-01-09 09:07:43,530 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:43" (1/1) ... [2025-01-09 09:07:43,536 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:07:43,537 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:07:43,540 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:07:43,540 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:07:43,541 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:43" (1/1) ... [2025-01-09 09:07:43,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:07:43,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:07:43,566 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 09:07:43,577 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 09:07:43,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:07:43,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 09:07:43,593 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:07:43,593 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:07:43,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:07:43,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:07:43,658 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:07:43,659 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:07:53,211 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 09:07:53,212 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:07:53,219 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:07:53,219 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:07:53,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:07:53 BoogieIcfgContainer [2025-01-09 09:07:53,220 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:07:53,221 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:07:53,222 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:07:53,225 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:07:53,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:07:43" (1/3) ... [2025-01-09 09:07:53,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@506ce352 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:07:53, skipping insertion in model container [2025-01-09 09:07:53,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:43" (2/3) ... [2025-01-09 09:07:53,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@506ce352 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:07:53, skipping insertion in model container [2025-01-09 09:07:53,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:07:53" (3/3) ... [2025-01-09 09:07:53,227 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-47.i [2025-01-09 09:07:53,237 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:07:53,239 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-47.i that has 2 procedures, 65 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:07:53,282 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:07:53,297 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;@300d4c46, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:07:53,297 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:07:53,300 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 09:07:53,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 09:07:53,308 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:07:53,309 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:07:53,309 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:07:53,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:07:53,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1610966729, now seen corresponding path program 1 times [2025-01-09 09:07:53,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:07:53,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1694404705] [2025-01-09 09:07:53,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:07:53,325 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 09:07:53,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:07:53,328 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 09:07:53,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 09:07:53,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 09:07:54,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 09:07:54,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:07:54,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:07:54,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:07:54,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:07:54,124 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2025-01-09 09:07:54,125 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:07:54,125 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:07:54,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1694404705] [2025-01-09 09:07:54,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1694404705] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:07:54,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:07:54,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 09:07:54,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914802722] [2025-01-09 09:07:54,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:07:54,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:07:54,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:07:54,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:07:54,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:07:54,143 INFO L87 Difference]: Start difference. First operand has 65 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 09:07:54,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:07:54,158 INFO L93 Difference]: Finished difference Result 124 states and 212 transitions. [2025-01-09 09:07:54,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:07:54,160 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 136 [2025-01-09 09:07:54,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:07:54,163 INFO L225 Difference]: With dead ends: 124 [2025-01-09 09:07:54,164 INFO L226 Difference]: Without dead ends: 62 [2025-01-09 09:07:54,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 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 09:07:54,167 INFO L435 NwaCegarLoop]: 93 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, 93 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 09:07:54,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:07:54,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-01-09 09:07:54,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-01-09 09:07:54,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 09:07:54,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 93 transitions. [2025-01-09 09:07:54,193 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 93 transitions. Word has length 136 [2025-01-09 09:07:54,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:07:54,193 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 93 transitions. [2025-01-09 09:07:54,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 09:07:54,194 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 93 transitions. [2025-01-09 09:07:54,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 09:07:54,196 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:07:54,196 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:07:54,214 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 09:07:54,400 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 09:07:54,400 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:07:54,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:07:54,401 INFO L85 PathProgramCache]: Analyzing trace with hash -2113498225, now seen corresponding path program 1 times [2025-01-09 09:07:54,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:07:54,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [477253316] [2025-01-09 09:07:54,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:07:54,402 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 09:07:54,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:07:54,404 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 09:07:54,406 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 09:07:54,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 09:07:55,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 09:07:55,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:07:55,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:07:55,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 09:07:55,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:08:02,652 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 09:08:02,653 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:08:02,653 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:08:02,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [477253316] [2025-01-09 09:08:02,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [477253316] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:08:02,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:08:02,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:08:02,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890750591] [2025-01-09 09:08:02,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:08:02,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:08:02,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:08:02,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:08:02,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:08:02,655 INFO L87 Difference]: Start difference. First operand 62 states and 93 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 09:08:07,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:08:11,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:08:15,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.96s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:08:19,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:08:24,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:08:28,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:08:28,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:08:28,388 INFO L93 Difference]: Finished difference Result 184 states and 279 transitions. [2025-01-09 09:08:28,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:08:28,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 136 [2025-01-09 09:08:28,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:08:28,467 INFO L225 Difference]: With dead ends: 184 [2025-01-09 09:08:28,467 INFO L226 Difference]: Without dead ends: 125 [2025-01-09 09:08:28,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:08:28,468 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 61 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 43 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.6s IncrementalHoareTripleChecker+Time [2025-01-09 09:08:28,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 250 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 20 Invalid, 5 Unknown, 0 Unchecked, 25.6s Time] [2025-01-09 09:08:28,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-01-09 09:08:28,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 102. [2025-01-09 09:08:28,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 09:08:28,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 153 transitions. [2025-01-09 09:08:28,497 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 153 transitions. Word has length 136 [2025-01-09 09:08:28,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:08:28,498 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 153 transitions. [2025-01-09 09:08:28,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 09:08:28,498 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 153 transitions. [2025-01-09 09:08:28,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 09:08:28,499 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:08:28,499 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:08:28,521 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 (3)] Forceful destruction successful, exit code 0 [2025-01-09 09:08:28,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 09:08:28,707 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:08:28,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:08:28,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1102380975, now seen corresponding path program 1 times [2025-01-09 09:08:28,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:08:28,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [893152178] [2025-01-09 09:08:28,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:08:28,710 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 09:08:28,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:08:28,713 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 09:08:28,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 09:08:28,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 09:08:29,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 09:08:29,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:08:29,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:08:29,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 09:08:29,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:08:31,789 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 168 proven. 54 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2025-01-09 09:08:31,789 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:08:32,348 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:08:32,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [893152178] [2025-01-09 09:08:32,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [893152178] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:08:32,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [717973521] [2025-01-09 09:08:32,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:08:32,348 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 09:08:32,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 09:08:32,351 INFO L229 MonitoredProcess]: Starting monitored process 5 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 09:08:32,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-01-09 09:08:32,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 09:08:33,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 09:08:33,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:08:33,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:08:33,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 09:08:33,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:08:36,772 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 09:08:36,773 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:08:36,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [717973521] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:08:36,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:08:36,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-01-09 09:08:36,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901830433] [2025-01-09 09:08:36,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:08:36,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:08:36,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:08:36,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:08:36,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-01-09 09:08:36,775 INFO L87 Difference]: Start difference. First operand 102 states and 153 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 09:08:41,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:08:45,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:08:49,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []