./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-72.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-72.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 473c6c098417e653140bb6e4cb3c44882ec0d7e6b7ae197524bf5de6070b7483 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:20:48,430 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:20:48,516 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 12:20:48,522 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:20:48,522 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:20:48,559 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:20:48,559 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:20:48,560 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:20:48,561 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:20:48,562 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:20:48,562 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:20:48,563 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:20:48,563 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:20:48,565 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:20:48,566 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:20:48,566 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:20:48,566 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:20:48,567 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:20:48,567 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 12:20:48,567 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:20:48,568 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:20:48,572 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:20:48,573 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:20:48,573 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:20:48,573 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:20:48,573 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:20:48,574 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:20:48,574 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:20:48,574 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:20:48,575 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:20:48,575 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:20:48,575 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:20:48,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:20:48,575 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:20:48,576 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:20:48,576 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:20:48,576 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 12:20:48,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 12:20:48,577 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:20:48,577 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:20:48,577 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:20:48,579 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:20:48,579 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-clean/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-clean/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 -> 473c6c098417e653140bb6e4cb3c44882ec0d7e6b7ae197524bf5de6070b7483 [2024-10-11 12:20:48,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:20:48,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:20:48,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:20:48,913 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:20:48,913 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:20:48,915 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-72.i [2024-10-11 12:20:50,473 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:20:50,681 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:20:50,682 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-72.i [2024-10-11 12:20:50,690 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/31b16c3e3/ce45269530f14833906c79b2eeb8a105/FLAGf68095f6d [2024-10-11 12:20:50,707 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/31b16c3e3/ce45269530f14833906c79b2eeb8a105 [2024-10-11 12:20:50,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:20:50,712 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:20:50,713 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:20:50,714 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:20:50,719 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:20:50,720 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:20:50" (1/1) ... [2024-10-11 12:20:50,721 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dd52cd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:50, skipping insertion in model container [2024-10-11 12:20:50,722 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:20:50" (1/1) ... [2024-10-11 12:20:50,745 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:20:50,916 WARN L248 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_amount10_file-72.i[915,928] [2024-10-11 12:20:50,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:20:50,952 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:20:50,968 WARN L248 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_amount10_file-72.i[915,928] [2024-10-11 12:20:50,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:20:51,003 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:20:51,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:51 WrapperNode [2024-10-11 12:20:51,003 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:20:51,005 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:20:51,005 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:20:51,005 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:20:51,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:51" (1/1) ... [2024-10-11 12:20:51,020 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:51" (1/1) ... [2024-10-11 12:20:51,041 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 83 [2024-10-11 12:20:51,042 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:20:51,042 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:20:51,043 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:20:51,043 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:20:51,054 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:51" (1/1) ... [2024-10-11 12:20:51,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:51" (1/1) ... [2024-10-11 12:20:51,057 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:51" (1/1) ... [2024-10-11 12:20:51,074 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-10-11 12:20:51,077 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:51" (1/1) ... [2024-10-11 12:20:51,078 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:51" (1/1) ... [2024-10-11 12:20:51,088 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:51" (1/1) ... [2024-10-11 12:20:51,096 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:51" (1/1) ... [2024-10-11 12:20:51,115 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:51" (1/1) ... [2024-10-11 12:20:51,116 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:51" (1/1) ... [2024-10-11 12:20:51,119 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:20:51,121 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:20:51,121 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:20:51,121 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:20:51,122 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:51" (1/1) ... [2024-10-11 12:20:51,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:20:51,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:20:51,217 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:20:51,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:20:51,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:20:51,269 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:20:51,270 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:20:51,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 12:20:51,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:20:51,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:20:51,357 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:20:51,359 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:20:51,551 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 12:20:51,551 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:20:51,610 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:20:51,611 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:20:51,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:20:51 BoogieIcfgContainer [2024-10-11 12:20:51,612 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:20:51,614 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:20:51,616 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:20:51,619 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:20:51,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:20:50" (1/3) ... [2024-10-11 12:20:51,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@279f98a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:20:51, skipping insertion in model container [2024-10-11 12:20:51,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:51" (2/3) ... [2024-10-11 12:20:51,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@279f98a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:20:51, skipping insertion in model container [2024-10-11 12:20:51,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:20:51" (3/3) ... [2024-10-11 12:20:51,624 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-72.i [2024-10-11 12:20:51,641 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:20:51,642 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:20:51,723 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:20:51,731 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;@6d119d7f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:20:51,732 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:20:51,737 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 12:20:51,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 12:20:51,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:20:51,752 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 12:20:51,752 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:20:51,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:20:51,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1733438896, now seen corresponding path program 1 times [2024-10-11 12:20:51,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:20:51,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738045903] [2024-10-11 12:20:51,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:20:51,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:20:51,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:51,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:20:52,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:52,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:20:52,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:52,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:20:52,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:52,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:20:52,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:52,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:20:52,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:52,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:20:52,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:52,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:20:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:52,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:20:52,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:52,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:20:52,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:52,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:20:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:52,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:20:52,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:52,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:20:52,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:52,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:20:52,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:52,125 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 12:20:52,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:20:52,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738045903] [2024-10-11 12:20:52,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738045903] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:20:52,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:20:52,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:20:52,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037762407] [2024-10-11 12:20:52,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:20:52,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:20:52,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:20:52,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:20:52,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:20:52,167 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 12:20:52,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:20:52,215 INFO L93 Difference]: Finished difference Result 65 states and 111 transitions. [2024-10-11 12:20:52,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:20:52,218 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 78 [2024-10-11 12:20:52,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:20:52,224 INFO L225 Difference]: With dead ends: 65 [2024-10-11 12:20:52,225 INFO L226 Difference]: Without dead ends: 32 [2024-10-11 12:20:52,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 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-10-11 12:20:52,232 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:20:52,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:20:52,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-11 12:20:52,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-11 12:20:52,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 12:20:52,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 45 transitions. [2024-10-11 12:20:52,276 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 45 transitions. Word has length 78 [2024-10-11 12:20:52,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:20:52,276 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 45 transitions. [2024-10-11 12:20:52,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 12:20:52,277 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 45 transitions. [2024-10-11 12:20:52,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 12:20:52,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:20:52,280 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 12:20:52,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 12:20:52,281 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:20:52,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:20:52,281 INFO L85 PathProgramCache]: Analyzing trace with hash 12672878, now seen corresponding path program 1 times [2024-10-11 12:20:52,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:20:52,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344206453] [2024-10-11 12:20:52,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:20:52,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:20:52,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:20:52,474 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 12:20:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:20:52,656 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 12:20:52,657 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 12:20:52,659 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 12:20:52,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 12:20:52,665 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-11 12:20:52,742 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 12:20:52,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:20:52 BoogieIcfgContainer [2024-10-11 12:20:52,747 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 12:20:52,749 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 12:20:52,749 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 12:20:52,750 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 12:20:52,750 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:20:51" (3/4) ... [2024-10-11 12:20:52,753 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 12:20:52,754 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 12:20:52,755 INFO L158 Benchmark]: Toolchain (without parser) took 2042.80ms. Allocated memory is still 201.3MB. Free memory was 134.4MB in the beginning and 100.3MB in the end (delta: 34.1MB). Peak memory consumption was 32.3MB. Max. memory is 16.1GB. [2024-10-11 12:20:52,757 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 67.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:20:52,757 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.22ms. Allocated memory is still 201.3MB. Free memory was 134.2MB in the beginning and 121.4MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 12:20:52,758 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.28ms. Allocated memory is still 201.3MB. Free memory was 121.4MB in the beginning and 119.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 12:20:52,758 INFO L158 Benchmark]: Boogie Preprocessor took 77.47ms. Allocated memory is still 201.3MB. Free memory was 119.5MB in the beginning and 173.7MB in the end (delta: -54.2MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2024-10-11 12:20:52,760 INFO L158 Benchmark]: RCFGBuilder took 491.21ms. Allocated memory is still 201.3MB. Free memory was 173.7MB in the beginning and 159.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 12:20:52,760 INFO L158 Benchmark]: TraceAbstraction took 1132.78ms. Allocated memory is still 201.3MB. Free memory was 158.3MB in the beginning and 100.8MB in the end (delta: 57.4MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2024-10-11 12:20:52,760 INFO L158 Benchmark]: Witness Printer took 5.26ms. Allocated memory is still 201.3MB. Free memory was 100.8MB in the beginning and 100.3MB in the end (delta: 460.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:20:52,765 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.16ms. Allocated memory is still 104.9MB. Free memory is still 67.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.22ms. Allocated memory is still 201.3MB. Free memory was 134.2MB in the beginning and 121.4MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.28ms. Allocated memory is still 201.3MB. Free memory was 121.4MB in the beginning and 119.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.47ms. Allocated memory is still 201.3MB. Free memory was 119.5MB in the beginning and 173.7MB in the end (delta: -54.2MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * RCFGBuilder took 491.21ms. Allocated memory is still 201.3MB. Free memory was 173.7MB in the beginning and 159.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1132.78ms. Allocated memory is still 201.3MB. Free memory was 158.3MB in the beginning and 100.8MB in the end (delta: 57.4MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * Witness Printer took 5.26ms. Allocated memory is still 201.3MB. Free memory was 100.8MB in the beginning and 100.3MB in the end (delta: 460.8kB). 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 67, overapproximation of someUnaryDOUBLEoperation at line 31. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 4; [L23] unsigned long int var_1_3 = 3854620897; [L24] unsigned long int var_1_4 = 1; [L25] unsigned long int var_1_5 = 5; [L26] unsigned long int var_1_6 = 1934698459; [L27] unsigned long int var_1_7 = 1000000000; [L28] unsigned long int var_1_8 = 0; [L29] unsigned long int var_1_9 = 16; [L30] double var_1_10 = 31.375; [L31] double var_1_11 = -0.6; [L71] isInitial = 1 [L72] FCALL initially() [L73] COND TRUE 1 [L74] FCALL updateLastVariables() [L75] CALL updateVariables() [L43] var_1_3 = __VERIFIER_nondet_ulong() [L44] CALL assume_abort_if_not(var_1_3 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=11529215043920986111U, var_1_4=1, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=11529215043920986111U, var_1_4=1, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L44] RET assume_abort_if_not(var_1_3 >= 2147483647) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=11529215043920986111U, var_1_4=1, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L45] CALL assume_abort_if_not(var_1_3 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=11529215043920986111U, var_1_4=1, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=11529215043920986111U, var_1_4=1, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L45] RET assume_abort_if_not(var_1_3 <= 4294967295) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=11529215043920986111U, var_1_4=1, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L46] var_1_4 = __VERIFIER_nondet_ulong() [L47] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=11529215043920986111U, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=11529215043920986111U, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L47] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=11529215043920986111U, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L48] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=11529215043920986111U, var_1_4=-2684354560, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=11529215043920986111U, var_1_4=-2684354560, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L48] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=11529215043920986111U, var_1_4=-2684354560, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L49] var_1_5 = __VERIFIER_nondet_ulong() [L50] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=11529215043920986111U, var_1_4=-2684354560, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=11529215043920986111U, var_1_4=-2684354560, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L50] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=11529215043920986111U, var_1_4=-2684354560, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L51] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=11529215043920986111U, var_1_4=-2684354560, var_1_5=-2684354560, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=11529215043920986111U, var_1_4=-2684354560, var_1_5=-2684354560, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L51] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=11529215043920986111U, var_1_4=-2684354560, var_1_5=-2684354560, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L52] var_1_6 = __VERIFIER_nondet_ulong() [L53] CALL assume_abort_if_not(var_1_6 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=11529215043920986111U, var_1_4=-2684354560, var_1_5=-2684354560, var_1_6=9663676415, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=11529215043920986111U, var_1_4=-2684354560, var_1_5=-2684354560, var_1_6=9663676415, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L53] RET assume_abort_if_not(var_1_6 >= 1073741823) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=11529215043920986111U, var_1_4=-2684354560, var_1_5=-2684354560, var_1_6=9663676415, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L54] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=11529215043920986111U, var_1_4=-2684354560, var_1_5=-2684354560, var_1_6=9663676415, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=11529215043920986111U, var_1_4=-2684354560, var_1_5=-2684354560, var_1_6=9663676415, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L54] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=11529215043920986111U, var_1_4=-2684354560, var_1_5=-2684354560, var_1_6=9663676415, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L55] var_1_7 = __VERIFIER_nondet_ulong() [L56] CALL assume_abort_if_not(var_1_7 >= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=11529215043920986111U, var_1_4=-2684354560, var_1_5=-2684354560, var_1_6=9663676415, var_1_7=536870911, var_1_8=0, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=11529215043920986111U, var_1_4=-2684354560, var_1_5=-2684354560, var_1_6=9663676415, var_1_7=536870911, var_1_8=0, var_1_9=16] [L56] RET assume_abort_if_not(var_1_7 >= 536870911) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=11529215043920986111U, var_1_4=-2684354560, var_1_5=-2684354560, var_1_6=9663676415, var_1_7=536870911, var_1_8=0, var_1_9=16] [L57] CALL assume_abort_if_not(var_1_7 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=11529215043920986111U, var_1_4=-2684354560, var_1_5=-2684354560, var_1_6=9663676415, var_1_7=536870911, var_1_8=0, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=11529215043920986111U, var_1_4=-2684354560, var_1_5=-2684354560, var_1_6=9663676415, var_1_7=536870911, var_1_8=0, var_1_9=16] [L57] RET assume_abort_if_not(var_1_7 <= 1073741823) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=11529215043920986111U, var_1_4=-2684354560, var_1_5=-2684354560, var_1_6=9663676415, var_1_7=536870911, var_1_8=0, var_1_9=16] [L58] var_1_8 = __VERIFIER_nondet_ulong() [L59] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=11529215043920986111U, var_1_4=-2684354560, var_1_5=-2684354560, var_1_6=9663676415, var_1_7=536870911, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=11529215043920986111U, var_1_4=-2684354560, var_1_5=-2684354560, var_1_6=9663676415, var_1_7=536870911, var_1_9=16] [L59] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=11529215043920986111U, var_1_4=-2684354560, var_1_5=-2684354560, var_1_6=9663676415, var_1_7=536870911, var_1_9=16] [L60] CALL assume_abort_if_not(var_1_8 <= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=11529215043920986111U, var_1_4=-2684354560, var_1_5=-2684354560, var_1_6=9663676415, var_1_7=536870911, var_1_8=-3758096385, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=11529215043920986111U, var_1_4=-2684354560, var_1_5=-2684354560, var_1_6=9663676415, var_1_7=536870911, var_1_8=-3758096385, var_1_9=16] [L60] RET assume_abort_if_not(var_1_8 <= 536870911) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=11529215043920986111U, var_1_4=-2684354560, var_1_5=-2684354560, var_1_6=9663676415, var_1_7=536870911, var_1_8=-3758096385, var_1_9=16] [L61] var_1_11 = __VERIFIER_nondet_double() [L62] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=11529215043920986111U, var_1_4=-2684354560, var_1_5=-2684354560, var_1_6=9663676415, var_1_7=536870911, var_1_8=-3758096385, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=11529215043920986111U, var_1_4=-2684354560, var_1_5=-2684354560, var_1_6=9663676415, var_1_7=536870911, var_1_8=-3758096385, var_1_9=16] [L62] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=11529215043920986111U, var_1_4=-2684354560, var_1_5=-2684354560, var_1_6=9663676415, var_1_7=536870911, var_1_8=-3758096385, var_1_9=16] [L75] RET updateVariables() [L76] CALL step() [L35] var_1_9 = var_1_7 [L36] var_1_10 = var_1_11 [L37] unsigned long int stepLocal_0 = var_1_9; VAL [isInitial=1, stepLocal_0=536870911, var_1_10=11529215043920986116, var_1_11=11529215043920986116, var_1_1=4, var_1_3=11529215043920986111U, var_1_4=-2684354560, var_1_5=-2684354560, var_1_6=9663676415, var_1_7=536870911, var_1_8=-3758096385, var_1_9=536870911] [L38] COND TRUE stepLocal_0 >= (var_1_3 - ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) [L39] var_1_1 = (var_1_4 + (var_1_6 - (var_1_7 - var_1_8))) VAL [isInitial=1, var_1_10=11529215043920986116, var_1_11=11529215043920986116, var_1_1=2684354559, var_1_3=11529215043920986111U, var_1_4=-2684354560, var_1_5=-2684354560, var_1_6=9663676415, var_1_7=536870911, var_1_8=-3758096385, var_1_9=536870911] [L76] RET step() [L77] CALL, EXPR property() [L67-L68] return (((var_1_9 >= (var_1_3 - ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))) ? (var_1_1 == ((unsigned long int) (var_1_4 + (var_1_6 - (var_1_7 - var_1_8))))) : 1) && (var_1_9 == ((unsigned long int) var_1_7))) && (var_1_10 == ((double) var_1_11)) ; [L77] RET, EXPR property() [L77] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=11529215043920986116, var_1_11=11529215043920986116, var_1_1=2684354559, var_1_3=11529215043920986111U, var_1_4=-2684354560, var_1_5=-2684354560, var_1_6=9663676415, var_1_7=536870911, var_1_8=-3758096385, var_1_9=536870911] [L19] reach_error() VAL [isInitial=1, var_1_10=11529215043920986116, var_1_11=11529215043920986116, var_1_1=2684354559, var_1_3=11529215043920986111U, var_1_4=-2684354560, var_1_5=-2684354560, var_1_6=9663676415, var_1_7=536870911, var_1_8=-3758096385, var_1_9=536870911] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 42 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 42 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 77 ConstructedInterpolants, 0 QuantifiedInterpolants, 77 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 312/312 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-10-11 12:20:52,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-72.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 473c6c098417e653140bb6e4cb3c44882ec0d7e6b7ae197524bf5de6070b7483 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:20:55,217 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:20:55,298 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 12:20:55,305 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:20:55,306 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:20:55,340 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:20:55,344 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:20:55,345 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:20:55,345 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:20:55,346 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:20:55,346 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:20:55,347 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:20:55,347 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:20:55,350 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:20:55,350 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:20:55,350 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:20:55,351 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:20:55,351 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:20:55,351 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:20:55,352 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:20:55,352 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:20:55,356 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:20:55,356 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:20:55,356 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 12:20:55,356 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 12:20:55,357 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:20:55,357 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 12:20:55,357 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:20:55,357 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:20:55,357 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:20:55,358 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:20:55,358 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:20:55,358 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:20:55,359 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:20:55,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:20:55,361 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:20:55,362 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:20:55,362 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:20:55,363 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 12:20:55,363 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 12:20:55,363 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:20:55,364 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:20:55,364 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:20:55,364 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:20:55,364 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 12:20:55,364 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-clean/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-clean/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 -> 473c6c098417e653140bb6e4cb3c44882ec0d7e6b7ae197524bf5de6070b7483 [2024-10-11 12:20:55,733 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:20:55,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:20:55,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:20:55,764 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:20:55,765 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:20:55,767 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-72.i [2024-10-11 12:20:57,349 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:20:57,581 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:20:57,583 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-72.i [2024-10-11 12:20:57,595 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6aadefc97/fb0b7832087d49d08b074529a3cdb885/FLAG513de3581 [2024-10-11 12:20:57,614 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6aadefc97/fb0b7832087d49d08b074529a3cdb885 [2024-10-11 12:20:57,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:20:57,620 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:20:57,623 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:20:57,623 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:20:57,629 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:20:57,630 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:20:57" (1/1) ... [2024-10-11 12:20:57,631 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bcb9ecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:57, skipping insertion in model container [2024-10-11 12:20:57,631 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:20:57" (1/1) ... [2024-10-11 12:20:57,656 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:20:57,864 WARN L248 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_amount10_file-72.i[915,928] [2024-10-11 12:20:57,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:20:57,928 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:20:57,943 WARN L248 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_amount10_file-72.i[915,928] [2024-10-11 12:20:57,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:20:57,987 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:20:57,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:57 WrapperNode [2024-10-11 12:20:57,988 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:20:57,989 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:20:57,989 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:20:57,989 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:20:57,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:57" (1/1) ... [2024-10-11 12:20:58,012 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:57" (1/1) ... [2024-10-11 12:20:58,040 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 83 [2024-10-11 12:20:58,041 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:20:58,044 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:20:58,044 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:20:58,044 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:20:58,056 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:57" (1/1) ... [2024-10-11 12:20:58,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:57" (1/1) ... [2024-10-11 12:20:58,060 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:57" (1/1) ... [2024-10-11 12:20:58,077 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-10-11 12:20:58,078 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:57" (1/1) ... [2024-10-11 12:20:58,079 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:57" (1/1) ... [2024-10-11 12:20:58,087 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:57" (1/1) ... [2024-10-11 12:20:58,094 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:57" (1/1) ... [2024-10-11 12:20:58,099 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:57" (1/1) ... [2024-10-11 12:20:58,100 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:57" (1/1) ... [2024-10-11 12:20:58,107 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:20:58,108 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:20:58,108 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:20:58,112 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:20:58,113 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:57" (1/1) ... [2024-10-11 12:20:58,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:20:58,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:20:58,150 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:20:58,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:20:58,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:20:58,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 12:20:58,204 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:20:58,204 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:20:58,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:20:58,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:20:58,279 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:20:58,282 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:20:58,553 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 12:20:58,553 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:20:58,616 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:20:58,618 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:20:58,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:20:58 BoogieIcfgContainer [2024-10-11 12:20:58,619 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:20:58,621 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:20:58,621 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:20:58,624 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:20:58,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:20:57" (1/3) ... [2024-10-11 12:20:58,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ae8a179 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:20:58, skipping insertion in model container [2024-10-11 12:20:58,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:57" (2/3) ... [2024-10-11 12:20:58,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ae8a179 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:20:58, skipping insertion in model container [2024-10-11 12:20:58,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:20:58" (3/3) ... [2024-10-11 12:20:58,629 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-72.i [2024-10-11 12:20:58,646 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:20:58,646 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:20:58,723 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:20:58,731 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;@317bc593, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:20:58,732 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:20:58,736 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 12:20:58,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 12:20:58,747 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:20:58,748 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 12:20:58,749 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:20:58,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:20:58,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1733438896, now seen corresponding path program 1 times [2024-10-11 12:20:58,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:20:58,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2010698898] [2024-10-11 12:20:58,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:20:58,771 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-10-11 12:20:58,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:20:58,775 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-10-11 12:20:58,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 12:20:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:59,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 12:20:59,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:20:59,225 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2024-10-11 12:20:59,226 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:20:59,227 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:20:59,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2010698898] [2024-10-11 12:20:59,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2010698898] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:20:59,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:20:59,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:20:59,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426149450] [2024-10-11 12:20:59,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:20:59,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:20:59,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:20:59,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:20:59,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:20:59,262 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 12:20:59,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:20:59,309 INFO L93 Difference]: Finished difference Result 65 states and 111 transitions. [2024-10-11 12:20:59,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:20:59,316 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 78 [2024-10-11 12:20:59,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:20:59,323 INFO L225 Difference]: With dead ends: 65 [2024-10-11 12:20:59,323 INFO L226 Difference]: Without dead ends: 32 [2024-10-11 12:20:59,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 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-10-11 12:20:59,333 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:20:59,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:20:59,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-11 12:20:59,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-11 12:20:59,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 12:20:59,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 45 transitions. [2024-10-11 12:20:59,383 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 45 transitions. Word has length 78 [2024-10-11 12:20:59,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:20:59,384 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 45 transitions. [2024-10-11 12:20:59,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 12:20:59,385 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 45 transitions. [2024-10-11 12:20:59,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 12:20:59,390 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:20:59,391 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 12:20:59,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 12:20:59,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-10-11 12:20:59,592 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:20:59,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:20:59,594 INFO L85 PathProgramCache]: Analyzing trace with hash 12672878, now seen corresponding path program 1 times [2024-10-11 12:20:59,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:20:59,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1524276047] [2024-10-11 12:20:59,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:20:59,595 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-10-11 12:20:59,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:20:59,599 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-10-11 12:20:59,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 12:20:59,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:20:59,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 12:20:59,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:21:00,674 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-10-11 12:21:00,674 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:21:00,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:21:00,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1524276047] [2024-10-11 12:21:00,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1524276047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:21:00,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:21:00,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 12:21:00,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061427673] [2024-10-11 12:21:00,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:21:00,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 12:21:00,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:21:00,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 12:21:00,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-11 12:21:00,689 INFO L87 Difference]: Start difference. First operand 32 states and 45 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 12:21:02,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:21:02,496 INFO L93 Difference]: Finished difference Result 72 states and 92 transitions. [2024-10-11 12:21:02,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 12:21:02,497 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 78 [2024-10-11 12:21:02,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:21:02,500 INFO L225 Difference]: With dead ends: 72 [2024-10-11 12:21:02,500 INFO L226 Difference]: Without dead ends: 70 [2024-10-11 12:21:02,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2024-10-11 12:21:02,502 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 42 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 12:21:02,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 123 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 12:21:02,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-11 12:21:02,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2024-10-11 12:21:02,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 36 states have internal predecessors, (36), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 12:21:02,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 82 transitions. [2024-10-11 12:21:02,528 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 82 transitions. Word has length 78 [2024-10-11 12:21:02,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:21:02,528 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 82 transitions. [2024-10-11 12:21:02,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 12:21:02,529 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 82 transitions. [2024-10-11 12:21:02,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 12:21:02,530 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:21:02,531 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 12:21:02,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 12:21:02,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-10-11 12:21:02,735 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:21:02,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:21:02,736 INFO L85 PathProgramCache]: Analyzing trace with hash 12732460, now seen corresponding path program 1 times [2024-10-11 12:21:02,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:21:02,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1089166775] [2024-10-11 12:21:02,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:21:02,737 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-10-11 12:21:02,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:21:02,740 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-10-11 12:21:02,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 12:21:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:21:02,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 12:21:02,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:21:03,750 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 147 proven. 6 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2024-10-11 12:21:03,750 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 12:21:06,209 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-10-11 12:21:06,210 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:21:06,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1089166775] [2024-10-11 12:21:06,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1089166775] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 12:21:06,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 12:21:06,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 18 [2024-10-11 12:21:06,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488139391] [2024-10-11 12:21:06,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:21:06,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 12:21:06,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:21:06,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 12:21:06,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2024-10-11 12:21:06,213 INFO L87 Difference]: Start difference. First operand 62 states and 82 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 12:21:07,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:21:07,666 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2024-10-11 12:21:07,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 12:21:07,668 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 78 [2024-10-11 12:21:07,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:21:07,669 INFO L225 Difference]: With dead ends: 68 [2024-10-11 12:21:07,669 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 12:21:07,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2024-10-11 12:21:07,671 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 32 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 12:21:07,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 88 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 12:21:07,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 12:21:07,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 12:21:07,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 12:21:07,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 12:21:07,674 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2024-10-11 12:21:07,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:21:07,674 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 12:21:07,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 12:21:07,674 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 12:21:07,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 12:21:07,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 12:21:07,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 12:21:07,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-10-11 12:21:07,882 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 12:21:07,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 12:21:13,908 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 12:21:13,924 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-11 12:21:13,924 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-11 12:21:13,925 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-11 12:21:13,925 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-11 12:21:13,925 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-11 12:21:13,926 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-11 12:21:13,929 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-11 12:21:13,929 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-11 12:21:13,930 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-11 12:21:13,930 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-11 12:21:13,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:21:13 BoogieIcfgContainer [2024-10-11 12:21:13,933 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 12:21:13,934 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 12:21:13,934 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 12:21:13,934 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 12:21:13,934 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:20:58" (3/4) ... [2024-10-11 12:21:13,938 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 12:21:13,943 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-11 12:21:13,948 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-10-11 12:21:13,950 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-11 12:21:13,950 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 12:21:13,950 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 12:21:14,060 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 12:21:14,060 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 12:21:14,060 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 12:21:14,061 INFO L158 Benchmark]: Toolchain (without parser) took 16441.77ms. Allocated memory was 67.1MB in the beginning and 98.6MB in the end (delta: 31.5MB). Free memory was 33.6MB in the beginning and 37.4MB in the end (delta: -3.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-11 12:21:14,061 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 50.3MB. Free memory is still 33.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:21:14,062 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.01ms. Allocated memory is still 67.1MB. Free memory was 33.4MB in the beginning and 37.9MB in the end (delta: -4.4MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2024-10-11 12:21:14,062 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.52ms. Allocated memory is still 67.1MB. Free memory was 37.9MB in the beginning and 36.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 12:21:14,062 INFO L158 Benchmark]: Boogie Preprocessor took 63.16ms. Allocated memory is still 67.1MB. Free memory was 36.0MB in the beginning and 33.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 12:21:14,063 INFO L158 Benchmark]: RCFGBuilder took 510.76ms. Allocated memory is still 67.1MB. Free memory was 33.9MB in the beginning and 37.7MB in the end (delta: -3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 12:21:14,065 INFO L158 Benchmark]: TraceAbstraction took 15312.31ms. Allocated memory was 67.1MB in the beginning and 98.6MB in the end (delta: 31.5MB). Free memory was 37.1MB in the beginning and 42.6MB in the end (delta: -5.5MB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB. [2024-10-11 12:21:14,065 INFO L158 Benchmark]: Witness Printer took 126.93ms. Allocated memory is still 98.6MB. Free memory was 42.6MB in the beginning and 37.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 12:21:14,066 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.21ms. Allocated memory is still 50.3MB. Free memory is still 33.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 365.01ms. Allocated memory is still 67.1MB. Free memory was 33.4MB in the beginning and 37.9MB in the end (delta: -4.4MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.52ms. Allocated memory is still 67.1MB. Free memory was 37.9MB in the beginning and 36.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.16ms. Allocated memory is still 67.1MB. Free memory was 36.0MB in the beginning and 33.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 510.76ms. Allocated memory is still 67.1MB. Free memory was 33.9MB in the beginning and 37.7MB in the end (delta: -3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 15312.31ms. Allocated memory was 67.1MB in the beginning and 98.6MB in the end (delta: 31.5MB). Free memory was 37.1MB in the beginning and 42.6MB in the end (delta: -5.5MB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB. * Witness Printer took 126.93ms. Allocated memory is still 98.6MB. Free memory was 42.6MB in the beginning and 37.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.2s, OverallIterations: 3, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 75 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 74 mSDsluCounter, 253 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 139 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 381 IncrementalHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 114 mSDtfsCounter, 381 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 323 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=2, InterpolantAutomatonStates: 28, 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, 3 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 234 NumberOfCodeBlocks, 234 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 308 ConstructedInterpolants, 5 QuantifiedInterpolants, 1370 SizeOfPredicates, 29 NumberOfNonLiveVariables, 389 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 1242/1248 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: null - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (0 != cond) RESULT: Ultimate proved your program to be correct! [2024-10-11 12:21:14,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 Writing output log to file Ultimate.log Result: TRUE