./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-98.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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_operatoramount_amount25_file-98.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 3106ad671e80524e3625bb66f68745fdb8c6d7eaeb9bf9e1410eb7f8dbbf84e4 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:56:06,436 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:56:06,503 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:56:06,508 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:56:06,510 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:56:06,541 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:56:06,541 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:56:06,542 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:56:06,543 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:56:06,544 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:56:06,544 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:56:06,544 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:56:06,545 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:56:06,547 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:56:06,547 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:56:06,548 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:56:06,548 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:56:06,549 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:56:06,549 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:56:06,549 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:56:06,549 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:56:06,550 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:56:06,551 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:56:06,551 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:56:06,551 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:56:06,552 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:56:06,552 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:56:06,552 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:56:06,553 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:56:06,553 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:56:06,553 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:56:06,554 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:56:06,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:56:06,555 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:56:06,555 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:56:06,555 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:56:06,556 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:56:06,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:56:06,556 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:56:06,557 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:56:06,557 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:56:06,558 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:56:06,558 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 3106ad671e80524e3625bb66f68745fdb8c6d7eaeb9bf9e1410eb7f8dbbf84e4 [2024-11-09 00:56:06,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:56:06,898 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:56:06,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:56:06,903 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:56:06,903 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:56:06,905 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-98.i [2024-11-09 00:56:08,375 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:56:08,571 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:56:08,571 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-98.i [2024-11-09 00:56:08,583 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5536dfe2f/e06eefce158e4da0a13fb6c42933c51e/FLAG1c1b76b08 [2024-11-09 00:56:08,602 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5536dfe2f/e06eefce158e4da0a13fb6c42933c51e [2024-11-09 00:56:08,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:56:08,607 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:56:08,611 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:56:08,611 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:56:08,616 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:56:08,617 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:56:08" (1/1) ... [2024-11-09 00:56:08,618 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ff16359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:56:08, skipping insertion in model container [2024-11-09 00:56:08,620 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:56:08" (1/1) ... [2024-11-09 00:56:08,648 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:56:08,840 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_operatoramount_amount25_file-98.i[915,928] [2024-11-09 00:56:08,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:56:08,906 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:56:08,920 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_operatoramount_amount25_file-98.i[915,928] [2024-11-09 00:56:08,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:56:08,974 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:56:08,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:56:08 WrapperNode [2024-11-09 00:56:08,975 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:56:08,976 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:56:08,976 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:56:08,976 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:56:08,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:56:08" (1/1) ... [2024-11-09 00:56:08,994 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:56:08" (1/1) ... [2024-11-09 00:56:09,026 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 135 [2024-11-09 00:56:09,028 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:56:09,028 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:56:09,029 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:56:09,029 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:56:09,039 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:56:08" (1/1) ... [2024-11-09 00:56:09,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:56:08" (1/1) ... [2024-11-09 00:56:09,041 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:56:08" (1/1) ... [2024-11-09 00:56:09,054 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]. [2024-11-09 00:56:09,054 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:56:08" (1/1) ... [2024-11-09 00:56:09,054 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:56:08" (1/1) ... [2024-11-09 00:56:09,061 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:56:08" (1/1) ... [2024-11-09 00:56:09,070 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:56:08" (1/1) ... [2024-11-09 00:56:09,073 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:56:08" (1/1) ... [2024-11-09 00:56:09,074 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:56:08" (1/1) ... [2024-11-09 00:56:09,076 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:56:09,077 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:56:09,077 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:56:09,077 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:56:09,078 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:56:08" (1/1) ... [2024-11-09 00:56:09,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:56:09,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:56:09,116 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) [2024-11-09 00:56:09,122 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 [2024-11-09 00:56:09,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:56:09,165 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:56:09,165 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:56:09,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:56:09,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:56:09,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:56:09,244 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:56:09,246 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:56:09,568 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-09 00:56:09,569 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:56:09,580 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:56:09,580 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:56:09,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:56:09 BoogieIcfgContainer [2024-11-09 00:56:09,581 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:56:09,582 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:56:09,582 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:56:09,585 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:56:09,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:56:08" (1/3) ... [2024-11-09 00:56:09,586 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15197f3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:56:09, skipping insertion in model container [2024-11-09 00:56:09,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:56:08" (2/3) ... [2024-11-09 00:56:09,586 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15197f3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:56:09, skipping insertion in model container [2024-11-09 00:56:09,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:56:09" (3/3) ... [2024-11-09 00:56:09,587 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-98.i [2024-11-09 00:56:09,600 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:56:09,600 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:56:09,666 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:56:09,672 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6a434fac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:56:09,672 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:56:09,677 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 40 states have internal predecessors, (50), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 00:56:09,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 00:56:09,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:56:09,690 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:56:09,690 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:56:09,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:56:09,695 INFO L85 PathProgramCache]: Analyzing trace with hash -705029412, now seen corresponding path program 1 times [2024-11-09 00:56:09,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:56:09,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005867524] [2024-11-09 00:56:09,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:56:09,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:56:09,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:09,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:56:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:09,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 00:56:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:09,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 00:56:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:10,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 00:56:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:10,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 00:56:10,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:10,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 00:56:10,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:10,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:56:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:10,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 00:56:10,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:10,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 00:56:10,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:10,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 00:56:10,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:10,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 00:56:10,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:10,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 00:56:10,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:10,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 00:56:10,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:10,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 00:56:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:10,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 00:56:10,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:10,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 00:56:10,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:10,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 00:56:10,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:10,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 00:56:10,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:10,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:56:10,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:10,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:56:10,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:10,115 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 00:56:10,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:56:10,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005867524] [2024-11-09 00:56:10,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005867524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:56:10,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:56:10,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:56:10,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605570849] [2024-11-09 00:56:10,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:56:10,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:56:10,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:56:10,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:56:10,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:56:10,155 INFO L87 Difference]: Start difference. First operand has 62 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 40 states have internal predecessors, (50), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 00:56:10,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:56:10,191 INFO L93 Difference]: Finished difference Result 117 states and 194 transitions. [2024-11-09 00:56:10,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:56:10,194 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 128 [2024-11-09 00:56:10,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:56:10,199 INFO L225 Difference]: With dead ends: 117 [2024-11-09 00:56:10,199 INFO L226 Difference]: Without dead ends: 58 [2024-11-09 00:56:10,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:56:10,206 INFO L432 NwaCegarLoop]: 83 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, 83 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 [2024-11-09 00:56:10,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:56:10,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-09 00:56:10,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-09 00:56:10,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 00:56:10,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 83 transitions. [2024-11-09 00:56:10,248 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 83 transitions. Word has length 128 [2024-11-09 00:56:10,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:56:10,248 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 83 transitions. [2024-11-09 00:56:10,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 00:56:10,249 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 83 transitions. [2024-11-09 00:56:10,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 00:56:10,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:56:10,252 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:56:10,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:56:10,253 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:56:10,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:56:10,254 INFO L85 PathProgramCache]: Analyzing trace with hash 144104028, now seen corresponding path program 1 times [2024-11-09 00:56:10,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:56:10,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792825388] [2024-11-09 00:56:10,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:56:10,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:56:10,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 00:56:10,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [103475298] [2024-11-09 00:56:10,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:56:10,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:56:10,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:56:10,537 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) [2024-11-09 00:56:10,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 00:56:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:10,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 00:56:10,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:56:12,053 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 349 proven. 87 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-11-09 00:56:12,054 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:56:12,895 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 18 proven. 39 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-09 00:56:12,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:56:12,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792825388] [2024-11-09 00:56:12,899 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 00:56:12,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103475298] [2024-11-09 00:56:12,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103475298] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 00:56:12,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 00:56:12,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2024-11-09 00:56:12,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585733815] [2024-11-09 00:56:12,902 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 00:56:12,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 00:56:12,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:56:12,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 00:56:12,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2024-11-09 00:56:12,907 INFO L87 Difference]: Start difference. First operand 58 states and 83 transitions. Second operand has 19 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 19 states have internal predecessors, (64), 6 states have call successors, (37), 4 states have call predecessors, (37), 7 states have return successors, (38), 6 states have call predecessors, (38), 6 states have call successors, (38) [2024-11-09 00:56:14,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:56:14,710 INFO L93 Difference]: Finished difference Result 148 states and 198 transitions. [2024-11-09 00:56:14,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-09 00:56:14,712 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 19 states have internal predecessors, (64), 6 states have call successors, (37), 4 states have call predecessors, (37), 7 states have return successors, (38), 6 states have call predecessors, (38), 6 states have call successors, (38) Word has length 128 [2024-11-09 00:56:14,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:56:14,715 INFO L225 Difference]: With dead ends: 148 [2024-11-09 00:56:14,717 INFO L226 Difference]: Without dead ends: 93 [2024-11-09 00:56:14,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=328, Invalid=1078, Unknown=0, NotChecked=0, Total=1406 [2024-11-09 00:56:14,720 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 143 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 58 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:56:14,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 360 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 542 Invalid, 10 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 00:56:14,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-09 00:56:14,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 76. [2024-11-09 00:56:14,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.14) internal successors, (57), 50 states have internal predecessors, (57), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 00:56:14,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 97 transitions. [2024-11-09 00:56:14,746 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 97 transitions. Word has length 128 [2024-11-09 00:56:14,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:56:14,747 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 97 transitions. [2024-11-09 00:56:14,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 19 states have internal predecessors, (64), 6 states have call successors, (37), 4 states have call predecessors, (37), 7 states have return successors, (38), 6 states have call predecessors, (38), 6 states have call successors, (38) [2024-11-09 00:56:14,747 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2024-11-09 00:56:14,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 00:56:14,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:56:14,750 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:56:14,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 00:56:14,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:56:14,951 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:56:14,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:56:14,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1919111390, now seen corresponding path program 1 times [2024-11-09 00:56:14,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:56:14,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374020174] [2024-11-09 00:56:14,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:56:14,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:56:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 00:56:15,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1296403370] [2024-11-09 00:56:15,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:56:15,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:56:15,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:56:15,121 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) [2024-11-09 00:56:15,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 00:56:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:56:15,241 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:56:15,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:56:15,395 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 00:56:15,395 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 00:56:15,396 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:56:15,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 00:56:15,599 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,SelfDestructingSolverStorable2 [2024-11-09 00:56:15,603 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-09 00:56:15,690 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:56:15,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:56:15 BoogieIcfgContainer [2024-11-09 00:56:15,693 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:56:15,694 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:56:15,694 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:56:15,694 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:56:15,694 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:56:09" (3/4) ... [2024-11-09 00:56:15,697 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 00:56:15,698 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:56:15,699 INFO L158 Benchmark]: Toolchain (without parser) took 7091.96ms. Allocated memory was 192.9MB in the beginning and 234.9MB in the end (delta: 41.9MB). Free memory was 146.8MB in the beginning and 169.2MB in the end (delta: -22.4MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. [2024-11-09 00:56:15,699 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 100.7MB. Free memory is still 67.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:56:15,700 INFO L158 Benchmark]: CACSL2BoogieTranslator took 364.75ms. Allocated memory is still 192.9MB. Free memory was 146.8MB in the beginning and 132.6MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 00:56:15,700 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.77ms. Allocated memory is still 192.9MB. Free memory was 132.6MB in the beginning and 130.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:56:15,701 INFO L158 Benchmark]: Boogie Preprocessor took 47.68ms. Allocated memory is still 192.9MB. Free memory was 130.0MB in the beginning and 127.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:56:15,701 INFO L158 Benchmark]: RCFGBuilder took 503.83ms. Allocated memory is still 192.9MB. Free memory was 127.4MB in the beginning and 148.1MB in the end (delta: -20.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 00:56:15,702 INFO L158 Benchmark]: TraceAbstraction took 6110.79ms. Allocated memory was 192.9MB in the beginning and 234.9MB in the end (delta: 41.9MB). Free memory was 147.1MB in the beginning and 169.2MB in the end (delta: -22.1MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2024-11-09 00:56:15,702 INFO L158 Benchmark]: Witness Printer took 4.74ms. Allocated memory is still 234.9MB. Free memory is still 169.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:56:15,704 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 100.7MB. Free memory is still 67.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 364.75ms. Allocated memory is still 192.9MB. Free memory was 146.8MB in the beginning and 132.6MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.77ms. Allocated memory is still 192.9MB. Free memory was 132.6MB in the beginning and 130.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.68ms. Allocated memory is still 192.9MB. Free memory was 130.0MB in the beginning and 127.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 503.83ms. Allocated memory is still 192.9MB. Free memory was 127.4MB in the beginning and 148.1MB in the end (delta: -20.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6110.79ms. Allocated memory was 192.9MB in the beginning and 234.9MB in the end (delta: 41.9MB). Free memory was 147.1MB in the beginning and 169.2MB in the end (delta: -22.1MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * Witness Printer took 4.74ms. Allocated memory is still 234.9MB. Free memory is still 169.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryArithmeticDOUBLEoperation at line 42. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 4.8; [L23] double var_1_2 = 63.5; [L24] double var_1_3 = 9999999.5; [L25] double var_1_4 = 0.6; [L26] signed short int var_1_6 = 10; [L27] signed long int var_1_7 = -1; [L28] double var_1_8 = 32.34; [L29] unsigned char var_1_9 = 0; [L30] unsigned char var_1_11 = 1; [L31] unsigned char var_1_12 = 1; [L32] unsigned char var_1_13 = 0; [L33] unsigned char var_1_14 = 0; [L34] unsigned long int var_1_15 = 0; [L35] unsigned long int var_1_16 = 2731588682; [L36] unsigned long int var_1_17 = 2; [L37] unsigned long int var_1_18 = 50; [L38] unsigned char last_1_var_1_9 = 0; VAL [isInitial=0, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_2=127/2, var_1_3=19999999/2, var_1_4=3/5, var_1_6=10, var_1_7=-1, var_1_8=1617/50, var_1_9=0] [L98] isInitial = 1 [L99] FCALL initially() [L100] COND TRUE 1 [L101] CALL updateLastVariables() [L91] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_2=127/2, var_1_3=19999999/2, var_1_4=3/5, var_1_6=10, var_1_7=-1, var_1_8=1617/50, var_1_9=0] [L101] RET updateLastVariables() [L102] CALL updateVariables() [L58] var_1_2 = __VERIFIER_nondet_double() [L59] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854765600e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_3=19999999/2, var_1_4=3/5, var_1_6=10, var_1_7=-1, var_1_8=1617/50, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_3=19999999/2, var_1_4=3/5, var_1_6=10, var_1_7=-1, var_1_8=1617/50, var_1_9=0] [L59] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854765600e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_3=19999999/2, var_1_4=3/5, var_1_6=10, var_1_7=-1, var_1_8=1617/50, var_1_9=0] [L60] var_1_3 = __VERIFIER_nondet_double() [L61] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=10, var_1_7=-1, var_1_8=1617/50, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=10, var_1_7=-1, var_1_8=1617/50, var_1_9=0] [L61] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=10, var_1_7=-1, var_1_8=1617/50, var_1_9=0] [L62] var_1_6 = __VERIFIER_nondet_short() [L63] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=-1, var_1_8=1617/50, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=-1, var_1_8=1617/50, var_1_9=0] [L63] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=-1, var_1_8=1617/50, var_1_9=0] [L64] CALL assume_abort_if_not(var_1_6 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=-1, var_1_8=1617/50, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=-1, var_1_8=1617/50, var_1_9=0] [L64] RET assume_abort_if_not(var_1_6 <= 32) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=-1, var_1_8=1617/50, var_1_9=0] [L65] var_1_7 = __VERIFIER_nondet_long() [L66] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_8=1617/50, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_8=1617/50, var_1_9=0] [L66] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_8=1617/50, var_1_9=0] [L67] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_8=1617/50, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_8=1617/50, var_1_9=0] [L67] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_8=1617/50, var_1_9=0] [L68] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_8=1617/50, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_8=1617/50, var_1_9=0] [L68] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_8=1617/50, var_1_9=0] [L69] var_1_8 = __VERIFIER_nondet_double() [L70] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L70] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L71] var_1_11 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L72] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L73] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L73] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L74] var_1_12 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_12 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L75] RET assume_abort_if_not(var_1_12 >= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L76] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L76] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L77] var_1_13 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L78] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L79] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L79] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L80] var_1_14 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_14 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L81] RET assume_abort_if_not(var_1_14 >= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L82] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L82] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L83] var_1_16 = __VERIFIER_nondet_ulong() [L84] CALL assume_abort_if_not(var_1_16 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=-2147483649, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=-2147483649, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L84] RET assume_abort_if_not(var_1_16 >= 2147483647) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=-2147483649, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L85] CALL assume_abort_if_not(var_1_16 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=-2147483649, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=-2147483649, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L85] RET assume_abort_if_not(var_1_16 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=-2147483649, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L86] var_1_17 = __VERIFIER_nondet_ulong() [L87] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=-2147483649, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=-2147483649, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L87] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=-2147483649, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L88] CALL assume_abort_if_not(var_1_17 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=-2147483649, var_1_17=0, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=-2147483649, var_1_17=0, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L88] RET assume_abort_if_not(var_1_17 <= 1073741823) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=-2147483649, var_1_17=0, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L102] RET updateVariables() [L103] CALL step() [L42] var_1_1 = (var_1_2 - var_1_3) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=-2147483649, var_1_17=0, var_1_18=50, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L43] COND TRUE ((- var_1_2) * var_1_8) == var_1_1 [L44] var_1_9 = ((last_1_var_1_9 || var_1_11) && (var_1_12 && (var_1_13 && var_1_14))) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=-2147483649, var_1_17=0, var_1_18=50, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=1] [L46] COND TRUE \read(var_1_14) [L47] var_1_15 = var_1_6 VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=-2147483649, var_1_17=0, var_1_18=50, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=1] [L51] var_1_18 = var_1_6 VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=-2147483649, var_1_17=0, var_1_18=0, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=1] [L52] EXPR var_1_18 >> var_1_6 VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=-2147483649, var_1_17=0, var_1_18=0, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=1] [L52] unsigned long int stepLocal_0 = (var_1_18 >> var_1_6) / var_1_7; [L53] COND FALSE !(8 < stepLocal_0) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=-2147483649, var_1_17=0, var_1_18=0, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=1] [L103] RET step() [L104] CALL, EXPR property() [L94] EXPR (var_1_1 == ((double) (var_1_2 - var_1_3))) && ((8 < ((var_1_18 >> var_1_6) / var_1_7)) ? (var_1_4 == ((double) ((15.475 + 256.75) + var_1_8))) : 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=-2147483649, var_1_17=0, var_1_18=0, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=1] [L94-L95] return ((((var_1_1 == ((double) (var_1_2 - var_1_3))) && ((8 < ((var_1_18 >> var_1_6) / var_1_7)) ? (var_1_4 == ((double) ((15.475 + 256.75) + var_1_8))) : 1)) && ((((- var_1_2) * var_1_8) == var_1_1) ? (var_1_9 == ((unsigned char) ((last_1_var_1_9 || var_1_11) && (var_1_12 && (var_1_13 && var_1_14))))) : 1)) && (var_1_14 ? (var_1_15 == ((unsigned long int) var_1_6)) : (var_1_15 == ((unsigned long int) (var_1_16 - ((((var_1_6) > ((1251570750u - var_1_17))) ? (var_1_6) : ((1251570750u - var_1_17))))))))) && (var_1_18 == ((unsigned long int) var_1_6)) ; [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=-2147483649, var_1_17=0, var_1_18=0, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=-2147483649, var_1_17=0, var_1_18=0, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.0s, OverallIterations: 3, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 10 mSolverCounterUnknown, 146 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 143 mSDsluCounter, 443 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 301 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 542 IncrementalHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 142 mSDtfsCounter, 542 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 335 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=2, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 17 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 640 NumberOfCodeBlocks, 640 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 381 ConstructedInterpolants, 1 QuantifiedInterpolants, 2306 SizeOfPredicates, 3 NumberOfNonLiveVariables, 285 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 2154/2280 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 00:56:15,739 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/11.0.12-open/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.5.800.v20200727-1323.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_operatoramount_amount25_file-98.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 3106ad671e80524e3625bb66f68745fdb8c6d7eaeb9bf9e1410eb7f8dbbf84e4 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:56:17,949 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:56:18,027 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 00:56:18,033 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:56:18,034 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:56:18,066 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:56:18,069 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:56:18,069 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:56:18,070 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:56:18,071 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:56:18,071 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:56:18,072 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:56:18,072 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:56:18,073 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:56:18,075 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:56:18,075 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:56:18,075 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:56:18,076 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:56:18,076 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:56:18,076 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:56:18,076 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:56:18,080 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:56:18,080 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:56:18,081 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 00:56:18,081 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 00:56:18,081 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:56:18,081 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 00:56:18,082 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:56:18,082 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:56:18,082 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:56:18,082 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:56:18,083 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:56:18,083 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:56:18,083 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:56:18,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:56:18,084 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:56:18,084 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:56:18,086 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:56:18,086 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 00:56:18,086 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 00:56:18,087 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:56:18,087 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:56:18,087 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:56:18,088 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:56:18,088 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 3106ad671e80524e3625bb66f68745fdb8c6d7eaeb9bf9e1410eb7f8dbbf84e4 [2024-11-09 00:56:18,411 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:56:18,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:56:18,439 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:56:18,441 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:56:18,441 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:56:18,443 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-98.i [2024-11-09 00:56:19,992 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:56:20,226 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:56:20,226 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-98.i [2024-11-09 00:56:20,238 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6c0f10a8/c122e04b5d884538a342ce8b3e82fc57/FLAG0a0aed164 [2024-11-09 00:56:20,256 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6c0f10a8/c122e04b5d884538a342ce8b3e82fc57 [2024-11-09 00:56:20,259 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:56:20,261 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:56:20,264 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:56:20,265 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:56:20,270 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:56:20,271 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:56:20" (1/1) ... [2024-11-09 00:56:20,272 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@415f1910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:56:20, skipping insertion in model container [2024-11-09 00:56:20,272 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:56:20" (1/1) ... [2024-11-09 00:56:20,302 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:56:20,505 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_operatoramount_amount25_file-98.i[915,928] [2024-11-09 00:56:20,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:56:20,581 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:56:20,594 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_operatoramount_amount25_file-98.i[915,928] [2024-11-09 00:56:20,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:56:20,649 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:56:20,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:56:20 WrapperNode [2024-11-09 00:56:20,650 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:56:20,651 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:56:20,651 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:56:20,651 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:56:20,657 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:56:20" (1/1) ... [2024-11-09 00:56:20,673 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:56:20" (1/1) ... [2024-11-09 00:56:20,696 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 115 [2024-11-09 00:56:20,697 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:56:20,698 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:56:20,698 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:56:20,698 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:56:20,711 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:56:20" (1/1) ... [2024-11-09 00:56:20,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:56:20" (1/1) ... [2024-11-09 00:56:20,714 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:56:20" (1/1) ... [2024-11-09 00:56:20,734 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]. [2024-11-09 00:56:20,734 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:56:20" (1/1) ... [2024-11-09 00:56:20,735 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:56:20" (1/1) ... [2024-11-09 00:56:20,746 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:56:20" (1/1) ... [2024-11-09 00:56:20,749 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:56:20" (1/1) ... [2024-11-09 00:56:20,751 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:56:20" (1/1) ... [2024-11-09 00:56:20,752 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:56:20" (1/1) ... [2024-11-09 00:56:20,755 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:56:20,756 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:56:20,756 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:56:20,756 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:56:20,757 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:56:20" (1/1) ... [2024-11-09 00:56:20,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:56:20,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:56:20,791 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) [2024-11-09 00:56:20,794 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 [2024-11-09 00:56:20,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:56:20,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 00:56:20,835 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:56:20,835 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:56:20,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:56:20,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:56:20,917 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:56:20,920 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:56:30,314 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-09 00:56:30,315 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:56:30,328 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:56:30,329 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:56:30,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:56:30 BoogieIcfgContainer [2024-11-09 00:56:30,330 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:56:30,331 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:56:30,331 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:56:30,334 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:56:30,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:56:20" (1/3) ... [2024-11-09 00:56:30,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1452f77e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:56:30, skipping insertion in model container [2024-11-09 00:56:30,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:56:20" (2/3) ... [2024-11-09 00:56:30,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1452f77e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:56:30, skipping insertion in model container [2024-11-09 00:56:30,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:56:30" (3/3) ... [2024-11-09 00:56:30,336 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-98.i [2024-11-09 00:56:30,352 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:56:30,353 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:56:30,409 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:56:30,414 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;@675f32d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:56:30,415 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:56:30,418 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 32 states have internal predecessors, (39), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 00:56:30,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 00:56:30,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:56:30,430 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:56:30,430 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:56:30,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:56:30,437 INFO L85 PathProgramCache]: Analyzing trace with hash 140353710, now seen corresponding path program 1 times [2024-11-09 00:56:30,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:56:30,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [211131238] [2024-11-09 00:56:30,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:56:30,452 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 [2024-11-09 00:56:30,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:56:30,455 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) [2024-11-09 00:56:30,457 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 [2024-11-09 00:56:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:31,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 00:56:31,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:56:31,173 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2024-11-09 00:56:31,177 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:56:31,178 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:56:31,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [211131238] [2024-11-09 00:56:31,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [211131238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:56:31,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:56:31,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:56:31,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35005130] [2024-11-09 00:56:31,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:56:31,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:56:31,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:56:31,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:56:31,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:56:31,220 INFO L87 Difference]: Start difference. First operand has 54 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 32 states have internal predecessors, (39), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 00:56:31,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:56:31,258 INFO L93 Difference]: Finished difference Result 101 states and 172 transitions. [2024-11-09 00:56:31,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:56:31,263 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 124 [2024-11-09 00:56:31,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:56:31,272 INFO L225 Difference]: With dead ends: 101 [2024-11-09 00:56:31,273 INFO L226 Difference]: Without dead ends: 50 [2024-11-09 00:56:31,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:56:31,278 INFO L432 NwaCegarLoop]: 72 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, 72 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 [2024-11-09 00:56:31,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:56:31,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-09 00:56:31,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-09 00:56:31,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 00:56:31,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 72 transitions. [2024-11-09 00:56:31,318 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 72 transitions. Word has length 124 [2024-11-09 00:56:31,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:56:31,319 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 72 transitions. [2024-11-09 00:56:31,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 00:56:31,319 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions. [2024-11-09 00:56:31,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 00:56:31,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:56:31,323 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:56:31,339 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 [2024-11-09 00:56:31,523 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 [2024-11-09 00:56:31,524 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:56:31,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:56:31,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1782980654, now seen corresponding path program 1 times [2024-11-09 00:56:31,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:56:31,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1992723603] [2024-11-09 00:56:31,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:56:31,526 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:56:31,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:56:31,529 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) [2024-11-09 00:56:31,530 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 [2024-11-09 00:56:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:32,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 00:56:32,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:56:46,016 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 00:56:56,749 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 00:57:04,249 WARN L286 SmtUtils]: Spent 7.50s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 00:57:12,358 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 00:57:20,486 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)