./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-5.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 3ee41a83450d717782acb2357b704d06460d91e430d71e00e3cee4b83fe11825 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:25:41,366 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:25:41,417 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 10:25:41,421 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:25:41,421 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:25:41,440 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:25:41,440 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:25:41,441 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:25:41,441 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:25:41,441 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:25:41,441 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:25:41,441 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:25:41,441 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:25:41,441 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:25:41,442 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:25:41,442 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:25:41,442 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:25:41,442 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:25:41,442 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 10:25:41,442 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:25:41,442 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:25:41,442 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:25:41,442 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:25:41,442 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:25:41,442 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:25:41,443 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:25:41,443 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:25:41,443 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:25:41,443 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:25:41,443 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:25:41,443 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:25:41,443 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:25:41,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:25:41,443 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:25:41,444 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:25:41,444 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:25:41,444 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:25:41,444 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 10:25:41,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 10:25:41,444 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:25:41,444 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:25:41,444 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:25:41,444 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:25:41,444 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/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 -> 3ee41a83450d717782acb2357b704d06460d91e430d71e00e3cee4b83fe11825 [2025-03-08 10:25:41,649 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:25:41,654 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:25:41,656 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:25:41,657 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:25:41,658 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:25:41,658 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-5.i [2025-03-08 10:25:42,819 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f17f5044/07db2c7c82684874bcdade4b97e85c0c/FLAG267aebdbb [2025-03-08 10:25:43,065 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:25:43,070 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-5.i [2025-03-08 10:25:43,082 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f17f5044/07db2c7c82684874bcdade4b97e85c0c/FLAG267aebdbb [2025-03-08 10:25:43,376 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f17f5044/07db2c7c82684874bcdade4b97e85c0c [2025-03-08 10:25:43,378 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:25:43,380 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:25:43,381 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:25:43,381 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:25:43,384 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:25:43,385 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:25:43" (1/1) ... [2025-03-08 10:25:43,386 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5540f65f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:25:43, skipping insertion in model container [2025-03-08 10:25:43,387 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:25:43" (1/1) ... [2025-03-08 10:25:43,402 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:25:43,494 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-5.i[912,925] [2025-03-08 10:25:43,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:25:43,562 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:25:43,570 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-5.i[912,925] [2025-03-08 10:25:43,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:25:43,608 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:25:43,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:25:43 WrapperNode [2025-03-08 10:25:43,609 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:25:43,610 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:25:43,610 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:25:43,610 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:25:43,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:25:43" (1/1) ... [2025-03-08 10:25:43,621 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:25:43" (1/1) ... [2025-03-08 10:25:43,643 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2025-03-08 10:25:43,644 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:25:43,645 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:25:43,645 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:25:43,645 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:25:43,651 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:25:43" (1/1) ... [2025-03-08 10:25:43,651 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:25:43" (1/1) ... [2025-03-08 10:25:43,655 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:25:43" (1/1) ... [2025-03-08 10:25:43,680 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-03-08 10:25:43,680 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:25:43" (1/1) ... [2025-03-08 10:25:43,680 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:25:43" (1/1) ... [2025-03-08 10:25:43,685 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:25:43" (1/1) ... [2025-03-08 10:25:43,688 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:25:43" (1/1) ... [2025-03-08 10:25:43,689 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:25:43" (1/1) ... [2025-03-08 10:25:43,690 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:25:43" (1/1) ... [2025-03-08 10:25:43,691 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:25:43,692 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:25:43,692 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:25:43,692 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:25:43,693 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:25:43" (1/1) ... [2025-03-08 10:25:43,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:25:43,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:25:43,717 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 10:25:43,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 10:25:43,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:25:43,734 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:25:43,735 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:25:43,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 10:25:43,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:25:43,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:25:43,786 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:25:43,787 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:25:44,029 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-08 10:25:44,030 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:25:44,039 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:25:44,039 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:25:44,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:25:44 BoogieIcfgContainer [2025-03-08 10:25:44,039 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:25:44,041 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:25:44,041 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:25:44,045 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:25:44,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:25:43" (1/3) ... [2025-03-08 10:25:44,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a39ce47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:25:44, skipping insertion in model container [2025-03-08 10:25:44,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:25:43" (2/3) ... [2025-03-08 10:25:44,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a39ce47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:25:44, skipping insertion in model container [2025-03-08 10:25:44,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:25:44" (3/3) ... [2025-03-08 10:25:44,047 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-5.i [2025-03-08 10:25:44,057 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:25:44,059 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-5.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:25:44,093 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:25:44,102 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;@16e6428, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:25:44,103 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:25:44,105 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 10:25:44,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 10:25:44,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:25:44,112 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:25:44,112 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:25:44,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:25:44,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1369619023, now seen corresponding path program 1 times [2025-03-08 10:25:44,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:25:44,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924510177] [2025-03-08 10:25:44,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:25:44,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:25:44,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 10:25:44,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 10:25:44,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:25:44,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:25:44,329 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-08 10:25:44,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:25:44,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924510177] [2025-03-08 10:25:44,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924510177] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:25:44,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008650586] [2025-03-08 10:25:44,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:25:44,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:25:44,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:25:44,333 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:25:44,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 10:25:44,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 10:25:44,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 10:25:44,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:25:44,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:25:44,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:25:44,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:25:44,470 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-08 10:25:44,470 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:25:44,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008650586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:25:44,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:25:44,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 10:25:44,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122929172] [2025-03-08 10:25:44,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:25:44,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:25:44,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:25:44,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:25:44,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:25:44,491 INFO L87 Difference]: Start difference. First operand has 53 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 10:25:44,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:25:44,508 INFO L93 Difference]: Finished difference Result 100 states and 164 transitions. [2025-03-08 10:25:44,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:25:44,510 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 102 [2025-03-08 10:25:44,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:25:44,514 INFO L225 Difference]: With dead ends: 100 [2025-03-08 10:25:44,514 INFO L226 Difference]: Without dead ends: 50 [2025-03-08 10:25:44,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 103 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-03-08 10:25:44,520 INFO L435 NwaCegarLoop]: 71 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, 71 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-03-08 10:25:44,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:25:44,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-08 10:25:44,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-08 10:25:44,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 10:25:44,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 71 transitions. [2025-03-08 10:25:44,544 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 71 transitions. Word has length 102 [2025-03-08 10:25:44,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:25:44,544 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 71 transitions. [2025-03-08 10:25:44,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 10:25:44,545 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 71 transitions. [2025-03-08 10:25:44,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 10:25:44,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:25:44,550 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:25:44,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 10:25:44,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 10:25:44,751 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:25:44,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:25:44,752 INFO L85 PathProgramCache]: Analyzing trace with hash -604265619, now seen corresponding path program 1 times [2025-03-08 10:25:44,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:25:44,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353145995] [2025-03-08 10:25:44,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:25:44,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:25:44,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 10:25:44,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 10:25:44,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:25:44,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:25:46,428 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 66 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2025-03-08 10:25:46,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:25:46,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353145995] [2025-03-08 10:25:46,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353145995] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:25:46,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318622845] [2025-03-08 10:25:46,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:25:46,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:25:46,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:25:46,432 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:25:46,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 10:25:46,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 10:25:46,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 10:25:46,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:25:46,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:25:46,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-08 10:25:46,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:25:48,129 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 150 proven. 120 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-03-08 10:25:48,131 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:25:49,154 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 69 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2025-03-08 10:25:49,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318622845] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 10:25:49,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 10:25:49,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 11] total 35 [2025-03-08 10:25:49,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515517519] [2025-03-08 10:25:49,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 10:25:49,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-08 10:25:49,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:25:49,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-08 10:25:49,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=969, Unknown=0, NotChecked=0, Total=1190 [2025-03-08 10:25:49,160 INFO L87 Difference]: Start difference. First operand 50 states and 71 transitions. Second operand has 35 states, 34 states have (on average 2.911764705882353) internal successors, (99), 32 states have internal predecessors, (99), 12 states have call successors, (45), 6 states have call predecessors, (45), 10 states have return successors, (45), 9 states have call predecessors, (45), 12 states have call successors, (45) [2025-03-08 10:25:51,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:25:51,423 INFO L93 Difference]: Finished difference Result 284 states and 368 transitions. [2025-03-08 10:25:51,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-03-08 10:25:51,424 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.911764705882353) internal successors, (99), 32 states have internal predecessors, (99), 12 states have call successors, (45), 6 states have call predecessors, (45), 10 states have return successors, (45), 9 states have call predecessors, (45), 12 states have call successors, (45) Word has length 102 [2025-03-08 10:25:51,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:25:51,426 INFO L225 Difference]: With dead ends: 284 [2025-03-08 10:25:51,427 INFO L226 Difference]: Without dead ends: 237 [2025-03-08 10:25:51,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1997 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1393, Invalid=5579, Unknown=0, NotChecked=0, Total=6972 [2025-03-08 10:25:51,430 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 509 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 10:25:51,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 572 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 10:25:51,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-03-08 10:25:51,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 126. [2025-03-08 10:25:51,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 87 states have (on average 1.206896551724138) internal successors, (105), 87 states have internal predecessors, (105), 30 states have call successors, (30), 8 states have call predecessors, (30), 8 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 10:25:51,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 165 transitions. [2025-03-08 10:25:51,456 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 165 transitions. Word has length 102 [2025-03-08 10:25:51,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:25:51,458 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 165 transitions. [2025-03-08 10:25:51,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.911764705882353) internal successors, (99), 32 states have internal predecessors, (99), 12 states have call successors, (45), 6 states have call predecessors, (45), 10 states have return successors, (45), 9 states have call predecessors, (45), 12 states have call successors, (45) [2025-03-08 10:25:51,459 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 165 transitions. [2025-03-08 10:25:51,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 10:25:51,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:25:51,462 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:25:51,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 10:25:51,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 10:25:51,663 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:25:51,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:25:51,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1491769300, now seen corresponding path program 1 times [2025-03-08 10:25:51,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:25:51,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687077061] [2025-03-08 10:25:51,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:25:51,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:25:51,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 10:25:51,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 10:25:51,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:25:51,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 10:25:51,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1180250949] [2025-03-08 10:25:51,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:25:51,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:25:51,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:25:51,744 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:25:51,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 10:25:51,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 10:25:52,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 10:25:52,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:25:52,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 10:25:52,058 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 10:25:52,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 10:25:52,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 10:25:52,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:25:52,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 10:25:52,188 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 10:25:52,188 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 10:25:52,189 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 10:25:52,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 10:25:52,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:25:52,393 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 10:25:52,446 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 10:25:52,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:25:52 BoogieIcfgContainer [2025-03-08 10:25:52,449 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 10:25:52,449 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 10:25:52,449 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 10:25:52,450 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 10:25:52,450 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:25:44" (3/4) ... [2025-03-08 10:25:52,452 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 10:25:52,452 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 10:25:52,453 INFO L158 Benchmark]: Toolchain (without parser) took 9073.23ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 105.6MB in the beginning and 153.6MB in the end (delta: -48.0MB). Peak memory consumption was 120.6MB. Max. memory is 16.1GB. [2025-03-08 10:25:52,453 INFO L158 Benchmark]: CDTParser took 0.93ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:25:52,453 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.99ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 92.0MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 10:25:52,453 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.75ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 87.5MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:25:52,454 INFO L158 Benchmark]: Boogie Preprocessor took 46.66ms. Allocated memory is still 142.6MB. Free memory was 87.5MB in the beginning and 81.2MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 10:25:52,454 INFO L158 Benchmark]: IcfgBuilder took 347.16ms. Allocated memory is still 142.6MB. Free memory was 81.2MB in the beginning and 61.2MB in the end (delta: 20.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 10:25:52,454 INFO L158 Benchmark]: TraceAbstraction took 8407.78ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 60.0MB in the beginning and 153.6MB in the end (delta: -93.6MB). Peak memory consumption was 78.7MB. Max. memory is 16.1GB. [2025-03-08 10:25:52,454 INFO L158 Benchmark]: Witness Printer took 2.91ms. Allocated memory is still 310.4MB. Free memory is still 153.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:25:52,455 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.93ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.99ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 92.0MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.75ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 87.5MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.66ms. Allocated memory is still 142.6MB. Free memory was 87.5MB in the beginning and 81.2MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 347.16ms. Allocated memory is still 142.6MB. Free memory was 81.2MB in the beginning and 61.2MB in the end (delta: 20.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8407.78ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 60.0MB in the beginning and 153.6MB in the end (delta: -93.6MB). Peak memory consumption was 78.7MB. Max. memory is 16.1GB. * Witness Printer took 2.91ms. Allocated memory is still 310.4MB. Free memory is still 153.6MB. 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 someBinaryArithmeticDOUBLEoperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 100, overapproximation of someBinaryDOUBLEComparisonOperation at line 110, overapproximation of someBinaryDOUBLEComparisonOperation at line 98. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 10; [L23] unsigned char var_1_4 = 128; [L24] unsigned char var_1_5 = 1; [L25] unsigned long int var_1_6 = 5; [L26] unsigned char var_1_9 = 0; [L27] unsigned char var_1_10 = 64; [L28] unsigned char var_1_11 = 64; [L29] unsigned short int var_1_12 = 25; [L30] unsigned short int var_1_14 = 31408; [L31] double var_1_15 = 64.375; [L32] double var_1_16 = 10.85; [L33] double var_1_17 = 128.8; [L34] double var_1_18 = 2.6; [L35] unsigned char var_1_19 = 0; [L36] unsigned char var_1_20 = 0; [L37] signed short int var_1_21 = -64; [L38] unsigned short int last_1_var_1_12 = 25; [L39] double last_1_var_1_15 = 64.375; VAL [isInitial=0, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=128, var_1_5=1, var_1_6=5, var_1_9=0] [L114] isInitial = 1 [L115] FCALL initially() [L116] COND TRUE 1 [L117] CALL updateLastVariables() [L106] last_1_var_1_12 = var_1_12 [L107] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=128, var_1_5=1, var_1_6=5, var_1_9=0] [L117] RET updateLastVariables() [L118] CALL updateVariables() [L80] var_1_4 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_4 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=1, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=1, var_1_6=5, var_1_9=0] [L81] RET assume_abort_if_not(var_1_4 >= 127) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=1, var_1_6=5, var_1_9=0] [L82] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=1, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=1, var_1_6=5, var_1_9=0] [L82] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=1, var_1_6=5, var_1_9=0] [L83] var_1_5 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_6=5, var_1_9=0] [L84] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_6=5, var_1_9=0] [L85] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L85] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L86] var_1_10 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_10 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L87] RET assume_abort_if_not(var_1_10 >= 63) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L88] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L88] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L89] var_1_11 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_11 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=-192, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=-192, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L90] RET assume_abort_if_not(var_1_11 >= 64) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=-192, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L91] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=-192, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=-192, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L91] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=-192, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L92] var_1_14 = __VERIFIER_nondet_ushort() [L93] CALL assume_abort_if_not(var_1_14 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=-192, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=-192, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L93] RET assume_abort_if_not(var_1_14 >= 16383) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=-192, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L94] CALL assume_abort_if_not(var_1_14 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=-192, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=-192, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L94] RET assume_abort_if_not(var_1_14 <= 32767) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=-192, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L95] var_1_16 = __VERIFIER_nondet_double() [L96] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=-192, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=-192, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L96] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=-192, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L97] var_1_17 = __VERIFIER_nondet_double() [L98] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=-192, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=-192, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L98] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=-192, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L99] var_1_18 = __VERIFIER_nondet_double() [L100] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=-192, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=-192, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L100] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=-192, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L101] var_1_20 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=-192, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=-192, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L102] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=-192, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L103] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=-192, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=-192, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L103] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=-192, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L118] RET updateVariables() [L119] CALL step() [L43] COND FALSE !(last_1_var_1_12 > var_1_4) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=-192, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L48] COND FALSE !(((- 64) + var_1_6) == var_1_6) [L51] var_1_1 = (((((128) < (var_1_4)) ? (128) : (var_1_4))) - 64) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=-192, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L53] COND TRUE var_1_5 == (var_1_6 / var_1_4) [L54] var_1_9 = ((((var_1_5) < (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) ? (var_1_5) : (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))))) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=-192, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L58] var_1_21 = var_1_10 [L59] unsigned long int stepLocal_3 = var_1_6; [L60] unsigned char stepLocal_2 = var_1_4; VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, stepLocal_2=129, stepLocal_3=5, var_1_10=319, var_1_11=-192, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=63, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L61] COND FALSE !(stepLocal_2 < var_1_1) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, stepLocal_3=5, var_1_10=319, var_1_11=-192, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=63, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L66] unsigned long int stepLocal_0 = (((var_1_6) > (var_1_4)) ? (var_1_6) : (var_1_4)); VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, stepLocal_0=129, stepLocal_3=5, var_1_10=319, var_1_11=-192, var_1_12=25, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=63, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L67] COND TRUE ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) <= stepLocal_0 [L68] var_1_12 = ((var_1_14 - var_1_5) + ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, stepLocal_3=5, var_1_10=319, var_1_11=-192, var_1_12=16388, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=63, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L72] signed long int stepLocal_1 = ~ (var_1_5 * var_1_1); VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, stepLocal_1=-1, stepLocal_3=5, var_1_10=319, var_1_11=-192, var_1_12=16388, var_1_14=16383, var_1_15=515/8, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=63, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L73] COND TRUE stepLocal_1 <= var_1_12 [L74] var_1_15 = (((((5.25 - var_1_16)) > (var_1_17)) ? ((5.25 - var_1_16)) : (var_1_17))) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, stepLocal_3=5, var_1_10=319, var_1_11=-192, var_1_12=16388, var_1_14=16383, var_1_15=2, var_1_17=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=63, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L119] RET step() [L120] CALL, EXPR property() [L110-L111] return (((((((((- 64) + var_1_6) == var_1_6) ? (var_1_1 == ((unsigned char) (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) - var_1_5))) : (var_1_1 == ((unsigned char) (((((128) < (var_1_4)) ? (128) : (var_1_4))) - 64)))) && ((last_1_var_1_12 > var_1_4) ? (((- last_1_var_1_15) < last_1_var_1_15) ? (var_1_6 == ((unsigned long int) 10u)) : 1) : 1)) && ((var_1_5 == (var_1_6 / var_1_4)) ? (var_1_9 == ((unsigned char) ((((var_1_5) < (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) ? (var_1_5) : (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))))))) : (var_1_9 == ((unsigned char) ((var_1_10 + var_1_11) - var_1_5))))) && ((((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) <= ((((var_1_6) > (var_1_4)) ? (var_1_6) : (var_1_4)))) ? (var_1_12 == ((unsigned short int) ((var_1_14 - var_1_5) + ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))))) : (var_1_12 == ((unsigned short int) var_1_6)))) && (((~ (var_1_5 * var_1_1)) <= var_1_12) ? (var_1_15 == ((double) (((((5.25 - var_1_16)) > (var_1_17)) ? ((5.25 - var_1_16)) : (var_1_17))))) : (var_1_15 == ((double) ((((((((var_1_17) < (var_1_16)) ? (var_1_17) : (var_1_16)))) < (var_1_18)) ? (((((var_1_17) < (var_1_16)) ? (var_1_17) : (var_1_16)))) : (var_1_18))))))) && ((var_1_4 < var_1_1) ? ((var_1_6 > var_1_21) ? (var_1_19 == ((unsigned char) var_1_20)) : 1) : 1)) && (var_1_21 == ((signed short int) var_1_10)) ; VAL [\result=0, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=-192, var_1_12=16388, var_1_14=16383, var_1_15=2, var_1_17=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=63, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L120] RET, EXPR property() [L120] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=-192, var_1_12=16388, var_1_14=16383, var_1_15=2, var_1_17=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=63, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=-192, var_1_12=16388, var_1_14=16383, var_1_15=2, var_1_17=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=63, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 92 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.3s, OverallIterations: 3, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 511 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 509 mSDsluCounter, 643 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 521 mSDsCounter, 163 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 847 IncrementalHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 163 mSolverCounterUnsat, 122 mSDtfsCounter, 847 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 381 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1997 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=2, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 111 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 612 NumberOfCodeBlocks, 612 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 505 ConstructedInterpolants, 0 QuantifiedInterpolants, 4753 SizeOfPredicates, 6 NumberOfNonLiveVariables, 496 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 1817/2100 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-03-08 10:25:52,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-5.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 3ee41a83450d717782acb2357b704d06460d91e430d71e00e3cee4b83fe11825 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:25:54,257 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:25:54,349 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 10:25:54,353 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:25:54,353 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:25:54,368 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:25:54,369 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:25:54,369 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:25:54,370 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:25:54,370 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:25:54,371 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:25:54,371 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:25:54,371 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:25:54,371 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:25:54,371 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:25:54,372 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:25:54,372 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:25:54,372 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:25:54,372 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:25:54,372 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:25:54,372 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:25:54,372 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:25:54,372 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:25:54,373 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 10:25:54,373 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 10:25:54,373 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 10:25:54,373 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:25:54,373 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:25:54,373 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:25:54,373 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:25:54,373 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:25:54,373 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:25:54,373 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:25:54,374 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:25:54,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:25:54,374 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:25:54,374 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:25:54,374 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:25:54,374 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:25:54,374 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 10:25:54,374 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 10:25:54,374 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:25:54,374 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:25:54,374 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:25:54,374 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:25:54,374 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/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 -> 3ee41a83450d717782acb2357b704d06460d91e430d71e00e3cee4b83fe11825 [2025-03-08 10:25:54,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:25:54,600 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:25:54,601 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:25:54,602 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:25:54,602 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:25:54,603 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-5.i [2025-03-08 10:25:55,765 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95b0f9e5e/401ea1da06d04b71804f13fff704b86d/FLAG3413d0759 [2025-03-08 10:25:55,966 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:25:55,967 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-5.i [2025-03-08 10:25:55,972 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95b0f9e5e/401ea1da06d04b71804f13fff704b86d/FLAG3413d0759 [2025-03-08 10:25:56,344 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95b0f9e5e/401ea1da06d04b71804f13fff704b86d [2025-03-08 10:25:56,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:25:56,348 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:25:56,349 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:25:56,349 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:25:56,351 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:25:56,352 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:25:56" (1/1) ... [2025-03-08 10:25:56,352 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c6e6332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:25:56, skipping insertion in model container [2025-03-08 10:25:56,353 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:25:56" (1/1) ... [2025-03-08 10:25:56,363 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:25:56,455 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-5.i[912,925] [2025-03-08 10:25:56,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:25:56,495 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:25:56,502 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-5.i[912,925] [2025-03-08 10:25:56,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:25:56,532 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:25:56,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:25:56 WrapperNode [2025-03-08 10:25:56,535 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:25:56,536 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:25:56,536 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:25:56,536 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:25:56,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:25:56" (1/1) ... [2025-03-08 10:25:56,546 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:25:56" (1/1) ... [2025-03-08 10:25:56,566 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2025-03-08 10:25:56,571 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:25:56,571 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:25:56,571 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:25:56,571 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:25:56,577 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:25:56" (1/1) ... [2025-03-08 10:25:56,577 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:25:56" (1/1) ... [2025-03-08 10:25:56,580 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:25:56" (1/1) ... [2025-03-08 10:25:56,594 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-03-08 10:25:56,598 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:25:56" (1/1) ... [2025-03-08 10:25:56,599 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:25:56" (1/1) ... [2025-03-08 10:25:56,607 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:25:56" (1/1) ... [2025-03-08 10:25:56,611 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:25:56" (1/1) ... [2025-03-08 10:25:56,613 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:25:56" (1/1) ... [2025-03-08 10:25:56,613 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:25:56" (1/1) ... [2025-03-08 10:25:56,619 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:25:56,620 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:25:56,620 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:25:56,620 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:25:56,621 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:25:56" (1/1) ... [2025-03-08 10:25:56,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:25:56,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:25:56,647 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 10:25:56,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 10:25:56,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:25:56,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 10:25:56,669 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:25:56,669 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:25:56,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:25:56,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:25:56,732 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:25:56,734 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:25:57,208 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-08 10:25:57,208 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:25:57,214 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:25:57,214 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:25:57,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:25:57 BoogieIcfgContainer [2025-03-08 10:25:57,215 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:25:57,216 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:25:57,217 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:25:57,220 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:25:57,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:25:56" (1/3) ... [2025-03-08 10:25:57,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a7ad3cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:25:57, skipping insertion in model container [2025-03-08 10:25:57,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:25:56" (2/3) ... [2025-03-08 10:25:57,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a7ad3cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:25:57, skipping insertion in model container [2025-03-08 10:25:57,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:25:57" (3/3) ... [2025-03-08 10:25:57,222 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-5.i [2025-03-08 10:25:57,232 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:25:57,233 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-5.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:25:57,266 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:25:57,277 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;@2014b3ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:25:57,278 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:25:57,281 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 10:25:57,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 10:25:57,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:25:57,288 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:25:57,289 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:25:57,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:25:57,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1369619023, now seen corresponding path program 1 times [2025-03-08 10:25:57,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:25:57,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1564123597] [2025-03-08 10:25:57,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:25:57,299 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-03-08 10:25:57,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:25:57,303 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-03-08 10:25:57,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-08 10:25:57,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 10:25:57,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 10:25:57,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:25:57,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:25:57,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:25:57,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:25:57,511 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2025-03-08 10:25:57,511 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:25:57,511 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 10:25:57,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1564123597] [2025-03-08 10:25:57,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1564123597] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:25:57,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:25:57,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 10:25:57,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340793258] [2025-03-08 10:25:57,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:25:57,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:25:57,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 10:25:57,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:25:57,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:25:57,528 INFO L87 Difference]: Start difference. First operand has 53 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 10:25:57,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:25:57,542 INFO L93 Difference]: Finished difference Result 100 states and 164 transitions. [2025-03-08 10:25:57,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:25:57,543 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 102 [2025-03-08 10:25:57,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:25:57,548 INFO L225 Difference]: With dead ends: 100 [2025-03-08 10:25:57,548 INFO L226 Difference]: Without dead ends: 50 [2025-03-08 10:25:57,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:25:57,554 INFO L435 NwaCegarLoop]: 71 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, 71 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-03-08 10:25:57,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:25:57,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-08 10:25:57,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-08 10:25:57,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 10:25:57,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 71 transitions. [2025-03-08 10:25:57,589 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 71 transitions. Word has length 102 [2025-03-08 10:25:57,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:25:57,590 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 71 transitions. [2025-03-08 10:25:57,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 10:25:57,590 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 71 transitions. [2025-03-08 10:25:57,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 10:25:57,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:25:57,592 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:25:57,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-08 10:25:57,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-03-08 10:25:57,793 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:25:57,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:25:57,793 INFO L85 PathProgramCache]: Analyzing trace with hash -604265619, now seen corresponding path program 1 times [2025-03-08 10:25:57,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:25:57,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1412640696] [2025-03-08 10:25:57,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:25:57,798 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-03-08 10:25:57,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:25:57,799 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-03-08 10:25:57,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-08 10:25:57,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 10:25:57,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 10:25:57,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:25:57,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:25:57,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 10:25:58,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:25:58,834 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 182 proven. 66 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-03-08 10:25:58,834 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:25:59,250 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 10:25:59,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1412640696] [2025-03-08 10:25:59,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1412640696] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:25:59,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1667947880] [2025-03-08 10:25:59,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:25:59,251 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 10:25:59,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 10:25:59,273 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 10:25:59,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-03-08 10:25:59,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 10:25:59,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 10:25:59,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:25:59,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:25:59,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 10:25:59,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:26:00,406 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 182 proven. 66 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-03-08 10:26:00,406 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:26:00,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1667947880] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:26:00,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 10:26:00,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2025-03-08 10:26:00,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974161514] [2025-03-08 10:26:00,700 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 10:26:00,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 10:26:00,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 10:26:00,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 10:26:00,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-03-08 10:26:00,702 INFO L87 Difference]: Start difference. First operand 50 states and 71 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 10:26:01,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:26:01,618 INFO L93 Difference]: Finished difference Result 158 states and 219 transitions. [2025-03-08 10:26:01,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 10:26:01,619 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 102 [2025-03-08 10:26:01,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:26:01,622 INFO L225 Difference]: With dead ends: 158 [2025-03-08 10:26:01,622 INFO L226 Difference]: Without dead ends: 111 [2025-03-08 10:26:01,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2025-03-08 10:26:01,623 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 55 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 10:26:01,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 287 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 10:26:01,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-08 10:26:01,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 103. [2025-03-08 10:26:01,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 68 states have internal predecessors, (83), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 10:26:01,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 143 transitions. [2025-03-08 10:26:01,642 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 143 transitions. Word has length 102 [2025-03-08 10:26:01,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:26:01,643 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 143 transitions. [2025-03-08 10:26:01,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 10:26:01,643 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 143 transitions. [2025-03-08 10:26:01,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 10:26:01,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:26:01,645 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:26:01,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2025-03-08 10:26:01,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-08 10:26:02,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/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-03-08 10:26:02,046 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:26:02,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:26:02,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1491769300, now seen corresponding path program 1 times [2025-03-08 10:26:02,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:26:02,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [264084304] [2025-03-08 10:26:02,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:26:02,047 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:26:02,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:26:02,049 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/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-03-08 10:26:02,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-08 10:26:02,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 10:26:02,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 10:26:02,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:26:02,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:26:02,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-08 10:26:02,219 INFO L279 TraceCheckSpWp]: Computing forward predicates...