./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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/nla-digbench-scaling/cohendiv-ll_unwindbound1.c -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 079768eb2ce141267a1411f9330cb4d0cef674bf78865555f3130b47379d643a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 02:12:51,540 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 02:12:51,619 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 02:12:51,624 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 02:12:51,625 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 02:12:51,659 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 02:12:51,660 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 02:12:51,660 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 02:12:51,661 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 02:12:51,663 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 02:12:51,663 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 02:12:51,664 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 02:12:51,664 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 02:12:51,664 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 02:12:51,668 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 02:12:51,668 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 02:12:51,669 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 02:12:51,669 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 02:12:51,669 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 02:12:51,669 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 02:12:51,670 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 02:12:51,671 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 02:12:51,671 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 02:12:51,672 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 02:12:51,672 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 02:12:51,673 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 02:12:51,673 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 02:12:51,673 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 02:12:51,674 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 02:12:51,674 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 02:12:51,674 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 02:12:51,675 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 02:12:51,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:12:51,676 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 02:12:51,676 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 02:12:51,676 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 02:12:51,677 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 02:12:51,677 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 02:12:51,677 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 02:12:51,677 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 02:12:51,677 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 02:12:51,678 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 02:12:51,678 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 -> 079768eb2ce141267a1411f9330cb4d0cef674bf78865555f3130b47379d643a [2024-10-14 02:12:51,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 02:12:51,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 02:12:51,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 02:12:51,923 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 02:12:51,923 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 02:12:51,924 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound1.c [2024-10-14 02:12:53,351 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 02:12:53,513 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 02:12:53,513 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound1.c [2024-10-14 02:12:53,519 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8a4af531/24727faa293548ad973a50c8acf5d848/FLAG4630fd301 [2024-10-14 02:12:53,531 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8a4af531/24727faa293548ad973a50c8acf5d848 [2024-10-14 02:12:53,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 02:12:53,534 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 02:12:53,535 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 02:12:53,535 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 02:12:53,541 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 02:12:53,542 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:12:53" (1/1) ... [2024-10-14 02:12:53,542 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f261654 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:12:53, skipping insertion in model container [2024-10-14 02:12:53,542 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:12:53" (1/1) ... [2024-10-14 02:12:53,562 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 02:12:53,715 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/nla-digbench-scaling/cohendiv-ll_unwindbound1.c[576,589] [2024-10-14 02:12:53,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:12:53,740 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 02:12:53,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/nla-digbench-scaling/cohendiv-ll_unwindbound1.c[576,589] [2024-10-14 02:12:53,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:12:53,779 INFO L204 MainTranslator]: Completed translation [2024-10-14 02:12:53,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:12:53 WrapperNode [2024-10-14 02:12:53,780 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 02:12:53,780 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 02:12:53,780 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 02:12:53,781 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 02:12:53,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:12:53" (1/1) ... [2024-10-14 02:12:53,792 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:12:53" (1/1) ... [2024-10-14 02:12:53,809 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2024-10-14 02:12:53,810 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 02:12:53,810 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 02:12:53,810 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 02:12:53,810 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 02:12:53,817 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:12:53" (1/1) ... [2024-10-14 02:12:53,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:12:53" (1/1) ... [2024-10-14 02:12:53,819 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:12:53" (1/1) ... [2024-10-14 02:12:53,828 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 02:12:53,829 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:12:53" (1/1) ... [2024-10-14 02:12:53,829 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:12:53" (1/1) ... [2024-10-14 02:12:53,831 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:12:53" (1/1) ... [2024-10-14 02:12:53,834 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:12:53" (1/1) ... [2024-10-14 02:12:53,835 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:12:53" (1/1) ... [2024-10-14 02:12:53,835 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:12:53" (1/1) ... [2024-10-14 02:12:53,837 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 02:12:53,838 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 02:12:53,838 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 02:12:53,838 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 02:12:53,839 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:12:53" (1/1) ... [2024-10-14 02:12:53,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:12:53,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:12:53,876 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-14 02:12:53,882 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-14 02:12:53,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 02:12:53,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 02:12:53,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 02:12:53,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 02:12:53,925 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 02:12:53,925 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 02:12:53,993 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 02:12:53,995 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 02:12:54,169 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-10-14 02:12:54,169 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 02:12:54,210 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 02:12:54,211 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 02:12:54,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:12:54 BoogieIcfgContainer [2024-10-14 02:12:54,211 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 02:12:54,214 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 02:12:54,215 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 02:12:54,218 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 02:12:54,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:12:53" (1/3) ... [2024-10-14 02:12:54,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33b2fb3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:12:54, skipping insertion in model container [2024-10-14 02:12:54,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:12:53" (2/3) ... [2024-10-14 02:12:54,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33b2fb3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:12:54, skipping insertion in model container [2024-10-14 02:12:54,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:12:54" (3/3) ... [2024-10-14 02:12:54,223 INFO L112 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_unwindbound1.c [2024-10-14 02:12:54,238 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 02:12:54,239 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 02:12:54,309 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 02:12:54,316 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;@44dbe988, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 02:12:54,317 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 02:12:54,321 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-14 02:12:54,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 02:12:54,328 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:12:54,328 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:12:54,329 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:12:54,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:12:54,334 INFO L85 PathProgramCache]: Analyzing trace with hash 753274055, now seen corresponding path program 1 times [2024-10-14 02:12:54,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:12:54,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987190461] [2024-10-14 02:12:54,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:12:54,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:12:54,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:12:54,494 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-14 02:12:54,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:12:54,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987190461] [2024-10-14 02:12:54,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987190461] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:12:54,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:12:54,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 02:12:54,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724948145] [2024-10-14 02:12:54,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:12:54,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 02:12:54,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:12:54,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 02:12:54,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 02:12:54,530 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 02:12:54,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:12:54,554 INFO L93 Difference]: Finished difference Result 50 states and 82 transitions. [2024-10-14 02:12:54,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 02:12:54,556 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-14 02:12:54,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:12:54,567 INFO L225 Difference]: With dead ends: 50 [2024-10-14 02:12:54,568 INFO L226 Difference]: Without dead ends: 24 [2024-10-14 02:12:54,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 02:12:54,578 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:12:54,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:12:54,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-14 02:12:54,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-14 02:12:54,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 16 states have internal predecessors, (20), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 02:12:54,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2024-10-14 02:12:54,612 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 8 [2024-10-14 02:12:54,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:12:54,613 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2024-10-14 02:12:54,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 02:12:54,614 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2024-10-14 02:12:54,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 02:12:54,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:12:54,615 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:12:54,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 02:12:54,616 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:12:54,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:12:54,616 INFO L85 PathProgramCache]: Analyzing trace with hash -79941692, now seen corresponding path program 1 times [2024-10-14 02:12:54,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:12:54,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725940727] [2024-10-14 02:12:54,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:12:54,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:12:54,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:12:54,752 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-14 02:12:54,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:12:54,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725940727] [2024-10-14 02:12:54,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725940727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:12:54,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:12:54,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 02:12:54,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657274078] [2024-10-14 02:12:54,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:12:54,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 02:12:54,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:12:54,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 02:12:54,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 02:12:54,757 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 02:12:54,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:12:54,791 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2024-10-14 02:12:54,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 02:12:54,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-14 02:12:54,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:12:54,793 INFO L225 Difference]: With dead ends: 33 [2024-10-14 02:12:54,793 INFO L226 Difference]: Without dead ends: 26 [2024-10-14 02:12:54,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-14 02:12:54,795 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:12:54,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:12:54,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-14 02:12:54,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-14 02:12:54,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 02:12:54,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2024-10-14 02:12:54,804 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 9 [2024-10-14 02:12:54,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:12:54,804 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2024-10-14 02:12:54,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 02:12:54,804 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2024-10-14 02:12:54,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 02:12:54,805 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:12:54,805 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:12:54,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 02:12:54,806 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:12:54,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:12:54,806 INFO L85 PathProgramCache]: Analyzing trace with hash -78452142, now seen corresponding path program 1 times [2024-10-14 02:12:54,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:12:54,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790282106] [2024-10-14 02:12:54,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:12:54,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:12:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 02:12:54,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2005706540] [2024-10-14 02:12:54,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:12:54,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:12:54,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:12:54,836 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-14 02:12:54,837 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-14 02:12:54,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:12:54,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 02:12:54,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:12:54,996 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-14 02:12:54,997 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 02:12:54,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:12:54,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790282106] [2024-10-14 02:12:54,998 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 02:12:54,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005706540] [2024-10-14 02:12:55,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005706540] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:12:55,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:12:55,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 02:12:55,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404727883] [2024-10-14 02:12:55,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:12:55,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 02:12:55,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:12:55,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 02:12:55,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 02:12:55,004 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 02:12:55,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:12:55,069 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2024-10-14 02:12:55,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 02:12:55,070 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-14 02:12:55,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:12:55,071 INFO L225 Difference]: With dead ends: 36 [2024-10-14 02:12:55,072 INFO L226 Difference]: Without dead ends: 34 [2024-10-14 02:12:55,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:12:55,073 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 4 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:12:55,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 104 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:12:55,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-14 02:12:55,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2024-10-14 02:12:55,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-14 02:12:55,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2024-10-14 02:12:55,088 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 9 [2024-10-14 02:12:55,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:12:55,089 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 40 transitions. [2024-10-14 02:12:55,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 02:12:55,089 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2024-10-14 02:12:55,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 02:12:55,090 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:12:55,090 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:12:55,109 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-14 02:12:55,292 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-14 02:12:55,292 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:12:55,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:12:55,293 INFO L85 PathProgramCache]: Analyzing trace with hash 921583882, now seen corresponding path program 1 times [2024-10-14 02:12:55,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:12:55,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799948962] [2024-10-14 02:12:55,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:12:55,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:12:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 02:12:55,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [935971202] [2024-10-14 02:12:55,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:12:55,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:12:55,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:12:55,321 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-14 02:12:55,322 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-14 02:12:55,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:12:55,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 02:12:55,362 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:12:55,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:12:55,416 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 02:12:55,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:12:55,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799948962] [2024-10-14 02:12:55,417 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 02:12:55,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935971202] [2024-10-14 02:12:55,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935971202] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:12:55,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:12:55,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 02:12:55,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084184416] [2024-10-14 02:12:55,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:12:55,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 02:12:55,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:12:55,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 02:12:55,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 02:12:55,420 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 02:12:55,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:12:55,487 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2024-10-14 02:12:55,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 02:12:55,488 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-14 02:12:55,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:12:55,489 INFO L225 Difference]: With dead ends: 49 [2024-10-14 02:12:55,489 INFO L226 Difference]: Without dead ends: 46 [2024-10-14 02:12:55,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:12:55,491 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 11 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:12:55,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 93 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 02:12:55,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-14 02:12:55,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2024-10-14 02:12:55,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 02:12:55,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2024-10-14 02:12:55,512 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 14 [2024-10-14 02:12:55,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:12:55,513 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2024-10-14 02:12:55,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 02:12:55,513 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2024-10-14 02:12:55,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-14 02:12:55,514 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:12:55,514 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:12:55,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 02:12:55,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-10-14 02:12:55,720 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:12:55,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:12:55,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1948965363, now seen corresponding path program 1 times [2024-10-14 02:12:55,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:12:55,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560378433] [2024-10-14 02:12:55,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:12:55,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:12:55,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:12:55,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 02:12:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:12:55,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 02:12:55,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:12:55,914 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 02:12:55,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:12:55,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560378433] [2024-10-14 02:12:55,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560378433] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:12:55,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:12:55,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:12:55,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901308474] [2024-10-14 02:12:55,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:12:55,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:12:55,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:12:55,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:12:55,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:12:55,916 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 02:12:55,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:12:55,968 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2024-10-14 02:12:55,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:12:55,969 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-10-14 02:12:55,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:12:55,970 INFO L225 Difference]: With dead ends: 66 [2024-10-14 02:12:55,970 INFO L226 Difference]: Without dead ends: 33 [2024-10-14 02:12:55,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:12:55,971 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 13 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:12:55,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 51 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:12:55,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-14 02:12:55,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2024-10-14 02:12:55,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 02:12:55,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2024-10-14 02:12:55,979 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 22 [2024-10-14 02:12:55,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:12:55,979 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2024-10-14 02:12:55,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 02:12:55,979 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2024-10-14 02:12:55,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-14 02:12:55,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:12:55,980 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:12:55,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 02:12:55,980 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:12:55,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:12:55,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1914041250, now seen corresponding path program 1 times [2024-10-14 02:12:55,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:12:55,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971148871] [2024-10-14 02:12:55,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:12:55,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:12:56,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 02:12:56,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2084156775] [2024-10-14 02:12:56,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:12:56,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:12:56,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:12:56,009 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:12:56,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 02:12:56,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:12:56,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 02:12:56,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:12:56,216 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 02:12:56,217 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 02:12:56,360 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 02:12:56,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:12:56,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971148871] [2024-10-14 02:12:56,360 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 02:12:56,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084156775] [2024-10-14 02:12:56,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084156775] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 02:12:56,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 02:12:56,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2024-10-14 02:12:56,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785868676] [2024-10-14 02:12:56,361 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 02:12:56,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 02:12:56,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:12:56,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 02:12:56,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:12:56,364 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 02:12:56,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:12:56,516 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2024-10-14 02:12:56,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 02:12:56,517 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-10-14 02:12:56,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:12:56,518 INFO L225 Difference]: With dead ends: 43 [2024-10-14 02:12:56,518 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 02:12:56,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-14 02:12:56,519 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 28 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:12:56,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 83 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 02:12:56,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 02:12:56,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 02:12:56,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 02:12:56,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 02:12:56,521 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2024-10-14 02:12:56,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:12:56,521 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 02:12:56,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 02:12:56,521 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 02:12:56,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 02:12:56,524 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 02:12:56,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 02:12:56,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:12:56,731 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-14 02:12:56,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 02:12:56,938 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 02:12:56,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 02:12:56 BoogieIcfgContainer [2024-10-14 02:12:56,957 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 02:12:56,958 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 02:12:56,958 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 02:12:56,958 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 02:12:56,958 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:12:54" (3/4) ... [2024-10-14 02:12:56,961 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 02:12:56,964 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-14 02:12:56,969 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-14 02:12:56,969 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-14 02:12:56,969 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 02:12:56,970 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 02:12:57,058 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 02:12:57,059 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 02:12:57,059 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 02:12:57,059 INFO L158 Benchmark]: Toolchain (without parser) took 3525.46ms. Allocated memory was 155.2MB in the beginning and 205.5MB in the end (delta: 50.3MB). Free memory was 99.1MB in the beginning and 167.1MB in the end (delta: -68.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 02:12:57,059 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 155.2MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 02:12:57,060 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.99ms. Allocated memory is still 155.2MB. Free memory was 98.6MB in the beginning and 87.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 02:12:57,060 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.44ms. Allocated memory is still 155.2MB. Free memory was 87.1MB in the beginning and 85.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 02:12:57,060 INFO L158 Benchmark]: Boogie Preprocessor took 26.82ms. Allocated memory is still 155.2MB. Free memory was 85.6MB in the beginning and 83.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 02:12:57,060 INFO L158 Benchmark]: RCFGBuilder took 373.77ms. Allocated memory is still 155.2MB. Free memory was 83.5MB in the beginning and 71.4MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 02:12:57,061 INFO L158 Benchmark]: TraceAbstraction took 2742.98ms. Allocated memory was 155.2MB in the beginning and 205.5MB in the end (delta: 50.3MB). Free memory was 70.9MB in the beginning and 172.3MB in the end (delta: -101.4MB). Peak memory consumption was 66.2MB. Max. memory is 16.1GB. [2024-10-14 02:12:57,061 INFO L158 Benchmark]: Witness Printer took 101.25ms. Allocated memory is still 205.5MB. Free memory was 172.3MB in the beginning and 167.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 02:12:57,063 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 155.2MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 244.99ms. Allocated memory is still 155.2MB. Free memory was 98.6MB in the beginning and 87.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.44ms. Allocated memory is still 155.2MB. Free memory was 87.1MB in the beginning and 85.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.82ms. Allocated memory is still 155.2MB. Free memory was 85.6MB in the beginning and 83.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 373.77ms. Allocated memory is still 155.2MB. Free memory was 83.5MB in the beginning and 71.4MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2742.98ms. Allocated memory was 155.2MB in the beginning and 205.5MB in the end (delta: 50.3MB). Free memory was 70.9MB in the beginning and 172.3MB in the end (delta: -101.4MB). Peak memory consumption was 66.2MB. Max. memory is 16.1GB. * Witness Printer took 101.25ms. Allocated memory is still 205.5MB. Free memory was 172.3MB in the beginning and 167.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 63 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 56 mSDsluCounter, 450 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 299 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 180 IncrementalHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 151 mSDtfsCounter, 180 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=4, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 105 ConstructedInterpolants, 0 QuantifiedInterpolants, 364 SizeOfPredicates, 6 NumberOfNonLiveVariables, 202 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 7 InterpolantComputations, 5 PerfectInterpolantSequences, 26/30 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (((x == (r + ((__int128) q * y))) && (1 <= counter)) && (((__int128) b + x) == ((((__int128) a * y) + r) + ((__int128) q * y)))) - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ((((x == (r + ((__int128) q * y))) && (1 <= counter)) && (((__int128) b + x) == ((((__int128) a * y) + r) + ((__int128) q * y)))) || (((((b == 0) && (r == x)) && (q == 0)) && (counter == 0)) && (a == 0))) - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (1 <= cond) Ensures: (1 <= cond) RESULT: Ultimate proved your program to be correct! [2024-10-14 02:12:57,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE