./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_2_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_2_2.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 edf451b08ccf28b9358a6fa7c10128ea1b9a8f09b01361f9cd588dc4a31f271a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 21:12:44,259 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 21:12:44,328 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 21:12:44,333 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 21:12:44,334 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 21:12:44,357 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 21:12:44,357 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 21:12:44,358 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 21:12:44,358 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 21:12:44,359 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 21:12:44,359 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 21:12:44,359 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 21:12:44,360 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 21:12:44,360 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 21:12:44,361 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 21:12:44,361 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 21:12:44,361 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 21:12:44,363 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 21:12:44,363 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 21:12:44,364 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 21:12:44,364 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 21:12:44,370 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 21:12:44,370 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 21:12:44,370 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 21:12:44,371 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 21:12:44,371 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 21:12:44,372 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 21:12:44,372 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 21:12:44,372 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 21:12:44,373 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 21:12:44,373 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 21:12:44,373 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 21:12:44,373 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:12:44,374 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 21:12:44,374 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 21:12:44,374 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 21:12:44,374 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 21:12:44,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 21:12:44,375 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 21:12:44,375 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 21:12:44,376 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 21:12:44,376 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 21:12:44,377 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 -> edf451b08ccf28b9358a6fa7c10128ea1b9a8f09b01361f9cd588dc4a31f271a [2024-10-12 21:12:44,640 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 21:12:44,668 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 21:12:44,671 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 21:12:44,672 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 21:12:44,672 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 21:12:44,673 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_2_2.i [2024-10-12 21:12:46,066 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 21:12:46,237 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 21:12:46,238 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_2_2.i [2024-10-12 21:12:46,244 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1f2374b9/9da44f2229614685a4d3e581649a68ac/FLAG33227c2a5 [2024-10-12 21:12:46,256 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1f2374b9/9da44f2229614685a4d3e581649a68ac [2024-10-12 21:12:46,259 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 21:12:46,260 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 21:12:46,262 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 21:12:46,262 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 21:12:46,266 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 21:12:46,267 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:12:46" (1/1) ... [2024-10-12 21:12:46,267 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15448f98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:12:46, skipping insertion in model container [2024-10-12 21:12:46,268 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:12:46" (1/1) ... [2024-10-12 21:12:46,292 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 21:12:46,485 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_2_2.i[1226,1239] [2024-10-12 21:12:46,515 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_2_2.i[2841,2854] [2024-10-12 21:12:46,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:12:46,528 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 21:12:46,538 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_2_2.i[1226,1239] [2024-10-12 21:12:46,547 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_2_2.i[2841,2854] [2024-10-12 21:12:46,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:12:46,567 INFO L204 MainTranslator]: Completed translation [2024-10-12 21:12:46,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:12:46 WrapperNode [2024-10-12 21:12:46,568 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 21:12:46,569 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 21:12:46,569 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 21:12:46,570 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 21:12:46,578 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:12:46" (1/1) ... [2024-10-12 21:12:46,587 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:12:46" (1/1) ... [2024-10-12 21:12:46,616 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 86 [2024-10-12 21:12:46,617 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 21:12:46,617 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 21:12:46,617 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 21:12:46,618 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 21:12:46,629 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:12:46" (1/1) ... [2024-10-12 21:12:46,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:12:46" (1/1) ... [2024-10-12 21:12:46,631 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:12:46" (1/1) ... [2024-10-12 21:12:46,644 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-10-12 21:12:46,644 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:12:46" (1/1) ... [2024-10-12 21:12:46,644 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:12:46" (1/1) ... [2024-10-12 21:12:46,649 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:12:46" (1/1) ... [2024-10-12 21:12:46,652 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:12:46" (1/1) ... [2024-10-12 21:12:46,653 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:12:46" (1/1) ... [2024-10-12 21:12:46,654 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:12:46" (1/1) ... [2024-10-12 21:12:46,660 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 21:12:46,661 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 21:12:46,661 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 21:12:46,661 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 21:12:46,662 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:12:46" (1/1) ... [2024-10-12 21:12:46,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:12:46,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:12:46,697 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-10-12 21:12:46,702 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-10-12 21:12:46,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 21:12:46,752 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-10-12 21:12:46,752 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-10-12 21:12:46,752 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-10-12 21:12:46,753 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-10-12 21:12:46,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 21:12:46,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 21:12:46,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 21:12:46,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 21:12:46,831 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 21:12:46,833 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 21:12:47,021 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-10-12 21:12:47,021 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 21:12:47,068 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 21:12:47,068 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 21:12:47,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:12:47 BoogieIcfgContainer [2024-10-12 21:12:47,069 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 21:12:47,075 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 21:12:47,075 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 21:12:47,079 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 21:12:47,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 09:12:46" (1/3) ... [2024-10-12 21:12:47,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@723307ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:12:47, skipping insertion in model container [2024-10-12 21:12:47,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:12:46" (2/3) ... [2024-10-12 21:12:47,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@723307ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:12:47, skipping insertion in model container [2024-10-12 21:12:47,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:12:47" (3/3) ... [2024-10-12 21:12:47,082 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_2_2.i [2024-10-12 21:12:47,106 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 21:12:47,107 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 21:12:47,174 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 21:12:47,184 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;@1884dbd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 21:12:47,185 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 21:12:47,192 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 23 states have internal predecessors, (32), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-12 21:12:47,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-12 21:12:47,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:12:47,206 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:12:47,207 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:12:47,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:12:47,217 INFO L85 PathProgramCache]: Analyzing trace with hash -22013170, now seen corresponding path program 1 times [2024-10-12 21:12:47,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:12:47,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306304736] [2024-10-12 21:12:47,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:12:47,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:12:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:12:47,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:12:47,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:12:47,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306304736] [2024-10-12 21:12:47,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306304736] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:12:47,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:12:47,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:12:47,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104338920] [2024-10-12 21:12:47,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:12:47,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:12:47,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:12:47,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:12:47,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:12:47,554 INFO L87 Difference]: Start difference. First operand has 30 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 23 states have internal predecessors, (32), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:12:47,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:12:47,629 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2024-10-12 21:12:47,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:12:47,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2024-10-12 21:12:47,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:12:47,636 INFO L225 Difference]: With dead ends: 58 [2024-10-12 21:12:47,636 INFO L226 Difference]: Without dead ends: 26 [2024-10-12 21:12:47,640 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-10-12 21:12:47,645 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:12:47,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 68 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:12:47,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-12 21:12:47,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2024-10-12 21:12:47,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-12 21:12:47,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2024-10-12 21:12:47,678 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 9 [2024-10-12 21:12:47,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:12:47,678 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2024-10-12 21:12:47,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:12:47,679 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2024-10-12 21:12:47,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-12 21:12:47,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:12:47,681 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:12:47,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 21:12:47,682 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:12:47,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:12:47,683 INFO L85 PathProgramCache]: Analyzing trace with hash 35245132, now seen corresponding path program 1 times [2024-10-12 21:12:47,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:12:47,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076714018] [2024-10-12 21:12:47,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:12:47,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:12:47,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:12:47,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:12:47,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:12:47,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076714018] [2024-10-12 21:12:47,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076714018] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:12:47,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:12:47,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:12:47,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316037649] [2024-10-12 21:12:47,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:12:47,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:12:47,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:12:47,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:12:47,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:12:47,832 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:12:47,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:12:47,868 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2024-10-12 21:12:47,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:12:47,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2024-10-12 21:12:47,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:12:47,871 INFO L225 Difference]: With dead ends: 31 [2024-10-12 21:12:47,871 INFO L226 Difference]: Without dead ends: 26 [2024-10-12 21:12:47,871 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-10-12 21:12:47,872 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:12:47,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 58 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:12:47,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-12 21:12:47,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-12 21:12:47,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-12 21:12:47,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2024-10-12 21:12:47,879 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 9 [2024-10-12 21:12:47,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:12:47,879 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2024-10-12 21:12:47,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:12:47,880 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2024-10-12 21:12:47,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-12 21:12:47,880 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:12:47,880 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:12:47,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 21:12:47,881 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:12:47,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:12:47,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1084284499, now seen corresponding path program 1 times [2024-10-12 21:12:47,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:12:47,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053288426] [2024-10-12 21:12:47,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:12:47,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:12:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:12:48,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:12:48,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:12:48,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053288426] [2024-10-12 21:12:48,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053288426] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:12:48,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418347453] [2024-10-12 21:12:48,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:12:48,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:12:48,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:12:48,116 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-10-12 21:12:48,124 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-10-12 21:12:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:12:48,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 21:12:48,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:12:48,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:12:48,264 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 21:12:48,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:12:48,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418347453] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 21:12:48,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 21:12:48,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2024-10-12 21:12:48,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512986674] [2024-10-12 21:12:48,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 21:12:48,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:12:48,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:12:48,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:12:48,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:12:48,334 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:12:48,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:12:48,430 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2024-10-12 21:12:48,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:12:48,431 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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 10 [2024-10-12 21:12:48,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:12:48,432 INFO L225 Difference]: With dead ends: 32 [2024-10-12 21:12:48,432 INFO L226 Difference]: Without dead ends: 27 [2024-10-12 21:12:48,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:12:48,433 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:12:48,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 113 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:12:48,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-12 21:12:48,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-12 21:12:48,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-12 21:12:48,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2024-10-12 21:12:48,441 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 10 [2024-10-12 21:12:48,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:12:48,442 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2024-10-12 21:12:48,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:12:48,442 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2024-10-12 21:12:48,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-12 21:12:48,443 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:12:48,443 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:12:48,461 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-10-12 21:12:48,647 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-10-12 21:12:48,648 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:12:48,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:12:48,649 INFO L85 PathProgramCache]: Analyzing trace with hash -755233492, now seen corresponding path program 2 times [2024-10-12 21:12:48,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:12:48,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313985597] [2024-10-12 21:12:48,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:12:48,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:12:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:12:49,093 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:12:49,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:12:49,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313985597] [2024-10-12 21:12:49,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313985597] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:12:49,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429718974] [2024-10-12 21:12:49,094 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 21:12:49,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:12:49,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:12:49,100 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-10-12 21:12:49,103 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-10-12 21:12:49,167 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 21:12:49,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 21:12:49,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-12 21:12:49,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:13:31,816 WARN L286 SmtUtils]: Spent 17.97s on a formula simplification. DAG size of input: 144 DAG size of output: 110 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-12 21:13:42,779 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (let ((.cse0 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256)) (.cse1 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_19|) (= 0 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_gcd_test_~a#1|)))))) (or (and (<= (+ |c_ULTIMATE.start_gcd_test_~a#1| 1) 0) (<= 128 .cse0) .cse1) (and .cse1 (<= 128 |c_ULTIMATE.start_gcd_test_~a#1|)) (and (<= .cse0 127) .cse1) (and (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|) (or (and (<= |c_ULTIMATE.start_gcd_test_~a#1| 127) .cse1) .cse1)))) (let ((.cse5 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse2 (* |c_ULTIMATE.start_main1_~y~0#1| 255))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse3 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse4 (mod .cse3 256))) (and (<= 128 (mod (+ .cse2 .cse3) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= .cse4 127) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse3) 256) 127) (= .cse4 |c_ULTIMATE.start_gcd_test_~a#1|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse6 (mod (+ .cse2 .cse7) 256))) (and (= .cse5 .cse6) (<= 128 (mod .cse7 256)) (<= 128 .cse6) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse7) 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse8 (mod .cse9 256))) (and (= .cse8 .cse5) (<= 128 .cse8) (<= (mod (+ .cse2 .cse9) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse9) 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse10 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse11 (mod .cse10 256))) (and (<= (mod (+ .cse2 .cse10) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= .cse11 127) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse10) 256) 127) (= .cse11 |c_ULTIMATE.start_gcd_test_~a#1|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse12 (mod .cse13 256))) (and (= .cse12 .cse5) (<= 128 .cse12) (<= 128 (mod (+ .cse2 .cse13) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse13) 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse15 (mod (+ .cse2 .cse14) 256))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse14) 256)) (<= 128 (mod .cse14 256)) (<= .cse15 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse15))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse17 (mod .cse16 256))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse16) 256)) (<= (mod (+ .cse2 .cse16) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= .cse17 127) (= .cse17 |c_ULTIMATE.start_gcd_test_~a#1|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse18 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse19 (mod (+ .cse2 .cse18) 256))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse18) 256)) (<= .cse19 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (not (= .cse18 0)) (<= (mod .cse18 256) 127) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse19))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse20 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse21 (mod .cse20 256))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse20) 256)) (= .cse21 .cse5) (<= 128 .cse21) (<= 128 (mod (+ .cse2 .cse20) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse22 (mod (+ .cse2 .cse23) 256))) (and (<= .cse22 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= (mod .cse23 256) 127) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse23) 256) 127) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse22))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse25 (mod (+ .cse2 .cse24) 256))) (and (<= 128 (mod .cse24 256)) (<= .cse25 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse24) 256) 127) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse25))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse27 (mod (+ .cse2 .cse26) 256))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse26) 256)) (= .cse5 .cse27) (<= 128 (mod .cse26 256)) (<= 128 .cse27) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse29 (mod (+ .cse2 .cse28) 256))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse28) 256)) (= .cse5 .cse29) (<= 128 .cse29) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (not (= .cse28 0)) (<= (mod .cse28 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse30 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse31 (mod .cse30 256))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse30) 256)) (<= 128 (mod (+ .cse2 .cse30) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= .cse31 127) (= .cse31 |c_ULTIMATE.start_gcd_test_~a#1|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse33 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse32 (mod (+ .cse2 .cse33) 256))) (and (= .cse5 .cse32) (<= 128 .cse32) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (not (= .cse33 0)) (<= (mod .cse33 256) 127) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse33) 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse34 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse35 (mod .cse34 256))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse34) 256)) (= .cse35 .cse5) (<= 128 .cse35) (<= (mod (+ .cse2 .cse34) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|))))))) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from true [2024-10-12 21:14:15,002 WARN L286 SmtUtils]: Spent 10.93s on a formula simplification that was a NOOP. DAG size: 89 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)