./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 3061b6dc 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-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:00:20,821 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:00:20,918 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:00:20,926 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:00:20,928 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:00:20,961 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:00:20,962 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:00:20,962 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:00:20,963 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:00:20,965 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:00:20,965 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:00:20,966 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:00:20,967 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:00:20,967 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:00:20,968 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:00:20,968 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:00:20,968 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:00:20,969 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:00:20,969 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:00:20,969 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:00:20,970 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:00:20,972 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:00:20,972 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:00:20,972 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:00:20,973 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:00:20,973 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:00:20,973 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:00:20,974 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:00:20,974 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:00:20,975 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:00:20,975 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:00:20,976 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:00:20,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:00:20,977 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:00:20,977 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:00:20,977 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:00:20,977 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:00:20,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:00:20,978 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:00:20,978 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:00:20,978 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:00:20,979 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:00:20,979 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-19 00:00:21,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:00:21,309 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:00:21,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:00:21,313 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:00:21,314 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:00:21,316 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-19 00:00:22,885 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:00:23,101 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:00:23,102 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-98.i [2024-11-19 00:00:23,111 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4056a79cc/a2ed8dae21d04d1690754f2423a028ea/FLAG2cb493336 [2024-11-19 00:00:23,127 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4056a79cc/a2ed8dae21d04d1690754f2423a028ea [2024-11-19 00:00:23,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:00:23,132 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:00:23,137 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:00:23,138 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:00:23,144 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:00:23,145 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:00:23" (1/1) ... [2024-11-19 00:00:23,146 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68b0f248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:23, skipping insertion in model container [2024-11-19 00:00:23,148 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:00:23" (1/1) ... [2024-11-19 00:00:23,190 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:00:23,371 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-19 00:00:23,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:00:23,426 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:00:23,437 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-19 00:00:23,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:00:23,483 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:00:23,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:23 WrapperNode [2024-11-19 00:00:23,484 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:00:23,485 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:00:23,485 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:00:23,485 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:00:23,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:23" (1/1) ... [2024-11-19 00:00:23,502 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:23" (1/1) ... [2024-11-19 00:00:23,534 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 135 [2024-11-19 00:00:23,534 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:00:23,535 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:00:23,535 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:00:23,536 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:00:23,548 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:23" (1/1) ... [2024-11-19 00:00:23,550 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:23" (1/1) ... [2024-11-19 00:00:23,552 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:23" (1/1) ... [2024-11-19 00:00:23,567 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-19 00:00:23,567 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:23" (1/1) ... [2024-11-19 00:00:23,568 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:23" (1/1) ... [2024-11-19 00:00:23,573 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:23" (1/1) ... [2024-11-19 00:00:23,577 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:23" (1/1) ... [2024-11-19 00:00:23,578 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:23" (1/1) ... [2024-11-19 00:00:23,580 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:23" (1/1) ... [2024-11-19 00:00:23,582 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:00:23,586 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:00:23,586 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:00:23,586 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:00:23,587 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:23" (1/1) ... [2024-11-19 00:00:23,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:00:23,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:00:23,629 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-19 00:00:23,632 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-19 00:00:23,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:00:23,680 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:00:23,680 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:00:23,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:00:23,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:00:23,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:00:23,751 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:00:23,753 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:00:23,988 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-19 00:00:23,989 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:00:24,007 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:00:24,008 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:00:24,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:00:24 BoogieIcfgContainer [2024-11-19 00:00:24,008 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:00:24,012 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:00:24,013 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:00:24,016 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:00:24,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:00:23" (1/3) ... [2024-11-19 00:00:24,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f6add0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:00:24, skipping insertion in model container [2024-11-19 00:00:24,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:23" (2/3) ... [2024-11-19 00:00:24,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f6add0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:00:24, skipping insertion in model container [2024-11-19 00:00:24,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:00:24" (3/3) ... [2024-11-19 00:00:24,021 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-98.i [2024-11-19 00:00:24,040 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:00:24,040 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:00:24,138 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:00:24,172 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;@413ec850, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:00:24,173 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:00:24,181 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-19 00:00:24,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-19 00:00:24,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:00:24,193 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-19 00:00:24,194 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:00:24,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:00:24,199 INFO L85 PathProgramCache]: Analyzing trace with hash -705029412, now seen corresponding path program 1 times [2024-11-19 00:00:24,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:00:24,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257332636] [2024-11-19 00:00:24,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:00:24,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:00:24,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:00:24,547 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2024-11-19 00:00:24,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:00:24,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257332636] [2024-11-19 00:00:24,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257332636] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:00:24,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187592262] [2024-11-19 00:00:24,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:00:24,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:00:24,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:00:24,555 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-19 00:00:24,556 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-19 00:00:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:00:24,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:00:24,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:00:24,738 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2024-11-19 00:00:24,738 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:00:24,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187592262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:00:24,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:00:24,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:00:24,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494315783] [2024-11-19 00:00:24,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:00:24,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:00:24,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:00:24,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:00:24,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:00:24,778 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 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (20), 2 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-19 00:00:24,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:00:24,816 INFO L93 Difference]: Finished difference Result 117 states and 194 transitions. [2024-11-19 00:00:24,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:00:24,819 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (20), 2 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-19 00:00:24,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:00:24,826 INFO L225 Difference]: With dead ends: 117 [2024-11-19 00:00:24,826 INFO L226 Difference]: Without dead ends: 58 [2024-11-19 00:00:24,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 129 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-19 00:00:24,833 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-19 00:00:24,834 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-19 00:00:24,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-19 00:00:24,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-19 00:00:24,883 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-19 00:00:24,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 83 transitions. [2024-11-19 00:00:24,887 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 83 transitions. Word has length 128 [2024-11-19 00:00:24,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:00:24,888 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 83 transitions. [2024-11-19 00:00:24,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (20), 2 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-19 00:00:24,889 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 83 transitions. [2024-11-19 00:00:24,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-19 00:00:24,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:00:24,892 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-19 00:00:24,907 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-19 00:00:25,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 00:00:25,093 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:00:25,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:00:25,094 INFO L85 PathProgramCache]: Analyzing trace with hash 144104028, now seen corresponding path program 1 times [2024-11-19 00:00:25,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:00:25,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764089895] [2024-11-19 00:00:25,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:00:25,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:00:25,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 00:00:25,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1128001325] [2024-11-19 00:00:25,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:00:25,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:00:25,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:00:25,382 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-19 00:00:25,384 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-19 00:00:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:00:25,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-19 00:00:25,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:00:26,980 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-19 00:00:26,980 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:00:27,814 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-19 00:00:27,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:00:27,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764089895] [2024-11-19 00:00:27,816 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 00:00:27,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128001325] [2024-11-19 00:00:27,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128001325] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:00:27,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:00:27,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2024-11-19 00:00:27,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254537723] [2024-11-19 00:00:27,817 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:00:27,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-19 00:00:27,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:00:27,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-19 00:00:27,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2024-11-19 00:00:27,822 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-19 00:00:29,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:00:29,898 INFO L93 Difference]: Finished difference Result 148 states and 198 transitions. [2024-11-19 00:00:29,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-19 00:00:29,902 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-19 00:00:29,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:00:29,905 INFO L225 Difference]: With dead ends: 148 [2024-11-19 00:00:29,905 INFO L226 Difference]: Without dead ends: 93 [2024-11-19 00:00:29,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=328, Invalid=1078, Unknown=0, NotChecked=0, Total=1406 [2024-11-19 00:00:29,911 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 167 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:00:29,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 332 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-19 00:00:29,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-19 00:00:29,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 76. [2024-11-19 00:00:29,943 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-19 00:00:29,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 97 transitions. [2024-11-19 00:00:29,946 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 97 transitions. Word has length 128 [2024-11-19 00:00:29,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:00:29,948 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 97 transitions. [2024-11-19 00:00:29,949 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-19 00:00:29,949 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2024-11-19 00:00:29,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-19 00:00:29,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:00:29,954 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-19 00:00:29,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 00:00:30,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-19 00:00:30,155 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:00:30,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:00:30,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1919111390, now seen corresponding path program 1 times [2024-11-19 00:00:30,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:00:30,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907726402] [2024-11-19 00:00:30,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:00:30,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:00:30,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 00:00:30,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [989969921] [2024-11-19 00:00:30,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:00:30,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:00:30,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:00:30,289 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:00:30,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 00:00:30,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:00:30,408 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 00:00:30,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:00:30,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 00:00:30,523 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 00:00:30,525 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 00:00:30,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 00:00:30,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:00:30,730 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-19 00:00:30,825 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 00:00:30,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:00:30 BoogieIcfgContainer [2024-11-19 00:00:30,834 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 00:00:30,835 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 00:00:30,838 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 00:00:30,839 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 00:00:30,839 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:00:24" (3/4) ... [2024-11-19 00:00:30,842 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 00:00:30,844 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 00:00:30,845 INFO L158 Benchmark]: Toolchain (without parser) took 7713.14ms. Allocated memory was 159.4MB in the beginning and 222.3MB in the end (delta: 62.9MB). Free memory was 103.3MB in the beginning and 131.2MB in the end (delta: -27.9MB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB. [2024-11-19 00:00:30,846 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 159.4MB. Free memory is still 121.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:00:30,847 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.46ms. Allocated memory is still 159.4MB. Free memory was 102.8MB in the beginning and 88.9MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 00:00:30,848 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.83ms. Allocated memory is still 159.4MB. Free memory was 88.9MB in the beginning and 86.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 00:00:30,849 INFO L158 Benchmark]: Boogie Preprocessor took 47.02ms. Allocated memory is still 159.4MB. Free memory was 86.5MB in the beginning and 83.9MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 00:00:30,849 INFO L158 Benchmark]: RCFGBuilder took 422.37ms. Allocated memory is still 159.4MB. Free memory was 83.9MB in the beginning and 67.6MB in the end (delta: 16.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 00:00:30,849 INFO L158 Benchmark]: TraceAbstraction took 6822.85ms. Allocated memory was 159.4MB in the beginning and 222.3MB in the end (delta: 62.9MB). Free memory was 66.7MB in the beginning and 131.2MB in the end (delta: -64.4MB). Peak memory consumption was 404.0kB. Max. memory is 16.1GB. [2024-11-19 00:00:30,849 INFO L158 Benchmark]: Witness Printer took 8.98ms. Allocated memory is still 222.3MB. Free memory is still 131.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:00:30,854 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.22ms. Allocated memory is still 159.4MB. Free memory is still 121.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 347.46ms. Allocated memory is still 159.4MB. Free memory was 102.8MB in the beginning and 88.9MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.83ms. Allocated memory is still 159.4MB. Free memory was 88.9MB in the beginning and 86.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.02ms. Allocated memory is still 159.4MB. Free memory was 86.5MB in the beginning and 83.9MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 422.37ms. Allocated memory is still 159.4MB. Free memory was 83.9MB in the beginning and 67.6MB in the end (delta: 16.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6822.85ms. Allocated memory was 159.4MB in the beginning and 222.3MB in the end (delta: 62.9MB). Free memory was 66.7MB in the beginning and 131.2MB in the end (delta: -64.4MB). Peak memory consumption was 404.0kB. Max. memory is 16.1GB. * Witness Printer took 8.98ms. Allocated memory is still 222.3MB. Free memory is still 131.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.6s, OverallIterations: 3, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 170 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 167 mSDsluCounter, 415 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 273 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 512 IncrementalHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 142 mSDtfsCounter, 512 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 402 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.3s 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, 768 NumberOfCodeBlocks, 768 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 508 ConstructedInterpolants, 1 QuantifiedInterpolants, 2433 SizeOfPredicates, 3 NumberOfNonLiveVariables, 570 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 2876/3040 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-19 00:00:30,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:00:33,406 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:00:33,498 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 00:00:33,505 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:00:33,508 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:00:33,550 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:00:33,551 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:00:33,554 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:00:33,554 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:00:33,555 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:00:33,555 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:00:33,556 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:00:33,556 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:00:33,557 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:00:33,557 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:00:33,559 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:00:33,561 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:00:33,561 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:00:33,565 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:00:33,565 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:00:33,566 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:00:33,566 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:00:33,567 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:00:33,567 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 00:00:33,567 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 00:00:33,567 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:00:33,568 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 00:00:33,568 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:00:33,568 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:00:33,568 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:00:33,569 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:00:33,569 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:00:33,569 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:00:33,570 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:00:33,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:00:33,572 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:00:33,573 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:00:33,574 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:00:33,574 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 00:00:33,575 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 00:00:33,575 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:00:33,575 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:00:33,575 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:00:33,576 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:00:33,576 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-19 00:00:33,976 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:00:34,007 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:00:34,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:00:34,013 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:00:34,014 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:00:34,016 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-19 00:00:35,691 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:00:35,933 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:00:35,933 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-98.i [2024-11-19 00:00:35,952 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a935b9455/5afcad3066b449a59169ff4d751063f2/FLAG7356c80d5 [2024-11-19 00:00:35,970 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a935b9455/5afcad3066b449a59169ff4d751063f2 [2024-11-19 00:00:35,974 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:00:35,976 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:00:35,979 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:00:35,980 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:00:35,985 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:00:35,986 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:00:35" (1/1) ... [2024-11-19 00:00:35,987 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14cb4935 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:35, skipping insertion in model container [2024-11-19 00:00:35,989 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:00:35" (1/1) ... [2024-11-19 00:00:36,014 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:00:36,215 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-19 00:00:36,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:00:36,303 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:00:36,318 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-19 00:00:36,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:00:36,369 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:00:36,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:36 WrapperNode [2024-11-19 00:00:36,370 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:00:36,371 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:00:36,371 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:00:36,372 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:00:36,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:36" (1/1) ... [2024-11-19 00:00:36,392 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:36" (1/1) ... [2024-11-19 00:00:36,420 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 115 [2024-11-19 00:00:36,424 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:00:36,425 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:00:36,425 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:00:36,425 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:00:36,436 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:36" (1/1) ... [2024-11-19 00:00:36,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:36" (1/1) ... [2024-11-19 00:00:36,446 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:36" (1/1) ... [2024-11-19 00:00:36,463 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-19 00:00:36,467 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:36" (1/1) ... [2024-11-19 00:00:36,468 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:36" (1/1) ... [2024-11-19 00:00:36,477 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:36" (1/1) ... [2024-11-19 00:00:36,488 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:36" (1/1) ... [2024-11-19 00:00:36,491 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:36" (1/1) ... [2024-11-19 00:00:36,496 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:36" (1/1) ... [2024-11-19 00:00:36,501 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:00:36,502 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:00:36,502 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:00:36,502 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:00:36,503 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:36" (1/1) ... [2024-11-19 00:00:36,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:00:36,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:00:36,540 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-19 00:00:36,546 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-19 00:00:36,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:00:36,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 00:00:36,594 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:00:36,594 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:00:36,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:00:36,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:00:36,686 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:00:36,689 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:00:46,188 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-19 00:00:46,189 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:00:46,205 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:00:46,206 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:00:46,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:00:46 BoogieIcfgContainer [2024-11-19 00:00:46,206 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:00:46,208 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:00:46,208 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:00:46,212 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:00:46,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:00:35" (1/3) ... [2024-11-19 00:00:46,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ce7b0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:00:46, skipping insertion in model container [2024-11-19 00:00:46,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:36" (2/3) ... [2024-11-19 00:00:46,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ce7b0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:00:46, skipping insertion in model container [2024-11-19 00:00:46,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:00:46" (3/3) ... [2024-11-19 00:00:46,217 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-98.i [2024-11-19 00:00:46,236 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:00:46,237 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:00:46,297 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:00:46,304 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;@30036c9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:00:46,305 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:00:46,310 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-19 00:00:46,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-19 00:00:46,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:00:46,326 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-19 00:00:46,327 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:00:46,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:00:46,335 INFO L85 PathProgramCache]: Analyzing trace with hash 140353710, now seen corresponding path program 1 times [2024-11-19 00:00:46,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:00:46,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [131964688] [2024-11-19 00:00:46,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:00:46,353 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-19 00:00:46,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:00:46,357 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-19 00:00:46,359 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-19 00:00:47,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:00:47,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:00:47,109 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:00:47,161 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-19 00:00:47,163 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:00:47,164 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:00:47,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [131964688] [2024-11-19 00:00:47,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [131964688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:00:47,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:00:47,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 00:00:47,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225835364] [2024-11-19 00:00:47,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:00:47,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:00:47,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:00:47,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:00:47,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:00:47,207 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-19 00:00:47,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:00:47,244 INFO L93 Difference]: Finished difference Result 101 states and 172 transitions. [2024-11-19 00:00:47,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:00:47,247 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-19 00:00:47,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:00:47,255 INFO L225 Difference]: With dead ends: 101 [2024-11-19 00:00:47,255 INFO L226 Difference]: Without dead ends: 50 [2024-11-19 00:00:47,260 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-19 00:00:47,263 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-19 00:00:47,264 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-19 00:00:47,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-19 00:00:47,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-19 00:00:47,306 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-19 00:00:47,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 72 transitions. [2024-11-19 00:00:47,310 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 72 transitions. Word has length 124 [2024-11-19 00:00:47,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:00:47,311 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 72 transitions. [2024-11-19 00:00:47,311 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-19 00:00:47,311 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions. [2024-11-19 00:00:47,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-19 00:00:47,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:00:47,316 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-19 00:00:47,334 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-19 00:00:47,520 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-19 00:00:47,521 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:00:47,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:00:47,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1782980654, now seen corresponding path program 1 times [2024-11-19 00:00:47,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:00:47,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [322222548] [2024-11-19 00:00:47,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:00:47,524 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-19 00:00:47,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:00:47,528 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-19 00:00:47,531 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-19 00:00:48,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:00:48,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-19 00:00:48,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:01:03,528 WARN L286 SmtUtils]: Spent 8.15s 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-19 00:01:14,420 WARN L286 SmtUtils]: Spent 8.17s 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-19 00:01:22,129 WARN L286 SmtUtils]: Spent 7.71s 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-19 00:01:30,252 WARN L286 SmtUtils]: Spent 8.12s 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-19 00:01:38,377 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)