./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/gcd_2+newton_3_8.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/gcd_2+newton_3_8.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 8f745b16f6c25c5a9ff69a5e07a8fa4db5c31a6fdae6ec4e6a2aab4d04fe5214 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 16:47:47,660 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:47:47,747 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 16:47:47,752 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:47:47,753 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:47:47,786 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:47:47,787 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:47:47,787 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:47:47,788 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:47:47,788 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:47:47,790 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:47:47,790 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:47:47,791 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:47:47,794 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:47:47,794 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:47:47,795 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:47:47,795 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:47:47,795 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:47:47,795 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 16:47:47,796 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:47:47,796 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:47:47,797 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:47:47,798 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:47:47,798 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:47:47,798 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:47:47,798 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:47:47,799 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:47:47,799 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:47:47,799 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:47:47,799 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:47:47,800 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:47:47,800 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:47:47,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:47:47,801 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:47:47,801 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:47:47,801 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:47:47,802 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 16:47:47,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 16:47:47,802 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:47:47,803 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:47:47,803 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:47:47,804 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:47:47,804 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 -> 8f745b16f6c25c5a9ff69a5e07a8fa4db5c31a6fdae6ec4e6a2aab4d04fe5214 [2024-11-08 16:47:48,060 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:47:48,088 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:47:48,091 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:47:48,093 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:47:48,093 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:47:48,094 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_2+newton_3_8.i [2024-11-08 16:47:49,576 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:47:49,765 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:47:49,765 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_3_8.i [2024-11-08 16:47:49,772 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/549c2e347/924fb0f9ad5a45d4b59515682ce9add2/FLAGd56506abe [2024-11-08 16:47:49,785 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/549c2e347/924fb0f9ad5a45d4b59515682ce9add2 [2024-11-08 16:47:49,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:47:49,789 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:47:49,792 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:47:49,792 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:47:49,800 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:47:49,801 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:47:49" (1/1) ... [2024-11-08 16:47:49,802 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca7e276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:49, skipping insertion in model container [2024-11-08 16:47:49,802 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:47:49" (1/1) ... [2024-11-08 16:47:49,830 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:47:49,993 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/combinations/gcd_2+newton_3_8.i[1226,1239] [2024-11-08 16:47:50,026 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/combinations/gcd_2+newton_3_8.i[2862,2875] [2024-11-08 16:47:50,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:47:50,037 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:47:50,047 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/combinations/gcd_2+newton_3_8.i[1226,1239] [2024-11-08 16:47:50,056 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/combinations/gcd_2+newton_3_8.i[2862,2875] [2024-11-08 16:47:50,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:47:50,074 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:47:50,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:50 WrapperNode [2024-11-08 16:47:50,075 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:47:50,076 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:47:50,076 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:47:50,077 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:47:50,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:50" (1/1) ... [2024-11-08 16:47:50,097 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:50" (1/1) ... [2024-11-08 16:47:50,120 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 91 [2024-11-08 16:47:50,121 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:47:50,122 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:47:50,122 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:47:50,123 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:47:50,135 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:50" (1/1) ... [2024-11-08 16:47:50,136 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:50" (1/1) ... [2024-11-08 16:47:50,138 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:50" (1/1) ... [2024-11-08 16:47:50,150 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-08 16:47:50,150 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:50" (1/1) ... [2024-11-08 16:47:50,150 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:50" (1/1) ... [2024-11-08 16:47:50,155 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:50" (1/1) ... [2024-11-08 16:47:50,158 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:50" (1/1) ... [2024-11-08 16:47:50,159 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:50" (1/1) ... [2024-11-08 16:47:50,160 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:50" (1/1) ... [2024-11-08 16:47:50,162 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:47:50,163 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:47:50,163 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:47:50,163 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:47:50,164 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:50" (1/1) ... [2024-11-08 16:47:50,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:47:50,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 16:47:50,202 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-08 16:47:50,205 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-08 16:47:50,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:47:50,255 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-11-08 16:47:50,255 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-11-08 16:47:50,255 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-08 16:47:50,255 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-08 16:47:50,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 16:47:50,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 16:47:50,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:47:50,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:47:50,340 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:47:50,343 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:47:50,557 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2024-11-08 16:47:50,558 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:47:50,569 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:47:50,569 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:47:50,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:47:50 BoogieIcfgContainer [2024-11-08 16:47:50,570 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:47:50,572 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:47:50,572 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:47:50,576 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:47:50,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:47:49" (1/3) ... [2024-11-08 16:47:50,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16f6a7b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:47:50, skipping insertion in model container [2024-11-08 16:47:50,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:50" (2/3) ... [2024-11-08 16:47:50,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16f6a7b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:47:50, skipping insertion in model container [2024-11-08 16:47:50,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:47:50" (3/3) ... [2024-11-08 16:47:50,578 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_3_8.i [2024-11-08 16:47:50,595 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:47:50,595 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-08 16:47:50,650 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:47:50,656 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;@3d2b1d3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:47:50,657 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-08 16:47:50,660 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 16:47:50,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 16:47:50,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:47:50,683 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:47:50,683 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:47:50,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:47:50,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1709385323, now seen corresponding path program 1 times [2024-11-08 16:47:50,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:47:50,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013279468] [2024-11-08 16:47:50,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:47:50,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:47:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:47:51,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:47:51,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:47:51,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013279468] [2024-11-08 16:47:51,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013279468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:47:51,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:47:51,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:47:51,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831070592] [2024-11-08 16:47:51,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:47:51,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:47:51,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:47:51,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:47:51,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:47:51,045 INFO L87 Difference]: Start difference. First operand has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-08 16:47:51,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:47:51,122 INFO L93 Difference]: Finished difference Result 78 states and 101 transitions. [2024-11-08 16:47:51,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:47:51,125 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) Word has length 11 [2024-11-08 16:47:51,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:47:51,131 INFO L225 Difference]: With dead ends: 78 [2024-11-08 16:47:51,132 INFO L226 Difference]: Without dead ends: 33 [2024-11-08 16:47:51,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:47:51,139 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 3 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:47:51,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 122 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:47:51,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-08 16:47:51,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2024-11-08 16:47:51,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 16:47:51,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2024-11-08 16:47:51,188 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 11 [2024-11-08 16:47:51,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:47:51,189 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2024-11-08 16:47:51,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-08 16:47:51,190 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2024-11-08 16:47:51,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 16:47:51,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:47:51,192 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:47:51,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 16:47:51,193 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:47:51,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:47:51,194 INFO L85 PathProgramCache]: Analyzing trace with hash 65622039, now seen corresponding path program 1 times [2024-11-08 16:47:51,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:47:51,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159618043] [2024-11-08 16:47:51,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:47:51,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:47:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:47:51,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:47:51,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:47:51,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159618043] [2024-11-08 16:47:51,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159618043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:47:51,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:47:51,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:47:51,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077399124] [2024-11-08 16:47:51,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:47:51,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:47:51,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:47:51,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:47:51,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:47:51,327 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-08 16:47:51,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:47:51,351 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2024-11-08 16:47:51,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:47:51,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) Word has length 11 [2024-11-08 16:47:51,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:47:51,354 INFO L225 Difference]: With dead ends: 39 [2024-11-08 16:47:51,355 INFO L226 Difference]: Without dead ends: 33 [2024-11-08 16:47:51,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:47:51,357 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:47:51,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 96 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:47:51,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-08 16:47:51,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-08 16:47:51,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 16:47:51,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2024-11-08 16:47:51,367 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 11 [2024-11-08 16:47:51,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:47:51,368 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2024-11-08 16:47:51,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-08 16:47:51,368 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2024-11-08 16:47:51,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 16:47:51,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:47:51,370 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:47:51,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 16:47:51,370 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:47:51,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:47:51,371 INFO L85 PathProgramCache]: Analyzing trace with hash -659390950, now seen corresponding path program 1 times [2024-11-08 16:47:51,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:47:51,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894579161] [2024-11-08 16:47:51,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:47:51,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:47:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:47:51,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:47:51,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:47:51,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894579161] [2024-11-08 16:47:51,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894579161] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:47:51,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888592526] [2024-11-08 16:47:51,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:47:51,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:47:51,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 16:47:51,602 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-08 16:47:51,606 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-08 16:47:51,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:47:51,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 16:47:51,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:47:51,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:47:51,805 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:47:51,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:47:51,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888592526] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:47:51,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:47:51,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-11-08 16:47:51,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406864964] [2024-11-08 16:47:51,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:47:51,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 16:47:51,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:47:51,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 16:47:51,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:47:51,910 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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-08 16:47:51,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:47:51,980 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2024-11-08 16:47:51,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:47:51,981 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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) Word has length 12 [2024-11-08 16:47:51,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:47:51,982 INFO L225 Difference]: With dead ends: 40 [2024-11-08 16:47:51,982 INFO L226 Difference]: Without dead ends: 34 [2024-11-08 16:47:51,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:47:51,983 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 2 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:47:51,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 182 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:47:51,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-08 16:47:51,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-08 16:47:51,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 16:47:51,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2024-11-08 16:47:51,992 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 12 [2024-11-08 16:47:51,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:47:51,992 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2024-11-08 16:47:51,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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-08 16:47:51,993 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2024-11-08 16:47:51,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 16:47:51,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:47:51,995 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:47:52,014 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-08 16:47:52,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:47:52,200 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:47:52,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:47:52,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1659957129, now seen corresponding path program 2 times [2024-11-08 16:47:52,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:47:52,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855833943] [2024-11-08 16:47:52,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:47:52,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:47:52,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:47:52,633 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:47:52,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:47:52,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855833943] [2024-11-08 16:47:52,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855833943] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:47:52,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303082855] [2024-11-08 16:47:52,634 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 16:47:52,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:47:52,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 16:47:52,640 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:47:52,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 16:47:52,719 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 16:47:52,719 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 16:47:52,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-08 16:47:52,723 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:48:39,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:48:39,594 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:48:58,675 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-08 16:48:58,676 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-08 16:48:58,675 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 101 [2024-11-08 16:48:58,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 16:48:58,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-08 16:48:58,878 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:912) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:553) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:324) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 46 more [2024-11-08 16:48:58,881 INFO L158 Benchmark]: Toolchain (without parser) took 69092.75ms. Allocated memory was 157.3MB in the beginning and 228.6MB in the end (delta: 71.3MB). Free memory was 102.0MB in the beginning and 75.8MB in the end (delta: 26.2MB). Peak memory consumption was 99.6MB. Max. memory is 16.1GB. [2024-11-08 16:48:58,882 INFO L158 Benchmark]: CDTParser took 0.64ms. Allocated memory is still 157.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:48:58,882 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.95ms. Allocated memory is still 157.3MB. Free memory was 101.6MB in the beginning and 88.1MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 16:48:58,882 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.02ms. Allocated memory is still 157.3MB. Free memory was 88.1MB in the beginning and 86.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 16:48:58,884 INFO L158 Benchmark]: Boogie Preprocessor took 40.46ms. Allocated memory is still 157.3MB. Free memory was 86.1MB in the beginning and 84.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 16:48:58,884 INFO L158 Benchmark]: RCFGBuilder took 406.70ms. Allocated memory is still 157.3MB. Free memory was 84.0MB in the beginning and 69.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 16:48:58,884 INFO L158 Benchmark]: TraceAbstraction took 68308.87ms. Allocated memory was 157.3MB in the beginning and 228.6MB in the end (delta: 71.3MB). Free memory was 68.9MB in the beginning and 75.8MB in the end (delta: -6.9MB). Peak memory consumption was 66.1MB. Max. memory is 16.1GB. [2024-11-08 16:48:58,885 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.64ms. Allocated memory is still 157.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 283.95ms. Allocated memory is still 157.3MB. Free memory was 101.6MB in the beginning and 88.1MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.02ms. Allocated memory is still 157.3MB. Free memory was 88.1MB in the beginning and 86.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.46ms. Allocated memory is still 157.3MB. Free memory was 86.1MB in the beginning and 84.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 406.70ms. Allocated memory is still 157.3MB. Free memory was 84.0MB in the beginning and 69.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 68308.87ms. Allocated memory was 157.3MB in the beginning and 228.6MB in the end (delta: 71.3MB). Free memory was 68.9MB in the beginning and 75.8MB in the end (delta: -6.9MB). Peak memory consumption was 66.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/gcd_2+newton_3_8.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 8f745b16f6c25c5a9ff69a5e07a8fa4db5c31a6fdae6ec4e6a2aab4d04fe5214 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 16:49:00,749 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:49:00,837 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 16:49:00,844 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:49:00,844 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:49:00,879 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:49:00,880 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:49:00,882 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:49:00,883 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:49:00,883 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:49:00,884 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:49:00,884 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:49:00,885 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:49:00,886 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:49:00,887 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:49:00,888 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:49:00,888 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:49:00,888 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:49:00,889 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:49:00,892 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:49:00,893 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:49:00,893 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:49:00,893 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:49:00,893 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 16:49:00,894 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 16:49:00,894 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:49:00,894 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 16:49:00,894 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:49:00,895 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:49:00,895 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:49:00,895 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:49:00,895 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:49:00,896 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:49:00,896 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:49:00,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:49:00,899 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:49:00,899 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:49:00,899 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:49:00,900 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 16:49:00,900 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 16:49:00,900 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:49:00,901 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:49:00,901 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:49:00,902 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:49:00,902 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 -> 8f745b16f6c25c5a9ff69a5e07a8fa4db5c31a6fdae6ec4e6a2aab4d04fe5214 [2024-11-08 16:49:01,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:49:01,275 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:49:01,279 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:49:01,280 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:49:01,280 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:49:01,282 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_2+newton_3_8.i [2024-11-08 16:49:02,747 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:49:02,929 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:49:02,929 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_3_8.i [2024-11-08 16:49:02,939 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddb8493d7/59bd2ee4687e48c9b7b2782f4315fd0b/FLAGeb84ee956 [2024-11-08 16:49:02,953 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddb8493d7/59bd2ee4687e48c9b7b2782f4315fd0b [2024-11-08 16:49:02,956 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:49:02,958 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:49:02,961 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:49:02,962 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:49:02,967 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:49:02,968 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:49:02" (1/1) ... [2024-11-08 16:49:02,969 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f080e9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:02, skipping insertion in model container [2024-11-08 16:49:02,969 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:49:02" (1/1) ... [2024-11-08 16:49:02,997 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:49:03,189 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/combinations/gcd_2+newton_3_8.i[1226,1239] [2024-11-08 16:49:03,243 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/combinations/gcd_2+newton_3_8.i[2862,2875] [2024-11-08 16:49:03,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:49:03,262 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:49:03,275 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/combinations/gcd_2+newton_3_8.i[1226,1239] [2024-11-08 16:49:03,293 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/combinations/gcd_2+newton_3_8.i[2862,2875] [2024-11-08 16:49:03,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:49:03,324 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:49:03,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:03 WrapperNode [2024-11-08 16:49:03,325 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:49:03,327 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:49:03,327 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:49:03,327 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:49:03,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:03" (1/1) ... [2024-11-08 16:49:03,349 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:03" (1/1) ... [2024-11-08 16:49:03,371 INFO L138 Inliner]: procedures = 28, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 86 [2024-11-08 16:49:03,372 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:49:03,373 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:49:03,374 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:49:03,374 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:49:03,383 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:03" (1/1) ... [2024-11-08 16:49:03,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:03" (1/1) ... [2024-11-08 16:49:03,387 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:03" (1/1) ... [2024-11-08 16:49:03,401 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-08 16:49:03,405 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:03" (1/1) ... [2024-11-08 16:49:03,406 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:03" (1/1) ... [2024-11-08 16:49:03,415 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:03" (1/1) ... [2024-11-08 16:49:03,422 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:03" (1/1) ... [2024-11-08 16:49:03,426 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:03" (1/1) ... [2024-11-08 16:49:03,432 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:03" (1/1) ... [2024-11-08 16:49:03,439 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:49:03,439 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:49:03,440 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:49:03,440 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:49:03,440 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:03" (1/1) ... [2024-11-08 16:49:03,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:49:03,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 16:49:03,472 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-08 16:49:03,474 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-08 16:49:03,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:49:03,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 16:49:03,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 16:49:03,512 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-11-08 16:49:03,512 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-11-08 16:49:03,512 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-08 16:49:03,512 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-08 16:49:03,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:49:03,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:49:03,591 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:49:03,594 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:49:17,748 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-08 16:49:17,748 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:49:17,760 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:49:17,761 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:49:17,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:49:17 BoogieIcfgContainer [2024-11-08 16:49:17,761 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:49:17,763 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:49:17,763 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:49:17,765 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:49:17,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:49:02" (1/3) ... [2024-11-08 16:49:17,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d245f5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:49:17, skipping insertion in model container [2024-11-08 16:49:17,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:49:03" (2/3) ... [2024-11-08 16:49:17,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d245f5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:49:17, skipping insertion in model container [2024-11-08 16:49:17,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:49:17" (3/3) ... [2024-11-08 16:49:17,768 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_3_8.i [2024-11-08 16:49:17,782 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:49:17,783 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-08 16:49:17,857 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:49:17,875 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;@1da9f486, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:49:17,877 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-08 16:49:17,881 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 16:49:17,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 16:49:17,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:49:17,888 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:49:17,889 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:49:17,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:49:17,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1709385323, now seen corresponding path program 1 times [2024-11-08 16:49:17,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 16:49:17,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [733689778] [2024-11-08 16:49:17,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:49:17,908 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-08 16:49:17,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 16:49:17,912 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-08 16:49:17,913 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-08 16:49:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:17,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 16:49:17,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:49:18,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:49:18,204 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:49:18,204 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 16:49:18,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [733689778] [2024-11-08 16:49:18,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [733689778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:49:18,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:49:18,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:49:18,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81290516] [2024-11-08 16:49:18,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:49:18,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:49:18,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 16:49:18,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:49:18,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:49:18,239 INFO L87 Difference]: Start difference. First operand has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-08 16:49:18,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:49:18,376 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2024-11-08 16:49:18,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:49:18,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) Word has length 11 [2024-11-08 16:49:18,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:49:18,386 INFO L225 Difference]: With dead ends: 74 [2024-11-08 16:49:18,386 INFO L226 Difference]: Without dead ends: 33 [2024-11-08 16:49:18,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:49:18,394 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:49:18,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:49:18,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-08 16:49:18,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-08 16:49:18,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 16:49:18,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2024-11-08 16:49:18,435 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 11 [2024-11-08 16:49:18,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:49:18,435 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-11-08 16:49:18,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-08 16:49:18,436 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2024-11-08 16:49:18,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 16:49:18,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:49:18,438 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:49:18,444 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-08 16:49:18,642 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-08 16:49:18,643 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:49:18,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:49:18,644 INFO L85 PathProgramCache]: Analyzing trace with hash 65622039, now seen corresponding path program 1 times [2024-11-08 16:49:18,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 16:49:18,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [685033884] [2024-11-08 16:49:18,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:49:18,645 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-08 16:49:18,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 16:49:18,648 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-08 16:49:18,649 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-08 16:49:18,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:18,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 16:49:18,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:49:18,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:49:18,966 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:49:18,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 16:49:18,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [685033884] [2024-11-08 16:49:18,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [685033884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:49:18,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:49:18,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:49:18,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836133077] [2024-11-08 16:49:18,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:49:18,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:49:18,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 16:49:18,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:49:18,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:49:18,970 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-08 16:49:19,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:49:19,201 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2024-11-08 16:49:19,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:49:19,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) Word has length 11 [2024-11-08 16:49:19,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:49:19,203 INFO L225 Difference]: With dead ends: 40 [2024-11-08 16:49:19,203 INFO L226 Difference]: Without dead ends: 34 [2024-11-08 16:49:19,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:49:19,204 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:49:19,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 98 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 16:49:19,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-08 16:49:19,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2024-11-08 16:49:19,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 16:49:19,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2024-11-08 16:49:19,212 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 11 [2024-11-08 16:49:19,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:49:19,212 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-11-08 16:49:19,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-08 16:49:19,212 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2024-11-08 16:49:19,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 16:49:19,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:49:19,213 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:49:19,218 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-08 16:49:19,416 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-08 16:49:19,417 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:49:19,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:49:19,417 INFO L85 PathProgramCache]: Analyzing trace with hash 149955676, now seen corresponding path program 1 times [2024-11-08 16:49:19,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 16:49:19,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1961704525] [2024-11-08 16:49:19,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:49:19,419 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-08 16:49:19,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 16:49:19,422 INFO L229 MonitoredProcess]: Starting monitored process 4 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-08 16:49:19,423 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 (4)] Waiting until timeout for monitored process [2024-11-08 16:49:19,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:19,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 16:49:19,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:49:19,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 16:49:19,730 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:49:19,731 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 16:49:19,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1961704525] [2024-11-08 16:49:19,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1961704525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:49:19,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:49:19,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:49:19,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354013275] [2024-11-08 16:49:19,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:49:19,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:49:19,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 16:49:19,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:49:19,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:49:19,743 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-08 16:49:19,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:49:19,921 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2024-11-08 16:49:19,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:49:19,922 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) Word has length 12 [2024-11-08 16:49:19,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:49:19,923 INFO L225 Difference]: With dead ends: 41 [2024-11-08 16:49:19,923 INFO L226 Difference]: Without dead ends: 33 [2024-11-08 16:49:19,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:49:19,924 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:49:19,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 98 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 16:49:19,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-08 16:49:19,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-08 16:49:19,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 16:49:19,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2024-11-08 16:49:19,930 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 12 [2024-11-08 16:49:19,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:49:19,930 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2024-11-08 16:49:19,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-08 16:49:19,931 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2024-11-08 16:49:19,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 16:49:19,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:49:19,931 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:49:19,937 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 (4)] Ended with exit code 0 [2024-11-08 16:49:20,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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-08 16:49:20,133 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:49:20,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:49:20,134 INFO L85 PathProgramCache]: Analyzing trace with hash -659390950, now seen corresponding path program 1 times [2024-11-08 16:49:20,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 16:49:20,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [222817641] [2024-11-08 16:49:20,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:49:20,135 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-08 16:49:20,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 16:49:20,139 INFO L229 MonitoredProcess]: Starting monitored process 5 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-08 16:49:20,142 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 (5)] Waiting until timeout for monitored process [2024-11-08 16:49:20,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:49:20,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 16:49:20,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:49:21,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:49:21,366 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:49:22,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:49:22,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 16:49:22,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [222817641] [2024-11-08 16:49:22,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [222817641] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:49:22,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 16:49:22,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2024-11-08 16:49:22,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101760031] [2024-11-08 16:49:22,669 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 16:49:22,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 16:49:22,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 16:49:22,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 16:49:22,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-08 16:49:22,673 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 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-08 16:49:24,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:49:24,385 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2024-11-08 16:49:24,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 16:49:24,386 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 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) Word has length 12 [2024-11-08 16:49:24,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:49:24,387 INFO L225 Difference]: With dead ends: 37 [2024-11-08 16:49:24,387 INFO L226 Difference]: Without dead ends: 23 [2024-11-08 16:49:24,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-11-08 16:49:24,388 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 2 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:49:24,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 277 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 16:49:24,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-08 16:49:24,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-08 16:49:24,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.0) internal successors, (14), 14 states have internal predecessors, (14), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 16:49:24,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2024-11-08 16:49:24,392 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 12 [2024-11-08 16:49:24,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:49:24,393 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2024-11-08 16:49:24,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 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-08 16:49:24,393 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2024-11-08 16:49:24,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 16:49:24,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:49:24,395 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:49:24,400 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 (5)] Ended with exit code 0