./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_amount25_file-50.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_amount25_file-50.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 fb6084b1d47e624872609ebdc1d7596105f0fe52752c1031b16d65d48dd2a5c7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:36:21,654 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:36:21,705 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:36:21,708 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:36:21,708 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:36:21,734 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:36:21,735 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:36:21,735 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:36:21,735 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:36:21,736 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:36:21,736 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:36:21,736 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:36:21,736 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:36:21,737 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:36:21,737 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:36:21,737 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:36:21,738 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:36:21,738 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:36:21,738 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 12:36:21,738 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:36:21,739 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:36:21,739 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:36:21,739 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:36:21,740 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:36:21,740 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:36:21,740 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:36:21,740 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:36:21,741 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:36:21,741 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:36:21,741 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:36:21,741 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:36:21,742 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:36:21,742 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:36:21,742 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:36:21,742 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:36:21,743 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:36:21,743 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 12:36:21,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 12:36:21,743 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:36:21,744 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:36:21,744 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:36:21,744 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:36:21,744 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 -> fb6084b1d47e624872609ebdc1d7596105f0fe52752c1031b16d65d48dd2a5c7 [2024-10-11 12:36:21,955 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:36:21,977 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:36:21,980 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:36:21,982 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:36:21,982 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:36:21,983 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-50.i [2024-10-11 12:36:23,364 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:36:23,531 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:36:23,532 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-50.i [2024-10-11 12:36:23,543 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/eaeb50a3b/c360cc206f2b47199376715ba0116dfd/FLAGe6ecf6928 [2024-10-11 12:36:23,926 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/eaeb50a3b/c360cc206f2b47199376715ba0116dfd [2024-10-11 12:36:23,928 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:36:23,929 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:36:23,932 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:36:23,933 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:36:23,937 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:36:23,937 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:36:23" (1/1) ... [2024-10-11 12:36:23,938 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@756e35db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:23, skipping insertion in model container [2024-10-11 12:36:23,938 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:36:23" (1/1) ... [2024-10-11 12:36:23,962 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:36:24,076 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_amount25_file-50.i[915,928] [2024-10-11 12:36:24,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:36:24,118 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:36:24,128 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_amount25_file-50.i[915,928] [2024-10-11 12:36:24,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:36:24,156 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:36:24,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:24 WrapperNode [2024-10-11 12:36:24,157 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:36:24,158 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:36:24,158 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:36:24,158 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:36:24,163 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:36:24" (1/1) ... [2024-10-11 12:36:24,173 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:36:24" (1/1) ... [2024-10-11 12:36:24,198 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-10-11 12:36:24,198 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:36:24,199 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:36:24,199 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:36:24,199 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:36:24,208 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:24" (1/1) ... [2024-10-11 12:36:24,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:24" (1/1) ... [2024-10-11 12:36:24,209 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:24" (1/1) ... [2024-10-11 12:36:24,220 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:36:24,221 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:24" (1/1) ... [2024-10-11 12:36:24,221 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:24" (1/1) ... [2024-10-11 12:36:24,225 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:24" (1/1) ... [2024-10-11 12:36:24,227 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:24" (1/1) ... [2024-10-11 12:36:24,228 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:24" (1/1) ... [2024-10-11 12:36:24,229 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:24" (1/1) ... [2024-10-11 12:36:24,231 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:36:24,231 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:36:24,231 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:36:24,232 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:36:24,232 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:24" (1/1) ... [2024-10-11 12:36:24,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:36:24,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:36:24,272 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:36:24,278 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:36:24,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:36:24,319 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:36:24,319 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:36:24,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 12:36:24,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:36:24,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:36:24,386 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:36:24,388 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:36:24,553 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-11 12:36:24,554 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:36:24,590 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:36:24,590 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:36:24,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:36:24 BoogieIcfgContainer [2024-10-11 12:36:24,591 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:36:24,594 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:36:24,594 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:36:24,597 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:36:24,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:36:23" (1/3) ... [2024-10-11 12:36:24,598 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59724fd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:36:24, skipping insertion in model container [2024-10-11 12:36:24,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:24" (2/3) ... [2024-10-11 12:36:24,599 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59724fd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:36:24, skipping insertion in model container [2024-10-11 12:36:24,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:36:24" (3/3) ... [2024-10-11 12:36:24,600 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-50.i [2024-10-11 12:36:24,618 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:36:24,618 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:36:24,671 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:36:24,677 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;@4903ee03, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:36:24,678 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:36:24,681 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 12:36:24,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 12:36:24,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:36:24,691 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:24,691 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:36:24,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:36:24,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1695088588, now seen corresponding path program 1 times [2024-10-11 12:36:24,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:36:24,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395739962] [2024-10-11 12:36:24,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:36:24,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:36:24,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:24,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:36:24,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:24,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 12:36:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:24,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 12:36:24,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:24,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 12:36:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:24,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 12:36:24,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:24,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 12:36:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:24,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 12:36:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:24,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 12:36:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:24,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 12:36:24,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:24,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 12:36:24,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:24,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 12:36:24,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:24,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 12:36:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:24,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 12:36:24,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:24,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 12:36:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:24,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 12:36:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:24,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 12:36:24,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:24,995 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 12:36:24,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:36:24,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395739962] [2024-10-11 12:36:24,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395739962] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:36:24,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:36:24,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:36:25,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833096305] [2024-10-11 12:36:25,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:36:25,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:36:25,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:36:25,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:36:25,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:36:25,027 INFO L87 Difference]: Start difference. First operand has 47 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 12:36:25,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:36:25,094 INFO L93 Difference]: Finished difference Result 91 states and 156 transitions. [2024-10-11 12:36:25,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:36:25,097 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 101 [2024-10-11 12:36:25,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:36:25,126 INFO L225 Difference]: With dead ends: 91 [2024-10-11 12:36:25,126 INFO L226 Difference]: Without dead ends: 45 [2024-10-11 12:36:25,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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:36:25,133 INFO L432 NwaCegarLoop]: 63 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, 63 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:36:25,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:36:25,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-11 12:36:25,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-11 12:36:25,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 12:36:25,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 66 transitions. [2024-10-11 12:36:25,173 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 66 transitions. Word has length 101 [2024-10-11 12:36:25,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:36:25,173 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 66 transitions. [2024-10-11 12:36:25,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 12:36:25,174 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 66 transitions. [2024-10-11 12:36:25,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 12:36:25,177 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:36:25,177 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:25,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 12:36:25,178 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:36:25,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:36:25,179 INFO L85 PathProgramCache]: Analyzing trace with hash 810500308, now seen corresponding path program 1 times [2024-10-11 12:36:25,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:36:25,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894378181] [2024-10-11 12:36:25,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:36:25,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:36:25,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:25,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:36:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:25,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 12:36:25,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:25,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 12:36:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:25,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 12:36:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:25,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 12:36:25,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:25,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 12:36:25,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:25,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 12:36:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:25,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 12:36:25,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:25,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 12:36:25,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:25,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 12:36:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:25,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 12:36:25,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:25,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 12:36:25,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:25,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 12:36:25,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:25,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 12:36:25,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:25,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 12:36:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:25,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 12:36:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:25,942 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 21 proven. 24 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-10-11 12:36:25,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:36:25,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894378181] [2024-10-11 12:36:25,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894378181] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 12:36:25,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374418323] [2024-10-11 12:36:25,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:36:25,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:36:25,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:36:25,948 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 12:36:25,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 12:36:26,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:26,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 12:36:26,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:36:26,427 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 289 proven. 39 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-10-11 12:36:26,427 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 12:36:26,714 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 21 proven. 24 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-10-11 12:36:26,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374418323] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 12:36:26,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 12:36:26,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 8] total 16 [2024-10-11 12:36:26,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460117762] [2024-10-11 12:36:26,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 12:36:26,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 12:36:26,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:36:26,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 12:36:26,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2024-10-11 12:36:26,723 INFO L87 Difference]: Start difference. First operand 45 states and 66 transitions. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 4 states have call successors, (30), 3 states have call predecessors, (30), 6 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2024-10-11 12:36:27,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:36:27,363 INFO L93 Difference]: Finished difference Result 157 states and 216 transitions. [2024-10-11 12:36:27,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 12:36:27,364 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 4 states have call successors, (30), 3 states have call predecessors, (30), 6 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) Word has length 101 [2024-10-11 12:36:27,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:36:27,368 INFO L225 Difference]: With dead ends: 157 [2024-10-11 12:36:27,369 INFO L226 Difference]: Without dead ends: 113 [2024-10-11 12:36:27,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 223 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2024-10-11 12:36:27,371 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 145 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 12:36:27,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 325 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 12:36:27,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-11 12:36:27,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 56. [2024-10-11 12:36:27,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 36 states have internal predecessors, (44), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 12:36:27,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2024-10-11 12:36:27,390 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 76 transitions. Word has length 101 [2024-10-11 12:36:27,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:36:27,391 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 76 transitions. [2024-10-11 12:36:27,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 4 states have call successors, (30), 3 states have call predecessors, (30), 6 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2024-10-11 12:36:27,391 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2024-10-11 12:36:27,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 12:36:27,395 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:36:27,395 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:27,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 12:36:27,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:36:27,600 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:36:27,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:36:27,601 INFO L85 PathProgramCache]: Analyzing trace with hash 867758610, now seen corresponding path program 1 times [2024-10-11 12:36:27,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:36:27,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690039218] [2024-10-11 12:36:27,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:36:27,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:36:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:36:27,664 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 12:36:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:36:27,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 12:36:27,741 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 12:36:27,742 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 12:36:27,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 12:36:27,746 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 12:36:27,795 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 12:36:27,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:36:27 BoogieIcfgContainer [2024-10-11 12:36:27,798 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 12:36:27,798 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 12:36:27,798 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 12:36:27,798 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 12:36:27,799 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:36:24" (3/4) ... [2024-10-11 12:36:27,800 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 12:36:27,801 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 12:36:27,802 INFO L158 Benchmark]: Toolchain (without parser) took 3872.29ms. Allocated memory is still 195.0MB. Free memory was 127.3MB in the beginning and 76.0MB in the end (delta: 51.4MB). Peak memory consumption was 53.6MB. Max. memory is 16.1GB. [2024-10-11 12:36:27,802 INFO L158 Benchmark]: CDTParser took 0.54ms. Allocated memory is still 127.9MB. Free memory is still 93.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:36:27,802 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.93ms. Allocated memory is still 195.0MB. Free memory was 126.8MB in the beginning and 113.1MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 12:36:27,802 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.31ms. Allocated memory is still 195.0MB. Free memory was 113.1MB in the beginning and 110.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 12:36:27,803 INFO L158 Benchmark]: Boogie Preprocessor took 31.99ms. Allocated memory is still 195.0MB. Free memory was 110.6MB in the beginning and 108.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 12:36:27,803 INFO L158 Benchmark]: RCFGBuilder took 359.27ms. Allocated memory is still 195.0MB. Free memory was 108.4MB in the beginning and 89.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 12:36:27,803 INFO L158 Benchmark]: TraceAbstraction took 3203.66ms. Allocated memory is still 195.0MB. Free memory was 89.0MB in the beginning and 76.0MB in the end (delta: 13.1MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. [2024-10-11 12:36:27,803 INFO L158 Benchmark]: Witness Printer took 3.18ms. Allocated memory is still 195.0MB. Free memory is still 76.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:36:27,804 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.54ms. Allocated memory is still 127.9MB. Free memory is still 93.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 224.93ms. Allocated memory is still 195.0MB. Free memory was 126.8MB in the beginning and 113.1MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.31ms. Allocated memory is still 195.0MB. Free memory was 113.1MB in the beginning and 110.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.99ms. Allocated memory is still 195.0MB. Free memory was 110.6MB in the beginning and 108.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 359.27ms. Allocated memory is still 195.0MB. Free memory was 108.4MB in the beginning and 89.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3203.66ms. Allocated memory is still 195.0MB. Free memory was 89.0MB in the beginning and 76.0MB in the end (delta: 13.1MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. * Witness Printer took 3.18ms. Allocated memory is still 195.0MB. Free memory is still 76.0MB. 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 100. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] double var_1_2 = 8.875; [L24] double var_1_3 = 63.5; [L25] double var_1_4 = 16.6; [L26] double var_1_5 = 127.8; [L27] unsigned char var_1_6 = 0; [L28] unsigned char var_1_7 = 0; [L29] unsigned char var_1_8 = 1; [L30] signed short int var_1_9 = 256; [L31] signed short int var_1_10 = 10000; [L32] signed short int var_1_11 = 4; [L33] signed short int var_1_12 = -32; [L34] signed long int var_1_13 = 32; [L35] signed short int var_1_14 = 32; [L36] signed long int last_1_var_1_13 = 32; [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] CALL updateLastVariables() [L97] last_1_var_1_13 = var_1_13 [L107] RET updateLastVariables() [L108] CALL updateVariables() [L69] var_1_2 = __VERIFIER_nondet_double() [L70] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_3=127/2, var_1_4=83/5, var_1_5=639/5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_3=127/2, var_1_4=83/5, var_1_5=639/5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=256] [L70] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_3=127/2, var_1_4=83/5, var_1_5=639/5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=256] [L71] var_1_3 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_4=83/5, var_1_5=639/5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_4=83/5, var_1_5=639/5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=256] [L72] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_4=83/5, var_1_5=639/5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=256] [L73] var_1_4 = __VERIFIER_nondet_double() [L74] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_5=639/5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_5=639/5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=256] [L74] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_5=639/5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=256] [L75] var_1_5 = __VERIFIER_nondet_double() [L76] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=256] [L76] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=256] [L77] var_1_6 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_7=0, var_1_8=1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_7=0, var_1_8=1, var_1_9=256] [L78] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_7=0, var_1_8=1, var_1_9=256] [L79] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=256] [L79] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=256] [L80] var_1_7 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_8=1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_8=1, var_1_9=256] [L81] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_8=1, var_1_9=256] [L82] CALL assume_abort_if_not(var_1_7 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=-256, var_1_8=1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=-256, var_1_8=1, var_1_9=256] [L82] RET assume_abort_if_not(var_1_7 <= 0) VAL [isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=-256, var_1_8=1, var_1_9=256] [L83] var_1_8 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=-256, var_1_8=-255, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=-256, var_1_8=-255, var_1_9=256] [L84] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=-256, var_1_8=-255, var_1_9=256] [L85] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=-256, var_1_8=-255, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=-256, var_1_8=-255, var_1_9=256] [L85] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_13=32, var_1_10=10000, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=-256, var_1_8=-255, var_1_9=256] [L86] var_1_10 = __VERIFIER_nondet_short() [L87] CALL assume_abort_if_not(var_1_10 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=32766, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=-256, var_1_8=-255, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=32766, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=-256, var_1_8=-255, var_1_9=256] [L87] RET assume_abort_if_not(var_1_10 >= -1) VAL [isInitial=1, last_1_var_1_13=32, var_1_10=32766, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=-256, var_1_8=-255, var_1_9=256] [L88] CALL assume_abort_if_not(var_1_10 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=32766, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=-256, var_1_8=-255, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=32766, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=-256, var_1_8=-255, var_1_9=256] [L88] RET assume_abort_if_not(var_1_10 <= 32766) VAL [isInitial=1, last_1_var_1_13=32, var_1_10=32766, var_1_11=4, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=-256, var_1_8=-255, var_1_9=256] [L89] var_1_11 = __VERIFIER_nondet_short() [L90] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=32766, var_1_11=0, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=-256, var_1_8=-255, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=32766, var_1_11=0, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=-256, var_1_8=-255, var_1_9=256] [L90] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_13=32, var_1_10=32766, var_1_11=0, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=-256, var_1_8=-255, var_1_9=256] [L91] CALL assume_abort_if_not(var_1_11 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=32766, var_1_11=0, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=-256, var_1_8=-255, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=32766, var_1_11=0, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=-256, var_1_8=-255, var_1_9=256] [L91] RET assume_abort_if_not(var_1_11 <= 32766) VAL [isInitial=1, last_1_var_1_13=32, var_1_10=32766, var_1_11=0, var_1_12=-32, var_1_13=32, var_1_14=32, var_1_1=1, var_1_6=0, var_1_7=-256, var_1_8=-255, var_1_9=256] [L92] var_1_14 = __VERIFIER_nondet_short() [L93] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=32766, var_1_11=0, var_1_12=-32, var_1_13=32, var_1_14=0, var_1_1=1, var_1_6=0, var_1_7=-256, var_1_8=-255, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=32766, var_1_11=0, var_1_12=-32, var_1_13=32, var_1_14=0, var_1_1=1, var_1_6=0, var_1_7=-256, var_1_8=-255, var_1_9=256] [L93] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_13=32, var_1_10=32766, var_1_11=0, var_1_12=-32, var_1_13=32, var_1_14=0, var_1_1=1, var_1_6=0, var_1_7=-256, var_1_8=-255, var_1_9=256] [L94] CALL assume_abort_if_not(var_1_14 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=32766, var_1_11=0, var_1_12=-32, var_1_13=32, var_1_14=0, var_1_1=1, var_1_6=0, var_1_7=-256, var_1_8=-255, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=32, var_1_10=32766, var_1_11=0, var_1_12=-32, var_1_13=32, var_1_14=0, var_1_1=1, var_1_6=0, var_1_7=-256, var_1_8=-255, var_1_9=256] [L94] RET assume_abort_if_not(var_1_14 <= 32767) VAL [isInitial=1, last_1_var_1_13=32, var_1_10=32766, var_1_11=0, var_1_12=-32, var_1_13=32, var_1_14=0, var_1_1=1, var_1_6=0, var_1_7=-256, var_1_8=-255, var_1_9=256] [L108] RET updateVariables() [L109] CALL step() [L40] COND FALSE !((((((var_1_2 + var_1_3)) < ((var_1_4 - var_1_5))) ? ((var_1_2 + var_1_3)) : ((var_1_4 - var_1_5)))) != 31.9) [L47] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_13=32, var_1_10=32766, var_1_11=0, var_1_12=-32, var_1_13=32, var_1_14=0, var_1_1=-256, var_1_6=0, var_1_7=-256, var_1_8=-255, var_1_9=256] [L49] COND TRUE var_1_2 > var_1_5 [L50] var_1_9 = (var_1_10 - var_1_11) VAL [isInitial=1, last_1_var_1_13=32, var_1_10=32766, var_1_11=0, var_1_12=-32, var_1_13=32, var_1_14=0, var_1_1=-256, var_1_6=0, var_1_7=-256, var_1_8=-255, var_1_9=32766] [L52] unsigned char stepLocal_0 = var_1_8; VAL [isInitial=1, last_1_var_1_13=32, stepLocal_0=-255, var_1_10=32766, var_1_11=0, var_1_12=-32, var_1_13=32, var_1_14=0, var_1_1=-256, var_1_6=0, var_1_7=-256, var_1_8=-255, var_1_9=32766] [L53] COND FALSE !(var_1_1 && stepLocal_0) VAL [isInitial=1, last_1_var_1_13=32, var_1_10=32766, var_1_11=0, var_1_12=-32, var_1_13=32, var_1_14=0, var_1_1=-256, var_1_6=0, var_1_7=-256, var_1_8=-255, var_1_9=32766] [L56] signed short int stepLocal_2 = var_1_9; [L57] signed long int stepLocal_1 = var_1_11 - var_1_14; VAL [isInitial=1, last_1_var_1_13=32, stepLocal_1=0, stepLocal_2=32766, var_1_10=32766, var_1_11=0, var_1_12=-32, var_1_13=32, var_1_14=0, var_1_1=-256, var_1_6=0, var_1_7=-256, var_1_8=-255, var_1_9=32766] [L58] COND TRUE var_1_11 <= stepLocal_2 [L59] var_1_13 = (var_1_10 - var_1_11) VAL [isInitial=1, last_1_var_1_13=32, stepLocal_1=0, var_1_10=32766, var_1_11=0, var_1_12=-32, var_1_13=32766, var_1_14=0, var_1_1=-256, var_1_6=0, var_1_7=-256, var_1_8=-255, var_1_9=32766] [L109] RET step() [L110] CALL, EXPR property() [L100-L101] return (((((((((var_1_2 + var_1_3)) < ((var_1_4 - var_1_5))) ? ((var_1_2 + var_1_3)) : ((var_1_4 - var_1_5)))) != 31.9) ? (var_1_6 ? (var_1_1 == ((unsigned char) var_1_7)) : (var_1_1 == ((unsigned char) var_1_8))) : (var_1_1 == ((unsigned char) var_1_7))) && ((var_1_2 > var_1_5) ? (var_1_9 == ((signed short int) (var_1_10 - var_1_11))) : 1)) && ((var_1_1 && var_1_8) ? (var_1_12 == ((signed short int) (var_1_11 - 1))) : 1)) && ((var_1_11 <= var_1_9) ? (var_1_13 == ((signed long int) (var_1_10 - var_1_11))) : ((last_1_var_1_13 > (var_1_11 - var_1_14)) ? (var_1_13 == ((signed long int) last_1_var_1_13)) : (var_1_13 == ((signed long int) last_1_var_1_13)))) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=32, var_1_10=32766, var_1_11=0, var_1_12=-32, var_1_13=32766, var_1_14=0, var_1_1=-256, var_1_6=0, var_1_7=-256, var_1_8=-255, var_1_9=32766] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=32, var_1_10=32766, var_1_11=0, var_1_12=-32, var_1_13=32766, var_1_14=0, var_1_1=-256, var_1_6=0, var_1_7=-256, var_1_8=-255, var_1_9=32766] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 3, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 155 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 145 mSDsluCounter, 388 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 255 mSDsCounter, 75 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 544 IncrementalHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 75 mSolverCounterUnsat, 133 mSDtfsCounter, 544 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 303 GetRequests, 273 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=2, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 57 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 404 NumberOfCodeBlocks, 404 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 400 ConstructedInterpolants, 0 QuantifiedInterpolants, 1296 SizeOfPredicates, 5 NumberOfNonLiveVariables, 238 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 1833/1920 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:36:27,827 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_amount25_file-50.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 fb6084b1d47e624872609ebdc1d7596105f0fe52752c1031b16d65d48dd2a5c7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:36:29,738 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:36:29,802 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:36:29,807 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:36:29,809 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:36:29,834 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:36:29,837 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:36:29,837 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:36:29,837 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:36:29,838 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:36:29,838 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:36:29,838 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:36:29,838 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:36:29,839 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:36:29,839 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:36:29,839 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:36:29,839 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:36:29,839 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:36:29,840 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:36:29,840 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:36:29,842 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:36:29,843 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:36:29,843 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:36:29,843 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 12:36:29,843 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 12:36:29,844 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:36:29,844 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 12:36:29,844 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:36:29,844 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:36:29,844 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:36:29,847 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:36:29,847 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:36:29,847 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:36:29,847 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:36:29,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:36:29,847 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:36:29,848 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:36:29,848 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:36:29,848 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 12:36:29,848 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 12:36:29,848 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:36:29,849 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:36:29,849 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:36:29,849 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:36:29,849 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 12:36:29,849 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 -> fb6084b1d47e624872609ebdc1d7596105f0fe52752c1031b16d65d48dd2a5c7 [2024-10-11 12:36:30,128 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:36:30,165 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:36:30,167 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:36:30,168 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:36:30,169 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:36:30,171 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-50.i [2024-10-11 12:36:31,498 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:36:31,686 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:36:31,687 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-50.i [2024-10-11 12:36:31,698 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fa7a2e952/8e76d828062246a2951c48404a5e3552/FLAGdeeb45080 [2024-10-11 12:36:31,709 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fa7a2e952/8e76d828062246a2951c48404a5e3552 [2024-10-11 12:36:31,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:36:31,713 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:36:31,714 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:36:31,719 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:36:31,724 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:36:31,725 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:36:31" (1/1) ... [2024-10-11 12:36:31,726 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d7e1c8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:31, skipping insertion in model container [2024-10-11 12:36:31,726 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:36:31" (1/1) ... [2024-10-11 12:36:31,746 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:36:31,902 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_amount25_file-50.i[915,928] [2024-10-11 12:36:31,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:36:31,967 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:36:31,980 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_amount25_file-50.i[915,928] [2024-10-11 12:36:32,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:36:32,024 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:36:32,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:32 WrapperNode [2024-10-11 12:36:32,025 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:36:32,026 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:36:32,026 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:36:32,026 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:36:32,031 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:36:32" (1/1) ... [2024-10-11 12:36:32,046 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:36:32" (1/1) ... [2024-10-11 12:36:32,070 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2024-10-11 12:36:32,074 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:36:32,075 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:36:32,075 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:36:32,075 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:36:32,084 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:32" (1/1) ... [2024-10-11 12:36:32,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:32" (1/1) ... [2024-10-11 12:36:32,092 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:32" (1/1) ... [2024-10-11 12:36:32,108 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:36:32,109 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:32" (1/1) ... [2024-10-11 12:36:32,112 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:32" (1/1) ... [2024-10-11 12:36:32,117 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:32" (1/1) ... [2024-10-11 12:36:32,123 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:32" (1/1) ... [2024-10-11 12:36:32,127 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:32" (1/1) ... [2024-10-11 12:36:32,131 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:32" (1/1) ... [2024-10-11 12:36:32,134 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:36:32,137 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:36:32,137 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:36:32,137 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:36:32,138 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:32" (1/1) ... [2024-10-11 12:36:32,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:36:32,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:36:32,171 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:36:32,177 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:36:32,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:36:32,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 12:36:32,212 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:36:32,212 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:36:32,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:36:32,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:36:32,274 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:36:32,276 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:36:34,987 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-11 12:36:34,987 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:36:35,026 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:36:35,027 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:36:35,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:36:35 BoogieIcfgContainer [2024-10-11 12:36:35,027 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:36:35,029 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:36:35,029 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:36:35,032 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:36:35,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:36:31" (1/3) ... [2024-10-11 12:36:35,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31e92605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:36:35, skipping insertion in model container [2024-10-11 12:36:35,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:36:32" (2/3) ... [2024-10-11 12:36:35,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31e92605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:36:35, skipping insertion in model container [2024-10-11 12:36:35,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:36:35" (3/3) ... [2024-10-11 12:36:35,035 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-50.i [2024-10-11 12:36:35,048 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:36:35,048 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:36:35,106 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:36:35,114 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;@2b82415e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:36:35,116 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:36:35,120 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 12:36:35,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 12:36:35,130 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:36:35,131 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:35,131 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:36:35,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:36:35,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1695088588, now seen corresponding path program 1 times [2024-10-11 12:36:35,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:36:35,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1995089964] [2024-10-11 12:36:35,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:36:35,149 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:36:35,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:36:35,153 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:36:35,154 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:36:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:35,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 12:36:35,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:36:35,427 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-10-11 12:36:35,427 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:36:35,428 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:36:35,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1995089964] [2024-10-11 12:36:35,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1995089964] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:36:35,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:36:35,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:36:35,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63874509] [2024-10-11 12:36:35,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:36:35,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:36:35,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:36:35,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:36:35,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:36:35,452 INFO L87 Difference]: Start difference. First operand has 47 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 12:36:36,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:36:36,144 INFO L93 Difference]: Finished difference Result 91 states and 156 transitions. [2024-10-11 12:36:36,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:36:36,159 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 101 [2024-10-11 12:36:36,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:36:36,164 INFO L225 Difference]: With dead ends: 91 [2024-10-11 12:36:36,164 INFO L226 Difference]: Without dead ends: 45 [2024-10-11 12:36:36,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 100 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:36:36,169 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 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.7s IncrementalHoareTripleChecker+Time [2024-10-11 12:36:36,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 12:36:36,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-11 12:36:36,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-11 12:36:36,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 12:36:36,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 66 transitions. [2024-10-11 12:36:36,199 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 66 transitions. Word has length 101 [2024-10-11 12:36:36,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:36:36,199 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 66 transitions. [2024-10-11 12:36:36,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 12:36:36,200 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 66 transitions. [2024-10-11 12:36:36,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 12:36:36,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:36:36,203 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:36,211 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:36:36,407 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:36:36,408 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:36:36,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:36:36,409 INFO L85 PathProgramCache]: Analyzing trace with hash 810500308, now seen corresponding path program 1 times [2024-10-11 12:36:36,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:36:36,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [848454311] [2024-10-11 12:36:36,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:36:36,411 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:36:36,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:36:36,414 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:36:36,416 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:36:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:36,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 12:36:36,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:36:36,907 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 253 proven. 24 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2024-10-11 12:36:36,908 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 12:36:37,185 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 21 proven. 24 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-10-11 12:36:37,185 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:36:37,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [848454311] [2024-10-11 12:36:37,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [848454311] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 12:36:37,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 12:36:37,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-10-11 12:36:37,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023622399] [2024-10-11 12:36:37,186 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 12:36:37,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 12:36:37,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:36:37,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 12:36:37,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 12:36:37,189 INFO L87 Difference]: Start difference. First operand 45 states and 66 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 12:36:39,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:36:40,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:36:40,014 INFO L93 Difference]: Finished difference Result 149 states and 210 transitions. [2024-10-11 12:36:40,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 12:36:40,015 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 101 [2024-10-11 12:36:40,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:36:40,018 INFO L225 Difference]: With dead ends: 149 [2024-10-11 12:36:40,018 INFO L226 Difference]: Without dead ends: 105 [2024-10-11 12:36:40,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-10-11 12:36:40,022 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 119 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 12:36:40,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 190 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 12:36:40,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-11 12:36:40,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 52. [2024-10-11 12:36:40,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 12:36:40,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 73 transitions. [2024-10-11 12:36:40,047 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 73 transitions. Word has length 101 [2024-10-11 12:36:40,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:36:40,047 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 73 transitions. [2024-10-11 12:36:40,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 12:36:40,048 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 73 transitions. [2024-10-11 12:36:40,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 12:36:40,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:36:40,051 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:40,060 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 (3)] Ended with exit code 0 [2024-10-11 12:36:40,251 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:36:40,252 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:36:40,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:36:40,255 INFO L85 PathProgramCache]: Analyzing trace with hash 867758610, now seen corresponding path program 1 times [2024-10-11 12:36:40,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:36:40,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [684933305] [2024-10-11 12:36:40,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:36:40,255 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:36:40,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:36:40,258 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:36:40,263 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:36:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:36:40,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 12:36:40,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:37:05,628 WARN L286 SmtUtils]: Spent 7.96s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-11 12:37:49,301 WARN L286 SmtUtils]: Spent 10.99s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)