./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_8.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_2_8.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3c398287975b44a672accc5dcc25b28e536e19f2a0478c0e2a0b4b73bd7a8e18 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:33:08,423 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:33:08,479 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 04:33:08,484 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:33:08,486 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:33:08,506 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:33:08,507 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:33:08,508 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:33:08,508 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:33:08,508 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:33:08,508 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:33:08,509 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:33:08,509 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:33:08,509 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:33:08,509 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:33:08,510 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:33:08,510 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:33:08,510 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:33:08,510 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:33:08,510 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:33:08,511 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:33:08,514 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:33:08,514 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:33:08,514 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:33:08,516 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:33:08,516 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:33:08,517 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:33:08,517 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:33:08,517 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:33:08,517 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:33:08,517 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:33:08,517 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:33:08,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:33:08,518 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:33:08,518 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:33:08,518 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:33:08,518 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:33:08,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:33:08,518 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:33:08,518 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:33:08,519 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:33:08,519 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:33:08,520 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3c398287975b44a672accc5dcc25b28e536e19f2a0478c0e2a0b4b73bd7a8e18 [2024-10-11 04:33:08,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:33:08,756 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:33:08,759 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:33:08,759 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:33:08,760 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:33:08,760 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_2_8.i [2024-10-11 04:33:10,025 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:33:10,168 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:33:10,169 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_2_8.i [2024-10-11 04:33:10,177 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d4896b74f/4db7f1a26b0243acbea574ec9a26a97b/FLAGb7b4fadee [2024-10-11 04:33:10,587 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d4896b74f/4db7f1a26b0243acbea574ec9a26a97b [2024-10-11 04:33:10,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:33:10,589 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:33:10,590 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:33:10,591 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:33:10,594 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:33:10,595 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:33:10" (1/1) ... [2024-10-11 04:33:10,596 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c78ed51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:33:10, skipping insertion in model container [2024-10-11 04:33:10,596 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:33:10" (1/1) ... [2024-10-11 04:33:10,612 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:33:10,733 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_8.i[1226,1239] [2024-10-11 04:33:10,755 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_8.i[2841,2854] [2024-10-11 04:33:10,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:33:10,767 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:33:10,776 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_8.i[1226,1239] [2024-10-11 04:33:10,782 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_8.i[2841,2854] [2024-10-11 04:33:10,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:33:10,797 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:33:10,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:33:10 WrapperNode [2024-10-11 04:33:10,797 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:33:10,799 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:33:10,799 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:33:10,799 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:33:10,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:33:10" (1/1) ... [2024-10-11 04:33:10,810 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:33:10" (1/1) ... [2024-10-11 04:33:10,826 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 86 [2024-10-11 04:33:10,827 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:33:10,827 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:33:10,827 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:33:10,827 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:33:10,836 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:33:10" (1/1) ... [2024-10-11 04:33:10,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:33:10" (1/1) ... [2024-10-11 04:33:10,837 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:33:10" (1/1) ... [2024-10-11 04:33:10,852 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-11 04:33:10,852 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:33:10" (1/1) ... [2024-10-11 04:33:10,852 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:33:10" (1/1) ... [2024-10-11 04:33:10,855 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:33:10" (1/1) ... [2024-10-11 04:33:10,857 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:33:10" (1/1) ... [2024-10-11 04:33:10,857 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:33:10" (1/1) ... [2024-10-11 04:33:10,858 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:33:10" (1/1) ... [2024-10-11 04:33:10,859 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:33:10,860 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:33:10,860 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:33:10,860 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:33:10,861 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:33:10" (1/1) ... [2024-10-11 04:33:10,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:33:10,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:33:10,908 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 04:33:10,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 04:33:10,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:33:10,951 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-10-11 04:33:10,951 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-10-11 04:33:10,951 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-10-11 04:33:10,952 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-10-11 04:33:10,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:33:10,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 04:33:10,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:33:10,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:33:11,016 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:33:11,018 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:33:11,223 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-10-11 04:33:11,223 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:33:11,256 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:33:11,256 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 04:33:11,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:33:11 BoogieIcfgContainer [2024-10-11 04:33:11,257 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:33:11,258 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:33:11,258 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:33:11,261 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:33:11,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:33:10" (1/3) ... [2024-10-11 04:33:11,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46e6ae19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:33:11, skipping insertion in model container [2024-10-11 04:33:11,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:33:10" (2/3) ... [2024-10-11 04:33:11,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46e6ae19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:33:11, skipping insertion in model container [2024-10-11 04:33:11,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:33:11" (3/3) ... [2024-10-11 04:33:11,264 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_2_8.i [2024-10-11 04:33:11,277 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:33:11,278 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:33:11,332 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:33:11,339 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;@107ed442, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:33:11,340 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:33:11,344 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-11 04:33:11,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 04:33:11,350 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:33:11,351 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:33:11,351 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:33:11,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:33:11,356 INFO L85 PathProgramCache]: Analyzing trace with hash -22013170, now seen corresponding path program 1 times [2024-10-11 04:33:11,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:33:11,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606404080] [2024-10-11 04:33:11,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:33:11,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:33:11,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:33:11,572 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-11 04:33:11,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:33:11,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606404080] [2024-10-11 04:33:11,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606404080] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:33:11,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:33:11,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:33:11,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870109971] [2024-10-11 04:33:11,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:33:11,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:33:11,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:33:11,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:33:11,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:33:11,597 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-11 04:33:11,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:33:11,665 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2024-10-11 04:33:11,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:33:11,668 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-11 04:33:11,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:33:11,673 INFO L225 Difference]: With dead ends: 58 [2024-10-11 04:33:11,673 INFO L226 Difference]: Without dead ends: 26 [2024-10-11 04:33:11,675 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-11 04:33:11,677 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.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:33:11,679 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.0s Time] [2024-10-11 04:33:11,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-11 04:33:11,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2024-10-11 04:33:11,702 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-11 04:33:11,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2024-10-11 04:33:11,704 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 9 [2024-10-11 04:33:11,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:33:11,704 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2024-10-11 04:33:11,704 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-11 04:33:11,705 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2024-10-11 04:33:11,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 04:33:11,706 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:33:11,706 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:33:11,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:33:11,706 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:33:11,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:33:11,707 INFO L85 PathProgramCache]: Analyzing trace with hash 35245132, now seen corresponding path program 1 times [2024-10-11 04:33:11,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:33:11,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676633245] [2024-10-11 04:33:11,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:33:11,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:33:11,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:33:11,805 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-11 04:33:11,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:33:11,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676633245] [2024-10-11 04:33:11,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676633245] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:33:11,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:33:11,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:33:11,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164471838] [2024-10-11 04:33:11,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:33:11,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:33:11,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:33:11,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:33:11,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:33:11,813 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-11 04:33:11,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:33:11,841 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2024-10-11 04:33:11,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:33:11,842 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-11 04:33:11,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:33:11,842 INFO L225 Difference]: With dead ends: 31 [2024-10-11 04:33:11,842 INFO L226 Difference]: Without dead ends: 26 [2024-10-11 04:33:11,843 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-11 04:33:11,844 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-11 04:33:11,844 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-11 04:33:11,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-11 04:33:11,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-11 04:33:11,849 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-11 04:33:11,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2024-10-11 04:33:11,851 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 9 [2024-10-11 04:33:11,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:33:11,851 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2024-10-11 04:33:11,851 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-11 04:33:11,851 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2024-10-11 04:33:11,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 04:33:11,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:33:11,852 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:33:11,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:33:11,852 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:33:11,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:33:11,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1084284499, now seen corresponding path program 1 times [2024-10-11 04:33:11,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:33:11,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327439540] [2024-10-11 04:33:11,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:33:11,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:33:11,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:33:12,050 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-11 04:33:12,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:33:12,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327439540] [2024-10-11 04:33:12,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327439540] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:33:12,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983829729] [2024-10-11 04:33:12,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:33:12,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:33:12,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:33:12,060 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:33:12,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 04:33:12,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:33:12,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 04:33:12,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:33:12,183 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-11 04:33:12,183 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:33:12,231 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-11 04:33:12,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983829729] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:33:12,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:33:12,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2024-10-11 04:33:12,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266748800] [2024-10-11 04:33:12,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:33:12,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 04:33:12,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:33:12,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 04:33:12,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:33:12,238 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-11 04:33:12,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:33:12,323 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2024-10-11 04:33:12,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:33:12,324 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-11 04:33:12,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:33:12,325 INFO L225 Difference]: With dead ends: 32 [2024-10-11 04:33:12,325 INFO L226 Difference]: Without dead ends: 27 [2024-10-11 04:33:12,325 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-11 04:33:12,326 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-11 04:33:12,326 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-11 04:33:12,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-11 04:33:12,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-11 04:33:12,331 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-11 04:33:12,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2024-10-11 04:33:12,332 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 10 [2024-10-11 04:33:12,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:33:12,332 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2024-10-11 04:33:12,332 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-11 04:33:12,332 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2024-10-11 04:33:12,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 04:33:12,333 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:33:12,333 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:33:12,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 04:33:12,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:33:12,538 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:33:12,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:33:12,539 INFO L85 PathProgramCache]: Analyzing trace with hash -755233492, now seen corresponding path program 2 times [2024-10-11 04:33:12,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:33:12,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258253801] [2024-10-11 04:33:12,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:33:12,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:33:12,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:33:12,888 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-11 04:33:12,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:33:12,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258253801] [2024-10-11 04:33:12,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258253801] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:33:12,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336421303] [2024-10-11 04:33:12,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 04:33:12,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:33:12,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:33:12,892 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:33:12,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 04:33:12,939 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 04:33:12,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 04:33:12,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-11 04:33:12,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:33:53,049 WARN L286 SmtUtils]: Spent 19.01s 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-11 04:34:30,032 WARN L286 SmtUtils]: Spent 17.14s on a formula simplification. DAG size of input: 93 DAG size of output: 88 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-11 04:34:40,737 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (not (= |c_ULTIMATE.start_main1_~g~0#1| 0)) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|) (<= |c_ULTIMATE.start_main1_~g~0#1| 127) (let ((.cse0 (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|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_main1_~g~0#1|) 0)))) (.cse1 (mod (* 255 |c_ULTIMATE.start_main1_~g~0#1|) 256))) (or (and (<= (+ |c_ULTIMATE.start_main1_~g~0#1| 1) 0) .cse0 (<= 128 .cse1)) (and .cse0 (<= 0 |c_ULTIMATE.start_main1_~g~0#1|)) (and .cse0 (<= .cse1 127)))) (let ((.cse4 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) (.cse5 (+ 256 |c_ULTIMATE.start_main1_~g~0#1|))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse3 (mod .cse2 256))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse2) 256)) (<= 128 .cse3) (<= 128 (mod (+ .cse4 .cse2) 256)) (= .cse3 .cse5) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse6 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse7 (mod (+ .cse4 .cse6) 256))) (and (<= 128 (mod .cse6 256)) (<= 128 .cse7) (= .cse5 .cse7) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse6) 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse8 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse8) 256)) (<= 128 (mod (+ .cse4 .cse8) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (= (mod .cse8 256) |c_ULTIMATE.start_main1_~g~0#1|)))) (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 ((.cse10 (mod .cse9 256))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse9) 256)) (<= 128 .cse10) (= .cse10 .cse5) (<= (mod (+ .cse4 .cse9) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse11 (mod (+ .cse4 .cse12) 256))) (and (<= 128 .cse11) (= .cse5 .cse11) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (not (= .cse12 0)) (<= (mod .cse12 256) 127) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse12) 256) 127))))) (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|))) (and (= |c_ULTIMATE.start_main1_~g~0#1| (mod (+ .cse4 .cse13) 256)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse13) 256)) (<= 128 (mod .cse13 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0)))) (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|))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse14) 256)) (<= (mod (+ .cse4 .cse14) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (= (mod .cse14 256) |c_ULTIMATE.start_main1_~g~0#1|)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse15 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (and (= |c_ULTIMATE.start_main1_~g~0#1| (mod (+ .cse4 .cse15) 256)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse15) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (not (= .cse15 0)) (<= (mod .cse15 256) 127)))) (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|))) (and (= |c_ULTIMATE.start_main1_~g~0#1| (mod (+ .cse4 .cse16) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= (mod .cse16 256) 127) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse16) 256) 127)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (and (<= 128 (mod (+ .cse4 .cse17) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (= (mod .cse17 256) |c_ULTIMATE.start_main1_~g~0#1|) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse17) 256) 127)))) (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 (+ .cse4 .cse18) 256))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse18) 256)) (<= 128 .cse19) (= .cse5 .cse19) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (not (= .cse18 0)) (<= (mod .cse18 256) 127))))) (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|))) (and (<= (mod (+ .cse4 .cse20) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (= (mod .cse20 256) |c_ULTIMATE.start_main1_~g~0#1|) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse20) 256) 127)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse21 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (and (= |c_ULTIMATE.start_main1_~g~0#1| (mod (+ .cse4 .cse21) 256)) (<= 128 (mod .cse21 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse21) 256) 127)))) (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 .cse23 256))) (and (<= 128 .cse22) (= .cse22 .cse5) (<= (mod (+ .cse4 .cse23) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse23) 256) 127))))) (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 (+ .cse4 .cse24) 256))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse24) 256)) (<= 128 (mod .cse24 256)) (<= 128 .cse25) (= .cse5 .cse25) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse26 (mod .cse27 256))) (and (<= 128 .cse26) (<= 128 (mod (+ .cse4 .cse27) 256)) (= .cse26 .cse5) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse27) 256) 127)))))))) is different from true [2024-10-11 04:34:54,931 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-11 04:34:54,931 INFO L311 TraceCheckSpWp]: Computing backward predicates...