./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-94.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-94.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash daecda5a34625d8e7f3f0a930a730363a7677d8fd3b8cd0943f5f6f1bfbdafff --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 11:36:45,564 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 11:36:45,628 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 11:36:45,632 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 11:36:45,634 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 11:36:45,658 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 11:36:45,660 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 11:36:45,660 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 11:36:45,661 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 11:36:45,661 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 11:36:45,662 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 11:36:45,662 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 11:36:45,663 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 11:36:45,663 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 11:36:45,664 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 11:36:45,665 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 11:36:45,665 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 11:36:45,665 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 11:36:45,665 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 11:36:45,665 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 11:36:45,666 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 11:36:45,666 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 11:36:45,666 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 11:36:45,669 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 11:36:45,669 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 11:36:45,669 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 11:36:45,670 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 11:36:45,670 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 11:36:45,670 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 11:36:45,670 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 11:36:45,670 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 11:36:45,670 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 11:36:45,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 11:36:45,671 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 11:36:45,671 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 11:36:45,671 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 11:36:45,671 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 11:36:45,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 11:36:45,671 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 11:36:45,671 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 11:36:45,671 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 11:36:45,672 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 11:36:45,673 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> daecda5a34625d8e7f3f0a930a730363a7677d8fd3b8cd0943f5f6f1bfbdafff [2024-11-22 11:36:45,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 11:36:45,916 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 11:36:45,919 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 11:36:45,920 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 11:36:45,920 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 11:36:45,921 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-94.i [2024-11-22 11:36:47,232 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 11:36:47,387 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 11:36:47,387 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-94.i [2024-11-22 11:36:47,393 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f924db04/899974decc5b4f34b08072349f2a2744/FLAG5b04701a7 [2024-11-22 11:36:47,406 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f924db04/899974decc5b4f34b08072349f2a2744 [2024-11-22 11:36:47,408 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 11:36:47,409 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 11:36:47,411 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 11:36:47,411 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 11:36:47,415 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 11:36:47,415 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:36:47" (1/1) ... [2024-11-22 11:36:47,417 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d0c32b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:47, skipping insertion in model container [2024-11-22 11:36:47,418 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:36:47" (1/1) ... [2024-11-22 11:36:47,434 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 11:36:47,570 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-94.i[915,928] [2024-11-22 11:36:47,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 11:36:47,607 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 11:36:47,617 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-94.i[915,928] [2024-11-22 11:36:47,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 11:36:47,643 INFO L204 MainTranslator]: Completed translation [2024-11-22 11:36:47,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:47 WrapperNode [2024-11-22 11:36:47,643 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 11:36:47,644 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 11:36:47,644 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 11:36:47,644 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 11:36:47,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:47" (1/1) ... [2024-11-22 11:36:47,655 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:47" (1/1) ... [2024-11-22 11:36:47,688 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 88 [2024-11-22 11:36:47,688 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 11:36:47,689 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 11:36:47,689 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 11:36:47,689 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 11:36:47,700 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:47" (1/1) ... [2024-11-22 11:36:47,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:47" (1/1) ... [2024-11-22 11:36:47,702 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:47" (1/1) ... [2024-11-22 11:36:47,715 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 11:36:47,716 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:47" (1/1) ... [2024-11-22 11:36:47,716 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:47" (1/1) ... [2024-11-22 11:36:47,722 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:47" (1/1) ... [2024-11-22 11:36:47,724 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:47" (1/1) ... [2024-11-22 11:36:47,725 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:47" (1/1) ... [2024-11-22 11:36:47,726 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:47" (1/1) ... [2024-11-22 11:36:47,731 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 11:36:47,732 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 11:36:47,732 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 11:36:47,732 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 11:36:47,733 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:47" (1/1) ... [2024-11-22 11:36:47,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 11:36:47,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 11:36:47,771 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 11:36:47,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 11:36:47,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 11:36:47,809 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 11:36:47,809 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 11:36:47,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 11:36:47,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 11:36:47,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 11:36:47,885 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 11:36:47,888 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 11:36:48,079 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-22 11:36:48,080 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 11:36:48,091 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 11:36:48,091 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 11:36:48,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:36:48 BoogieIcfgContainer [2024-11-22 11:36:48,092 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 11:36:48,094 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 11:36:48,094 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 11:36:48,096 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 11:36:48,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:36:47" (1/3) ... [2024-11-22 11:36:48,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43dcd960 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:36:48, skipping insertion in model container [2024-11-22 11:36:48,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:47" (2/3) ... [2024-11-22 11:36:48,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43dcd960 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:36:48, skipping insertion in model container [2024-11-22 11:36:48,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:36:48" (3/3) ... [2024-11-22 11:36:48,099 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-94.i [2024-11-22 11:36:48,113 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 11:36:48,113 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 11:36:48,163 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 11:36:48,172 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@51ea1000, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 11:36:48,172 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 11:36:48,179 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-22 11:36:48,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-22 11:36:48,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:36:48,191 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 11:36:48,192 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:36:48,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:36:48,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1636704476, now seen corresponding path program 1 times [2024-11-22 11:36:48,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 11:36:48,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412015788] [2024-11-22 11:36:48,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:36:48,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 11:36:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:36:48,382 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-11-22 11:36:48,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 11:36:48,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412015788] [2024-11-22 11:36:48,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412015788] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 11:36:48,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549508311] [2024-11-22 11:36:48,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:36:48,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 11:36:48,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 11:36:48,392 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 11:36:48,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 11:36:48,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:36:48,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 11:36:48,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 11:36:48,517 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-11-22 11:36:48,517 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 11:36:48,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549508311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 11:36:48,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 11:36:48,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 11:36:48,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511831203] [2024-11-22 11:36:48,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 11:36:48,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 11:36:48,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 11:36:48,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 11:36:48,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 11:36:48,544 INFO L87 Difference]: Start difference. First operand has 43 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-22 11:36:48,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 11:36:48,567 INFO L93 Difference]: Finished difference Result 79 states and 122 transitions. [2024-11-22 11:36:48,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 11:36:48,569 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 69 [2024-11-22 11:36:48,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 11:36:48,578 INFO L225 Difference]: With dead ends: 79 [2024-11-22 11:36:48,578 INFO L226 Difference]: Without dead ends: 39 [2024-11-22 11:36:48,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 11:36:48,587 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 11:36:48,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 11:36:48,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-22 11:36:48,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-22 11:36:48,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-22 11:36:48,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2024-11-22 11:36:48,668 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 69 [2024-11-22 11:36:48,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 11:36:48,669 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2024-11-22 11:36:48,669 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-22 11:36:48,669 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2024-11-22 11:36:48,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-22 11:36:48,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:36:48,675 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 11:36:48,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-22 11:36:48,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 11:36:48,876 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:36:48,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:36:48,877 INFO L85 PathProgramCache]: Analyzing trace with hash 953565284, now seen corresponding path program 1 times [2024-11-22 11:36:48,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 11:36:48,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905311535] [2024-11-22 11:36:48,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:36:48,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 11:36:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:36:49,494 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-22 11:36:49,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 11:36:49,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905311535] [2024-11-22 11:36:49,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905311535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 11:36:49,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 11:36:49,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 11:36:49,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519734096] [2024-11-22 11:36:49,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 11:36:49,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 11:36:49,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 11:36:49,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 11:36:49,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 11:36:49,497 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-22 11:36:49,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 11:36:49,585 INFO L93 Difference]: Finished difference Result 77 states and 103 transitions. [2024-11-22 11:36:49,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 11:36:49,588 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 69 [2024-11-22 11:36:49,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 11:36:49,589 INFO L225 Difference]: With dead ends: 77 [2024-11-22 11:36:49,589 INFO L226 Difference]: Without dead ends: 41 [2024-11-22 11:36:49,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 11:36:49,591 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 16 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 11:36:49,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 100 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 11:36:49,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-22 11:36:49,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2024-11-22 11:36:49,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-22 11:36:49,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2024-11-22 11:36:49,598 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 69 [2024-11-22 11:36:49,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 11:36:49,599 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2024-11-22 11:36:49,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-22 11:36:49,599 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2024-11-22 11:36:49,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-22 11:36:49,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:36:49,600 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 11:36:49,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 11:36:49,601 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:36:49,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:36:49,603 INFO L85 PathProgramCache]: Analyzing trace with hash 999746527, now seen corresponding path program 1 times [2024-11-22 11:36:49,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 11:36:49,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223805991] [2024-11-22 11:36:49,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:36:49,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 11:36:49,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:36:49,828 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-22 11:36:49,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 11:36:49,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223805991] [2024-11-22 11:36:49,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223805991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 11:36:49,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 11:36:49,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 11:36:49,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222249360] [2024-11-22 11:36:49,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 11:36:49,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 11:36:49,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 11:36:49,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 11:36:49,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 11:36:49,833 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-22 11:36:49,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 11:36:49,897 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2024-11-22 11:36:49,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 11:36:49,897 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 71 [2024-11-22 11:36:49,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 11:36:49,898 INFO L225 Difference]: With dead ends: 52 [2024-11-22 11:36:49,898 INFO L226 Difference]: Without dead ends: 50 [2024-11-22 11:36:49,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-22 11:36:49,899 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 8 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 11:36:49,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 232 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 11:36:49,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-22 11:36:49,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2024-11-22 11:36:49,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-22 11:36:49,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2024-11-22 11:36:49,905 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 71 [2024-11-22 11:36:49,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 11:36:49,905 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2024-11-22 11:36:49,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-22 11:36:49,906 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2024-11-22 11:36:49,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-22 11:36:49,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:36:49,907 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 11:36:49,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 11:36:49,907 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:36:49,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:36:49,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1679804897, now seen corresponding path program 1 times [2024-11-22 11:36:49,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 11:36:49,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724414228] [2024-11-22 11:36:49,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:36:49,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 11:36:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:36:50,144 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-22 11:36:50,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 11:36:50,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724414228] [2024-11-22 11:36:50,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724414228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 11:36:50,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 11:36:50,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 11:36:50,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034634125] [2024-11-22 11:36:50,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 11:36:50,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 11:36:50,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 11:36:50,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 11:36:50,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-22 11:36:50,149 INFO L87 Difference]: Start difference. First operand 47 states and 60 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-22 11:36:50,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 11:36:50,308 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2024-11-22 11:36:50,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 11:36:50,308 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 71 [2024-11-22 11:36:50,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 11:36:50,311 INFO L225 Difference]: With dead ends: 75 [2024-11-22 11:36:50,311 INFO L226 Difference]: Without dead ends: 73 [2024-11-22 11:36:50,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-22 11:36:50,312 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 23 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 11:36:50,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 385 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 11:36:50,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-22 11:36:50,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2024-11-22 11:36:50,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 56 states have internal predecessors, (63), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-22 11:36:50,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2024-11-22 11:36:50,326 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 71 [2024-11-22 11:36:50,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 11:36:50,328 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2024-11-22 11:36:50,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-22 11:36:50,328 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2024-11-22 11:36:50,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-22 11:36:50,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:36:50,330 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 11:36:50,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 11:36:50,331 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:36:50,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:36:50,331 INFO L85 PathProgramCache]: Analyzing trace with hash -2046630524, now seen corresponding path program 1 times [2024-11-22 11:36:50,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 11:36:50,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760174622] [2024-11-22 11:36:50,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:36:50,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 11:36:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:36:50,396 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-22 11:36:50,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 11:36:50,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760174622] [2024-11-22 11:36:50,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760174622] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 11:36:50,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 11:36:50,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 11:36:50,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840102001] [2024-11-22 11:36:50,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 11:36:50,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 11:36:50,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 11:36:50,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 11:36:50,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 11:36:50,402 INFO L87 Difference]: Start difference. First operand 70 states and 87 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-22 11:36:50,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 11:36:50,431 INFO L93 Difference]: Finished difference Result 155 states and 190 transitions. [2024-11-22 11:36:50,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 11:36:50,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 72 [2024-11-22 11:36:50,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 11:36:50,434 INFO L225 Difference]: With dead ends: 155 [2024-11-22 11:36:50,435 INFO L226 Difference]: Without dead ends: 88 [2024-11-22 11:36:50,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 11:36:50,438 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 18 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 11:36:50,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 96 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 11:36:50,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-22 11:36:50,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 69. [2024-11-22 11:36:50,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 55 states have internal predecessors, (61), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-22 11:36:50,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2024-11-22 11:36:50,452 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 72 [2024-11-22 11:36:50,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 11:36:50,452 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2024-11-22 11:36:50,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-22 11:36:50,453 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2024-11-22 11:36:50,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-22 11:36:50,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:36:50,455 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 11:36:50,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 11:36:50,455 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:36:50,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:36:50,457 INFO L85 PathProgramCache]: Analyzing trace with hash 946044516, now seen corresponding path program 1 times [2024-11-22 11:36:50,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 11:36:50,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57207106] [2024-11-22 11:36:50,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:36:50,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 11:36:50,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:36:50,518 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-22 11:36:50,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 11:36:50,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57207106] [2024-11-22 11:36:50,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57207106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 11:36:50,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 11:36:50,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 11:36:50,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549460401] [2024-11-22 11:36:50,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 11:36:50,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 11:36:50,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 11:36:50,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 11:36:50,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 11:36:50,521 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-22 11:36:50,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 11:36:50,544 INFO L93 Difference]: Finished difference Result 136 states and 166 transitions. [2024-11-22 11:36:50,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 11:36:50,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 72 [2024-11-22 11:36:50,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 11:36:50,545 INFO L225 Difference]: With dead ends: 136 [2024-11-22 11:36:50,545 INFO L226 Difference]: Without dead ends: 70 [2024-11-22 11:36:50,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 11:36:50,546 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 21 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 11:36:50,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 90 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 11:36:50,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-22 11:36:50,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 56. [2024-11-22 11:36:50,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 states have internal predecessors, (47), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-22 11:36:50,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2024-11-22 11:36:50,552 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 72 [2024-11-22 11:36:50,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 11:36:50,552 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2024-11-22 11:36:50,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-22 11:36:50,553 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2024-11-22 11:36:50,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-22 11:36:50,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:36:50,553 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 11:36:50,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 11:36:50,554 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:36:50,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:36:50,554 INFO L85 PathProgramCache]: Analyzing trace with hash 976601441, now seen corresponding path program 1 times [2024-11-22 11:36:50,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 11:36:50,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396329414] [2024-11-22 11:36:50,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:36:50,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 11:36:50,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 11:36:50,578 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 11:36:50,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 11:36:50,615 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 11:36:50,615 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 11:36:50,616 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 11:36:50,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 11:36:50,619 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-22 11:36:50,660 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 11:36:50,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 11:36:50 BoogieIcfgContainer [2024-11-22 11:36:50,662 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 11:36:50,663 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 11:36:50,663 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 11:36:50,663 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 11:36:50,663 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:36:48" (3/4) ... [2024-11-22 11:36:50,667 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 11:36:50,668 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 11:36:50,668 INFO L158 Benchmark]: Toolchain (without parser) took 3259.35ms. Allocated memory was 142.6MB in the beginning and 257.9MB in the end (delta: 115.3MB). Free memory was 71.6MB in the beginning and 146.2MB in the end (delta: -74.6MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2024-11-22 11:36:50,668 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 104.7MB in the end (delta: 243.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 11:36:50,669 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.38ms. Allocated memory is still 142.6MB. Free memory was 71.4MB in the beginning and 58.1MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-22 11:36:50,669 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.27ms. Allocated memory is still 142.6MB. Free memory was 58.1MB in the beginning and 55.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 11:36:50,669 INFO L158 Benchmark]: Boogie Preprocessor took 42.79ms. Allocated memory is still 142.6MB. Free memory was 55.8MB in the beginning and 53.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 11:36:50,671 INFO L158 Benchmark]: RCFGBuilder took 359.79ms. Allocated memory was 142.6MB in the beginning and 205.5MB in the end (delta: 62.9MB). Free memory was 53.2MB in the beginning and 164.5MB in the end (delta: -111.3MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. [2024-11-22 11:36:50,671 INFO L158 Benchmark]: TraceAbstraction took 2568.75ms. Allocated memory was 205.5MB in the beginning and 257.9MB in the end (delta: 52.4MB). Free memory was 163.4MB in the beginning and 146.2MB in the end (delta: 17.2MB). Peak memory consumption was 68.6MB. Max. memory is 16.1GB. [2024-11-22 11:36:50,671 INFO L158 Benchmark]: Witness Printer took 4.88ms. Allocated memory is still 257.9MB. Free memory is still 146.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 11:36:50,672 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.15ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 104.7MB in the end (delta: 243.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.38ms. Allocated memory is still 142.6MB. Free memory was 71.4MB in the beginning and 58.1MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.27ms. Allocated memory is still 142.6MB. Free memory was 58.1MB in the beginning and 55.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.79ms. Allocated memory is still 142.6MB. Free memory was 55.8MB in the beginning and 53.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 359.79ms. Allocated memory was 142.6MB in the beginning and 205.5MB in the end (delta: 62.9MB). Free memory was 53.2MB in the beginning and 164.5MB in the end (delta: -111.3MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2568.75ms. Allocated memory was 205.5MB in the beginning and 257.9MB in the end (delta: 52.4MB). Free memory was 163.4MB in the beginning and 146.2MB in the end (delta: 17.2MB). Peak memory consumption was 68.6MB. Max. memory is 16.1GB. * Witness Printer took 4.88ms. Allocated memory is still 257.9MB. Free memory is still 146.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftRight at line 58. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 2; [L23] unsigned short int var_1_2 = 45931; [L24] unsigned short int var_1_3 = 30067; [L25] unsigned short int var_1_4 = 256; [L26] unsigned short int var_1_5 = 10000; [L27] unsigned short int var_1_6 = 5; [L28] signed long int var_1_7 = -5; VAL [isInitial=0, var_1_1=2, var_1_2=45931, var_1_3=30067, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L62] isInitial = 1 [L63] FCALL initially() [L64] COND TRUE 1 [L65] FCALL updateLastVariables() [L66] CALL updateVariables() [L39] var_1_2 = __VERIFIER_nondet_ushort() [L40] CALL assume_abort_if_not(var_1_2 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=30067, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=30067, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L40] RET assume_abort_if_not(var_1_2 >= 32767) VAL [isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=30067, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L41] CALL assume_abort_if_not(var_1_2 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=30067, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=30067, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L41] RET assume_abort_if_not(var_1_2 <= 65534) VAL [isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=30067, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L42] var_1_3 = __VERIFIER_nondet_ushort() [L43] CALL assume_abort_if_not(var_1_3 >= 24575) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L43] RET assume_abort_if_not(var_1_3 >= 24575) VAL [isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L44] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L44] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L45] var_1_4 = __VERIFIER_nondet_ushort() [L46] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_5=10000, var_1_6=5, var_1_7=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_5=10000, var_1_6=5, var_1_7=-5] [L46] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_5=10000, var_1_6=5, var_1_7=-5] [L47] CALL assume_abort_if_not(var_1_4 <= 8192) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_4=0, var_1_5=10000, var_1_6=5, var_1_7=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_4=0, var_1_5=10000, var_1_6=5, var_1_7=-5] [L47] RET assume_abort_if_not(var_1_4 <= 8192) VAL [isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_4=0, var_1_5=10000, var_1_6=5, var_1_7=-5] [L48] var_1_5 = __VERIFIER_nondet_ushort() [L49] CALL assume_abort_if_not(var_1_5 >= 8191) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_4=0, var_1_5=8191, var_1_6=5, var_1_7=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_4=0, var_1_5=8191, var_1_6=5, var_1_7=-5] [L49] RET assume_abort_if_not(var_1_5 >= 8191) VAL [isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_4=0, var_1_5=8191, var_1_6=5, var_1_7=-5] [L50] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_4=0, var_1_5=8191, var_1_6=5, var_1_7=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_4=0, var_1_5=8191, var_1_6=5, var_1_7=-5] [L50] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_4=0, var_1_5=8191, var_1_6=5, var_1_7=-5] [L51] var_1_6 = __VERIFIER_nondet_ushort() [L52] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_4=0, var_1_5=8191, var_1_7=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_4=0, var_1_5=8191, var_1_7=-5] [L52] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_4=0, var_1_5=8191, var_1_7=-5] [L53] CALL assume_abort_if_not(var_1_6 <= 8191) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_4=0, var_1_5=8191, var_1_6=0, var_1_7=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_4=0, var_1_5=8191, var_1_6=0, var_1_7=-5] [L53] RET assume_abort_if_not(var_1_6 <= 8191) VAL [isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_4=0, var_1_5=8191, var_1_6=0, var_1_7=-5] [L66] RET updateVariables() [L67] CALL step() [L32] var_1_1 = (var_1_2 - ((var_1_3 - var_1_4) - (var_1_5 - var_1_6))) VAL [isInitial=1, var_1_1=40958, var_1_2=-2147352578, var_1_3=32767, var_1_4=0, var_1_5=8191, var_1_6=0, var_1_7=-5] [L33] EXPR (var_1_3 + var_1_6) >> var_1_1 VAL [isInitial=1, var_1_1=40958, var_1_2=-2147352578, var_1_3=32767, var_1_4=0, var_1_5=8191, var_1_6=0, var_1_7=-5] [L33] signed long int stepLocal_0 = (var_1_3 + var_1_6) >> var_1_1; [L34] COND FALSE !(var_1_4 != stepLocal_0) VAL [isInitial=1, var_1_1=40958, var_1_2=-2147352578, var_1_3=32767, var_1_4=0, var_1_5=8191, var_1_6=0, var_1_7=-5] [L67] RET step() [L68] CALL, EXPR property() [L58] EXPR (var_1_1 == ((unsigned short int) (var_1_2 - ((var_1_3 - var_1_4) - (var_1_5 - var_1_6))))) && ((var_1_4 != ((var_1_3 + var_1_6) >> var_1_1)) ? (var_1_7 == ((signed long int) var_1_2)) : 1) VAL [isInitial=1, var_1_1=40958, var_1_2=-2147352578, var_1_3=32767, var_1_4=0, var_1_5=8191, var_1_6=0, var_1_7=-5] [L58] EXPR (var_1_3 + var_1_6) >> var_1_1 VAL [isInitial=1, var_1_1=40958, var_1_2=-2147352578, var_1_3=32767, var_1_4=0, var_1_5=8191, var_1_6=0, var_1_7=-5] [L58] EXPR (var_1_1 == ((unsigned short int) (var_1_2 - ((var_1_3 - var_1_4) - (var_1_5 - var_1_6))))) && ((var_1_4 != ((var_1_3 + var_1_6) >> var_1_1)) ? (var_1_7 == ((signed long int) var_1_2)) : 1) VAL [isInitial=1, var_1_1=40958, var_1_2=-2147352578, var_1_3=32767, var_1_4=0, var_1_5=8191, var_1_6=0, var_1_7=-5] [L58-L59] return (var_1_1 == ((unsigned short int) (var_1_2 - ((var_1_3 - var_1_4) - (var_1_5 - var_1_6))))) && ((var_1_4 != ((var_1_3 + var_1_6) >> var_1_1)) ? (var_1_7 == ((signed long int) var_1_2)) : 1) ; [L68] RET, EXPR property() [L68] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=40958, var_1_2=-2147352578, var_1_3=32767, var_1_4=0, var_1_5=8191, var_1_6=0, var_1_7=-5] [L19] reach_error() VAL [isInitial=1, var_1_1=40958, var_1_2=-2147352578, var_1_3=32767, var_1_4=0, var_1_5=8191, var_1_6=0, var_1_7=-5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 7, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 86 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 86 mSDsluCounter, 955 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 637 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 259 IncrementalHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 318 mSDtfsCounter, 259 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=4, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 41 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 566 NumberOfCodeBlocks, 566 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 486 ConstructedInterpolants, 0 QuantifiedInterpolants, 870 SizeOfPredicates, 0 NumberOfNonLiveVariables, 161 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 1242/1260 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-22 11:36:50,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-94.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash daecda5a34625d8e7f3f0a930a730363a7677d8fd3b8cd0943f5f6f1bfbdafff --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 11:36:52,555 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 11:36:52,622 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 11:36:52,627 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 11:36:52,627 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 11:36:52,652 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 11:36:52,654 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 11:36:52,654 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 11:36:52,654 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 11:36:52,655 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 11:36:52,656 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 11:36:52,656 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 11:36:52,657 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 11:36:52,657 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 11:36:52,657 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 11:36:52,660 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 11:36:52,660 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 11:36:52,660 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 11:36:52,660 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 11:36:52,660 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 11:36:52,661 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 11:36:52,661 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 11:36:52,661 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 11:36:52,661 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 11:36:52,661 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 11:36:52,662 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 11:36:52,662 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 11:36:52,662 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 11:36:52,662 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 11:36:52,662 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 11:36:52,662 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 11:36:52,662 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 11:36:52,663 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 11:36:52,663 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 11:36:52,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 11:36:52,663 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 11:36:52,663 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 11:36:52,663 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 11:36:52,663 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 11:36:52,664 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 11:36:52,664 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 11:36:52,667 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 11:36:52,668 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 11:36:52,668 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 11:36:52,668 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> daecda5a34625d8e7f3f0a930a730363a7677d8fd3b8cd0943f5f6f1bfbdafff [2024-11-22 11:36:52,923 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 11:36:52,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 11:36:52,939 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 11:36:52,940 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 11:36:52,940 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 11:36:52,941 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-94.i [2024-11-22 11:36:54,308 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 11:36:54,458 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 11:36:54,458 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-94.i [2024-11-22 11:36:54,463 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9abb95ed/aa0ec9d517104af5b6160269693ab256/FLAGf674ecc37 [2024-11-22 11:36:54,870 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9abb95ed/aa0ec9d517104af5b6160269693ab256 [2024-11-22 11:36:54,872 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 11:36:54,873 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 11:36:54,876 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 11:36:54,876 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 11:36:54,883 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 11:36:54,884 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:36:54" (1/1) ... [2024-11-22 11:36:54,885 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cfbf646 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:54, skipping insertion in model container [2024-11-22 11:36:54,885 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:36:54" (1/1) ... [2024-11-22 11:36:54,899 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 11:36:55,048 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-94.i[915,928] [2024-11-22 11:36:55,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 11:36:55,088 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 11:36:55,099 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-94.i[915,928] [2024-11-22 11:36:55,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 11:36:55,139 INFO L204 MainTranslator]: Completed translation [2024-11-22 11:36:55,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:55 WrapperNode [2024-11-22 11:36:55,139 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 11:36:55,140 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 11:36:55,140 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 11:36:55,140 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 11:36:55,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:55" (1/1) ... [2024-11-22 11:36:55,157 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:55" (1/1) ... [2024-11-22 11:36:55,176 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 70 [2024-11-22 11:36:55,177 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 11:36:55,177 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 11:36:55,178 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 11:36:55,178 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 11:36:55,186 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:55" (1/1) ... [2024-11-22 11:36:55,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:55" (1/1) ... [2024-11-22 11:36:55,189 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:55" (1/1) ... [2024-11-22 11:36:55,201 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 11:36:55,202 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:55" (1/1) ... [2024-11-22 11:36:55,202 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:55" (1/1) ... [2024-11-22 11:36:55,208 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:55" (1/1) ... [2024-11-22 11:36:55,210 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:55" (1/1) ... [2024-11-22 11:36:55,211 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:55" (1/1) ... [2024-11-22 11:36:55,212 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:55" (1/1) ... [2024-11-22 11:36:55,214 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 11:36:55,214 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 11:36:55,214 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 11:36:55,215 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 11:36:55,215 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:55" (1/1) ... [2024-11-22 11:36:55,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 11:36:55,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 11:36:55,239 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 11:36:55,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 11:36:55,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 11:36:55,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 11:36:55,279 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 11:36:55,279 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 11:36:55,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 11:36:55,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 11:36:55,342 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 11:36:55,345 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 11:36:55,499 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-22 11:36:55,500 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 11:36:55,510 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 11:36:55,512 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 11:36:55,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:36:55 BoogieIcfgContainer [2024-11-22 11:36:55,512 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 11:36:55,514 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 11:36:55,514 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 11:36:55,516 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 11:36:55,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:36:54" (1/3) ... [2024-11-22 11:36:55,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fed6599 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:36:55, skipping insertion in model container [2024-11-22 11:36:55,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:36:55" (2/3) ... [2024-11-22 11:36:55,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fed6599 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:36:55, skipping insertion in model container [2024-11-22 11:36:55,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:36:55" (3/3) ... [2024-11-22 11:36:55,519 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-94.i [2024-11-22 11:36:55,532 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 11:36:55,532 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 11:36:55,581 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 11:36:55,589 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;@3f79d79b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 11:36:55,589 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 11:36:55,597 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-22 11:36:55,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-22 11:36:55,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:36:55,605 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 11:36:55,605 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:36:55,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:36:55,609 INFO L85 PathProgramCache]: Analyzing trace with hash -927168940, now seen corresponding path program 1 times [2024-11-22 11:36:55,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 11:36:55,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [958477411] [2024-11-22 11:36:55,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:36:55,620 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 11:36:55,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 11:36:55,623 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 11:36:55,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-22 11:36:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:36:56,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-22 11:36:56,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 11:36:57,651 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 147 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 11:36:57,652 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 11:36:58,051 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-22 11:36:58,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 11:36:58,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [958477411] [2024-11-22 11:36:58,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [958477411] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 11:36:58,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 11:36:58,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [27] total 31 [2024-11-22 11:36:58,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141953007] [2024-11-22 11:36:58,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 11:36:58,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 11:36:58,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 11:36:58,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 11:36:58,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=746, Unknown=0, NotChecked=0, Total=930 [2024-11-22 11:36:58,078 INFO L87 Difference]: Start difference. First operand has 35 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-22 11:36:58,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 11:36:58,242 INFO L93 Difference]: Finished difference Result 69 states and 109 transitions. [2024-11-22 11:36:58,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 11:36:58,244 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 65 [2024-11-22 11:36:58,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 11:36:58,250 INFO L225 Difference]: With dead ends: 69 [2024-11-22 11:36:58,250 INFO L226 Difference]: Without dead ends: 37 [2024-11-22 11:36:58,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=194, Invalid=862, Unknown=0, NotChecked=0, Total=1056 [2024-11-22 11:36:58,256 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 10 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 11:36:58,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 133 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 11:36:58,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-22 11:36:58,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2024-11-22 11:36:58,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-22 11:36:58,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2024-11-22 11:36:58,288 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 65 [2024-11-22 11:36:58,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 11:36:58,289 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2024-11-22 11:36:58,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-22 11:36:58,289 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2024-11-22 11:36:58,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-22 11:36:58,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:36:58,292 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 11:36:58,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-22 11:36:58,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 11:36:58,493 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:36:58,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:36:58,494 INFO L85 PathProgramCache]: Analyzing trace with hash -925321898, now seen corresponding path program 1 times [2024-11-22 11:36:58,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 11:36:58,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [202729679] [2024-11-22 11:36:58,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:36:58,495 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 11:36:58,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 11:36:58,496 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 11:36:58,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-22 11:36:58,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:36:58,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-22 11:36:58,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 11:37:00,053 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 145 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-22 11:37:00,054 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 11:37:00,499 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-22 11:37:00,500 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 11:37:00,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [202729679] [2024-11-22 11:37:00,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [202729679] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 11:37:00,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 11:37:00,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [30] total 34 [2024-11-22 11:37:00,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452993340] [2024-11-22 11:37:00,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 11:37:00,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 11:37:00,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 11:37:00,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 11:37:00,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=895, Unknown=0, NotChecked=0, Total=1122 [2024-11-22 11:37:00,507 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-22 11:37:00,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 11:37:00,673 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2024-11-22 11:37:00,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 11:37:00,674 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 65 [2024-11-22 11:37:00,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 11:37:00,675 INFO L225 Difference]: With dead ends: 37 [2024-11-22 11:37:00,675 INFO L226 Difference]: Without dead ends: 0 [2024-11-22 11:37:00,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=237, Invalid=1023, Unknown=0, NotChecked=0, Total=1260 [2024-11-22 11:37:00,676 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 5 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 11:37:00,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 152 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 11:37:00,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-22 11:37:00,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-22 11:37:00,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 11:37:00,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-22 11:37:00,678 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2024-11-22 11:37:00,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 11:37:00,678 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-22 11:37:00,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-22 11:37:00,678 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-22 11:37:00,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-22 11:37:00,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 11:37:00,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-22 11:37:00,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 11:37:00,885 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-22 11:37:00,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-22 11:37:00,901 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 11:37:00,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 11:37:00 BoogieIcfgContainer [2024-11-22 11:37:00,913 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 11:37:00,914 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 11:37:00,914 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 11:37:00,914 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 11:37:00,914 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:36:55" (3/4) ... [2024-11-22 11:37:00,916 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-22 11:37:00,919 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-22 11:37:00,922 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-22 11:37:00,922 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-22 11:37:00,922 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-22 11:37:00,922 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-22 11:37:00,983 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 11:37:00,983 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-22 11:37:00,984 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 11:37:00,984 INFO L158 Benchmark]: Toolchain (without parser) took 6110.70ms. Allocated memory was 81.8MB in the beginning and 151.0MB in the end (delta: 69.2MB). Free memory was 49.3MB in the beginning and 115.5MB in the end (delta: -66.2MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. [2024-11-22 11:37:00,984 INFO L158 Benchmark]: CDTParser took 0.82ms. Allocated memory is still 81.8MB. Free memory is still 58.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 11:37:00,984 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.42ms. Allocated memory is still 81.8MB. Free memory was 49.1MB in the beginning and 60.9MB in the end (delta: -11.8MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. [2024-11-22 11:37:00,985 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.48ms. Allocated memory is still 81.8MB. Free memory was 60.9MB in the beginning and 59.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 11:37:00,985 INFO L158 Benchmark]: Boogie Preprocessor took 36.41ms. Allocated memory is still 81.8MB. Free memory was 59.1MB in the beginning and 57.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 11:37:00,985 INFO L158 Benchmark]: RCFGBuilder took 298.12ms. Allocated memory is still 81.8MB. Free memory was 56.7MB in the beginning and 44.5MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-22 11:37:00,985 INFO L158 Benchmark]: TraceAbstraction took 5399.69ms. Allocated memory was 81.8MB in the beginning and 151.0MB in the end (delta: 69.2MB). Free memory was 43.8MB in the beginning and 120.7MB in the end (delta: -76.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 11:37:00,985 INFO L158 Benchmark]: Witness Printer took 69.88ms. Allocated memory is still 151.0MB. Free memory was 120.7MB in the beginning and 115.5MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-22 11:37:00,986 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.82ms. Allocated memory is still 81.8MB. Free memory is still 58.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 263.42ms. Allocated memory is still 81.8MB. Free memory was 49.1MB in the beginning and 60.9MB in the end (delta: -11.8MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.48ms. Allocated memory is still 81.8MB. Free memory was 60.9MB in the beginning and 59.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.41ms. Allocated memory is still 81.8MB. Free memory was 59.1MB in the beginning and 57.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 298.12ms. Allocated memory is still 81.8MB. Free memory was 56.7MB in the beginning and 44.5MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5399.69ms. Allocated memory was 81.8MB in the beginning and 151.0MB in the end (delta: 69.2MB). Free memory was 43.8MB in the beginning and 120.7MB in the end (delta: -76.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 69.88ms. Allocated memory is still 151.0MB. Free memory was 120.7MB in the beginning and 115.5MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 2, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15 mSDsluCounter, 285 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 207 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 95 IncrementalHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 78 mSDtfsCounter, 95 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 260 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=0, InterpolantAutomatonStates: 12, 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, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 130 NumberOfCodeBlocks, 130 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 256 ConstructedInterpolants, 0 QuantifiedInterpolants, 2396 SizeOfPredicates, 15 NumberOfNonLiveVariables, 217 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 657/720 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) RESULT: Ultimate proved your program to be correct! [2024-11-22 11:37:01,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE