./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/sendmail-close-angle.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/loop-invgen/sendmail-close-angle.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 4be4b344509b887bc91f2389f98de1e4ff745494aee0f078864fd49e79b0b4b8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 01:52:07,752 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 01:52:07,818 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 01:52:07,824 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 01:52:07,824 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 01:52:07,853 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 01:52:07,853 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 01:52:07,854 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 01:52:07,854 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 01:52:07,855 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 01:52:07,855 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 01:52:07,856 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 01:52:07,856 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 01:52:07,858 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 01:52:07,858 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 01:52:07,859 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 01:52:07,861 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 01:52:07,861 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 01:52:07,862 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 01:52:07,862 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 01:52:07,862 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 01:52:07,866 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 01:52:07,866 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 01:52:07,866 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 01:52:07,866 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 01:52:07,867 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 01:52:07,867 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 01:52:07,867 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 01:52:07,868 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 01:52:07,868 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 01:52:07,868 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 01:52:07,868 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 01:52:07,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:52:07,869 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 01:52:07,869 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 01:52:07,869 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 01:52:07,870 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 01:52:07,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 01:52:07,870 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 01:52:07,870 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 01:52:07,870 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 01:52:07,871 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 01:52:07,871 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 -> 4be4b344509b887bc91f2389f98de1e4ff745494aee0f078864fd49e79b0b4b8 [2024-10-11 01:52:08,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 01:52:08,161 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 01:52:08,164 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 01:52:08,165 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 01:52:08,166 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 01:52:08,167 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/sendmail-close-angle.i [2024-10-11 01:52:09,621 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 01:52:09,788 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 01:52:09,788 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/sendmail-close-angle.i [2024-10-11 01:52:09,796 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e35cfe469/bb5ec1380fb342bc844f5c44562f4a99/FLAG3e226f829 [2024-10-11 01:52:09,810 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e35cfe469/bb5ec1380fb342bc844f5c44562f4a99 [2024-10-11 01:52:09,812 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 01:52:09,813 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 01:52:09,815 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 01:52:09,815 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 01:52:09,823 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 01:52:09,823 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:52:09" (1/1) ... [2024-10-11 01:52:09,824 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@696c80e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:52:09, skipping insertion in model container [2024-10-11 01:52:09,824 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:52:09" (1/1) ... [2024-10-11 01:52:09,847 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 01:52:10,058 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/loop-invgen/sendmail-close-angle.i[893,906] [2024-10-11 01:52:10,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:52:10,088 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 01:52:10,101 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/loop-invgen/sendmail-close-angle.i[893,906] [2024-10-11 01:52:10,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:52:10,125 INFO L204 MainTranslator]: Completed translation [2024-10-11 01:52:10,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:52:10 WrapperNode [2024-10-11 01:52:10,126 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 01:52:10,127 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 01:52:10,128 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 01:52:10,128 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 01:52:10,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:52:10" (1/1) ... [2024-10-11 01:52:10,143 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:52:10" (1/1) ... [2024-10-11 01:52:10,161 INFO L138 Inliner]: procedures = 16, calls = 14, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 61 [2024-10-11 01:52:10,162 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 01:52:10,163 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 01:52:10,163 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 01:52:10,163 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 01:52:10,172 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:52:10" (1/1) ... [2024-10-11 01:52:10,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:52:10" (1/1) ... [2024-10-11 01:52:10,178 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:52:10" (1/1) ... [2024-10-11 01:52:10,199 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-11 01:52:10,200 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:52:10" (1/1) ... [2024-10-11 01:52:10,200 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:52:10" (1/1) ... [2024-10-11 01:52:10,204 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:52:10" (1/1) ... [2024-10-11 01:52:10,212 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:52:10" (1/1) ... [2024-10-11 01:52:10,213 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:52:10" (1/1) ... [2024-10-11 01:52:10,214 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:52:10" (1/1) ... [2024-10-11 01:52:10,215 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 01:52:10,216 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 01:52:10,216 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 01:52:10,217 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 01:52:10,218 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:52:10" (1/1) ... [2024-10-11 01:52:10,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:52:10,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:52:10,254 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 01:52:10,261 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 01:52:10,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 01:52:10,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 01:52:10,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 01:52:10,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 01:52:10,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 01:52:10,311 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 01:52:10,381 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 01:52:10,383 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 01:52:10,523 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-10-11 01:52:10,523 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 01:52:10,554 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 01:52:10,554 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 01:52:10,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:52:10 BoogieIcfgContainer [2024-10-11 01:52:10,555 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 01:52:10,558 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 01:52:10,558 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 01:52:10,561 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 01:52:10,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:52:09" (1/3) ... [2024-10-11 01:52:10,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6483f484 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:52:10, skipping insertion in model container [2024-10-11 01:52:10,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:52:10" (2/3) ... [2024-10-11 01:52:10,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6483f484 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:52:10, skipping insertion in model container [2024-10-11 01:52:10,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:52:10" (3/3) ... [2024-10-11 01:52:10,565 INFO L112 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2024-10-11 01:52:10,580 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 01:52:10,580 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 01:52:10,636 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 01:52:10,642 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;@14c2a053, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 01:52:10,642 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 01:52:10,646 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 17 states have internal predecessors, (23), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 01:52:10,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 01:52:10,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:52:10,652 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:52:10,652 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:52:10,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:52:10,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1062398335, now seen corresponding path program 1 times [2024-10-11 01:52:10,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:52:10,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237561850] [2024-10-11 01:52:10,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:52:10,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:52:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:10,791 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 01:52:10,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:52:10,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237561850] [2024-10-11 01:52:10,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237561850] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:52:10,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:52:10,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 01:52:10,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528595913] [2024-10-11 01:52:10,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:52:10,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 01:52:10,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:52:10,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 01:52:10,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 01:52:10,821 INFO L87 Difference]: Start difference. First operand has 26 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 17 states have internal predecessors, (23), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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-11 01:52:10,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:52:10,852 INFO L93 Difference]: Finished difference Result 48 states and 79 transitions. [2024-10-11 01:52:10,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 01:52:10,854 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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-11 01:52:10,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:52:10,861 INFO L225 Difference]: With dead ends: 48 [2024-10-11 01:52:10,861 INFO L226 Difference]: Without dead ends: 23 [2024-10-11 01:52:10,864 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-11 01:52:10,867 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:52:10,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:52:10,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-11 01:52:10,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-11 01:52:10,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 15 states have internal predecessors, (16), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 01:52:10,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2024-10-11 01:52:10,898 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 9 [2024-10-11 01:52:10,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:52:10,898 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2024-10-11 01:52:10,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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-11 01:52:10,899 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2024-10-11 01:52:10,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 01:52:10,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:52:10,900 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:52:10,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 01:52:10,901 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:52:10,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:52:10,902 INFO L85 PathProgramCache]: Analyzing trace with hash -2013109713, now seen corresponding path program 1 times [2024-10-11 01:52:10,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:52:10,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582577584] [2024-10-11 01:52:10,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:52:10,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:52:10,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:11,129 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 01:52:11,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:52:11,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582577584] [2024-10-11 01:52:11,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582577584] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:52:11,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:52:11,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 01:52:11,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460179050] [2024-10-11 01:52:11,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:52:11,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 01:52:11,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:52:11,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 01:52:11,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 01:52:11,136 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-11 01:52:11,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:52:11,228 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2024-10-11 01:52:11,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 01:52:11,229 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 10 [2024-10-11 01:52:11,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:52:11,230 INFO L225 Difference]: With dead ends: 29 [2024-10-11 01:52:11,230 INFO L226 Difference]: Without dead ends: 27 [2024-10-11 01:52:11,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11 01:52:11,232 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:52:11,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 65 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:52:11,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-11 01:52:11,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-11 01:52:11,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 01:52:11,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2024-10-11 01:52:11,250 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2024-10-11 01:52:11,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:52:11,250 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2024-10-11 01:52:11,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-11 01:52:11,251 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2024-10-11 01:52:11,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 01:52:11,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:52:11,253 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:52:11,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 01:52:11,253 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:52:11,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:52:11,254 INFO L85 PathProgramCache]: Analyzing trace with hash -908723572, now seen corresponding path program 1 times [2024-10-11 01:52:11,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:52:11,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894465985] [2024-10-11 01:52:11,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:52:11,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:52:11,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:11,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 01:52:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:11,481 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-11 01:52:11,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:52:11,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894465985] [2024-10-11 01:52:11,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894465985] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:52:11,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:52:11,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 01:52:11,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670184617] [2024-10-11 01:52:11,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:52:11,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 01:52:11,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:52:11,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 01:52:11,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 01:52:11,490 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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-11 01:52:11,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:52:11,609 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2024-10-11 01:52:11,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 01:52:11,610 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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 15 [2024-10-11 01:52:11,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:52:11,612 INFO L225 Difference]: With dead ends: 42 [2024-10-11 01:52:11,614 INFO L226 Difference]: Without dead ends: 40 [2024-10-11 01:52:11,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 01:52:11,615 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 21 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:52:11,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 91 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:52:11,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-11 01:52:11,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2024-10-11 01:52:11,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 25 states have internal predecessors, (27), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 01:52:11,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2024-10-11 01:52:11,630 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 15 [2024-10-11 01:52:11,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:52:11,630 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2024-10-11 01:52:11,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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-11 01:52:11,631 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2024-10-11 01:52:11,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 01:52:11,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:52:11,633 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-11 01:52:11,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 01:52:11,634 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:52:11,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:52:11,635 INFO L85 PathProgramCache]: Analyzing trace with hash 2036104194, now seen corresponding path program 1 times [2024-10-11 01:52:11,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:52:11,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189633828] [2024-10-11 01:52:11,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:52:11,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:52:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:11,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:52:11,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:11,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 01:52:11,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:11,784 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-11 01:52:11,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:52:11,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189633828] [2024-10-11 01:52:11,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189633828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:52:11,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:52:11,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 01:52:11,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182261914] [2024-10-11 01:52:11,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:52:11,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 01:52:11,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:52:11,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 01:52:11,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 01:52:11,787 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 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-11 01:52:11,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:52:11,879 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2024-10-11 01:52:11,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 01:52:11,880 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 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-11 01:52:11,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:52:11,881 INFO L225 Difference]: With dead ends: 48 [2024-10-11 01:52:11,881 INFO L226 Difference]: Without dead ends: 46 [2024-10-11 01:52:11,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 01:52:11,883 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 12 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:52:11,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 172 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:52:11,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-11 01:52:11,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2024-10-11 01:52:11,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 25 states have (on average 1.2) internal successors, (30), 28 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 01:52:11,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2024-10-11 01:52:11,893 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 22 [2024-10-11 01:52:11,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:52:11,894 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2024-10-11 01:52:11,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 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-11 01:52:11,894 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2024-10-11 01:52:11,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 01:52:11,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:52:11,895 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:52:11,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 01:52:11,896 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:52:11,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:52:11,897 INFO L85 PathProgramCache]: Analyzing trace with hash -2030546205, now seen corresponding path program 1 times [2024-10-11 01:52:11,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:52:11,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687235725] [2024-10-11 01:52:11,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:52:11,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:52:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:12,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 01:52:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:12,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 01:52:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:12,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 01:52:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:12,040 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 01:52:12,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:52:12,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687235725] [2024-10-11 01:52:12,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687235725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:52:12,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:52:12,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 01:52:12,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595078772] [2024-10-11 01:52:12,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:52:12,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 01:52:12,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:52:12,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 01:52:12,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 01:52:12,044 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 01:52:12,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:52:12,198 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2024-10-11 01:52:12,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 01:52:12,199 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2024-10-11 01:52:12,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:52:12,200 INFO L225 Difference]: With dead ends: 67 [2024-10-11 01:52:12,200 INFO L226 Difference]: Without dead ends: 60 [2024-10-11 01:52:12,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 01:52:12,201 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 27 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:52:12,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 90 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:52:12,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-11 01:52:12,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2024-10-11 01:52:12,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 38 states have internal predecessors, (40), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 01:52:12,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2024-10-11 01:52:12,221 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 26 [2024-10-11 01:52:12,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:52:12,222 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2024-10-11 01:52:12,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 01:52:12,222 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2024-10-11 01:52:12,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 01:52:12,223 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:52:12,223 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:52:12,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 01:52:12,223 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:52:12,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:52:12,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1313350375, now seen corresponding path program 1 times [2024-10-11 01:52:12,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:52:12,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681918755] [2024-10-11 01:52:12,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:52:12,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:52:12,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:12,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:52:12,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:12,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 01:52:12,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:12,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 01:52:12,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:12,349 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 01:52:12,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:52:12,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681918755] [2024-10-11 01:52:12,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681918755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:52:12,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:52:12,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 01:52:12,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86007152] [2024-10-11 01:52:12,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:52:12,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 01:52:12,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:52:12,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 01:52:12,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 01:52:12,352 INFO L87 Difference]: Start difference. First operand 58 states and 71 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 01:52:12,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:52:12,454 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2024-10-11 01:52:12,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 01:52:12,456 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2024-10-11 01:52:12,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:52:12,457 INFO L225 Difference]: With dead ends: 68 [2024-10-11 01:52:12,458 INFO L226 Difference]: Without dead ends: 66 [2024-10-11 01:52:12,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-11 01:52:12,459 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 28 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:52:12,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 119 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:52:12,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-11 01:52:12,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2024-10-11 01:52:12,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.131578947368421) internal successors, (43), 41 states have internal predecessors, (43), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 01:52:12,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2024-10-11 01:52:12,476 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 27 [2024-10-11 01:52:12,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:52:12,476 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2024-10-11 01:52:12,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 01:52:12,476 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2024-10-11 01:52:12,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 01:52:12,480 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:52:12,480 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:52:12,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 01:52:12,480 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:52:12,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:52:12,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1160009689, now seen corresponding path program 1 times [2024-10-11 01:52:12,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:52:12,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942969756] [2024-10-11 01:52:12,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:52:12,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:52:12,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:12,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:52:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:12,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 01:52:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:12,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 01:52:12,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:12,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 01:52:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:12,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 01:52:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:12,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 01:52:12,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:12,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 01:52:12,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:12,722 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 01:52:12,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:52:12,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942969756] [2024-10-11 01:52:12,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942969756] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:52:12,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54335917] [2024-10-11 01:52:12,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:52:12,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:52:12,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:52:12,725 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 01:52:12,727 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 01:52:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:12,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 01:52:12,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:52:13,111 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 01:52:13,112 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:52:13,283 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 01:52:13,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54335917] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:52:13,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:52:13,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2024-10-11 01:52:13,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501596662] [2024-10-11 01:52:13,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:52:13,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 01:52:13,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:52:13,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 01:52:13,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2024-10-11 01:52:13,289 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. Second operand has 17 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 7 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2024-10-11 01:52:13,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:52:13,611 INFO L93 Difference]: Finished difference Result 99 states and 130 transitions. [2024-10-11 01:52:13,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 01:52:13,612 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 7 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) Word has length 50 [2024-10-11 01:52:13,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:52:13,614 INFO L225 Difference]: With dead ends: 99 [2024-10-11 01:52:13,615 INFO L226 Difference]: Without dead ends: 84 [2024-10-11 01:52:13,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 100 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2024-10-11 01:52:13,617 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 57 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 01:52:13,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 130 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 01:52:13,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-11 01:52:13,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2024-10-11 01:52:13,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 52 states have internal predecessors, (54), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 01:52:13,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2024-10-11 01:52:13,642 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 50 [2024-10-11 01:52:13,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:52:13,642 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2024-10-11 01:52:13,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 7 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2024-10-11 01:52:13,643 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2024-10-11 01:52:13,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 01:52:13,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:52:13,644 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:52:13,670 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 01:52:13,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:52:13,852 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:52:13,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:52:13,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1190365469, now seen corresponding path program 1 times [2024-10-11 01:52:13,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:52:13,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721953802] [2024-10-11 01:52:13,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:52:13,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:52:13,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:13,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:52:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:13,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 01:52:13,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:13,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 01:52:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:13,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 01:52:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:13,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 01:52:13,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:13,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 01:52:13,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:13,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 01:52:13,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:13,976 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 01:52:13,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:52:13,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721953802] [2024-10-11 01:52:13,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721953802] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:52:13,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968156360] [2024-10-11 01:52:13,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:52:13,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:52:13,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:52:13,986 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 01:52:13,988 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 01:52:14,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:14,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 01:52:14,041 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:52:14,219 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 01:52:14,219 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:52:14,330 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 01:52:14,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968156360] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:52:14,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:52:14,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-10-11 01:52:14,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467250663] [2024-10-11 01:52:14,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:52:14,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 01:52:14,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:52:14,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 01:52:14,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-10-11 01:52:14,332 INFO L87 Difference]: Start difference. First operand 82 states and 101 transitions. Second operand has 14 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2024-10-11 01:52:14,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:52:14,451 INFO L93 Difference]: Finished difference Result 88 states and 106 transitions. [2024-10-11 01:52:14,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 01:52:14,451 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) Word has length 51 [2024-10-11 01:52:14,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:52:14,453 INFO L225 Difference]: With dead ends: 88 [2024-10-11 01:52:14,453 INFO L226 Difference]: Without dead ends: 86 [2024-10-11 01:52:14,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 104 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2024-10-11 01:52:14,457 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 29 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:52:14,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 189 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:52:14,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-11 01:52:14,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-11 01:52:14,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 55 states have internal predecessors, (57), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 01:52:14,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 104 transitions. [2024-10-11 01:52:14,479 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 104 transitions. Word has length 51 [2024-10-11 01:52:14,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:52:14,479 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 104 transitions. [2024-10-11 01:52:14,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2024-10-11 01:52:14,480 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 104 transitions. [2024-10-11 01:52:14,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 01:52:14,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:52:14,485 INFO L215 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 01:52:14,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 01:52:14,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:52:14,686 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:52:14,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:52:14,686 INFO L85 PathProgramCache]: Analyzing trace with hash 813879981, now seen corresponding path program 2 times [2024-10-11 01:52:14,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:52:14,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744124149] [2024-10-11 01:52:14,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:52:14,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:52:14,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:14,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:52:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:14,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 01:52:14,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:14,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 01:52:14,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:14,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 01:52:14,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:14,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 01:52:14,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:14,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 01:52:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:14,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 01:52:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:14,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 01:52:14,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:14,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 01:52:14,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:14,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 01:52:14,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:14,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 01:52:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:14,930 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 48 proven. 28 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-11 01:52:14,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:52:14,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744124149] [2024-10-11 01:52:14,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744124149] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:52:14,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326656087] [2024-10-11 01:52:14,932 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 01:52:14,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:52:14,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:52:14,934 INFO L229 MonitoredProcess]: Starting monitored process 4 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 01:52:14,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 01:52:14,989 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 01:52:14,990 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 01:52:14,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 01:52:14,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:52:15,241 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 22 proven. 24 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 01:52:15,242 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:52:15,416 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 22 proven. 24 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 01:52:15,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326656087] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:52:15,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:52:15,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2024-10-11 01:52:15,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603556600] [2024-10-11 01:52:15,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:52:15,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 01:52:15,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:52:15,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 01:52:15,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2024-10-11 01:52:15,421 INFO L87 Difference]: Start difference. First operand 86 states and 104 transitions. Second operand has 21 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 11 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2024-10-11 01:52:15,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:52:15,797 INFO L93 Difference]: Finished difference Result 96 states and 114 transitions. [2024-10-11 01:52:15,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 01:52:15,798 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 11 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) Word has length 75 [2024-10-11 01:52:15,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:52:15,799 INFO L225 Difference]: With dead ends: 96 [2024-10-11 01:52:15,800 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 01:52:15,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 158 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=177, Invalid=693, Unknown=0, NotChecked=0, Total=870 [2024-10-11 01:52:15,801 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 59 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 01:52:15,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 167 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 01:52:15,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 01:52:15,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2024-10-11 01:52:15,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 58 states have internal predecessors, (60), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 01:52:15,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 107 transitions. [2024-10-11 01:52:15,824 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 107 transitions. Word has length 75 [2024-10-11 01:52:15,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:52:15,824 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 107 transitions. [2024-10-11 01:52:15,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 11 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2024-10-11 01:52:15,825 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 107 transitions. [2024-10-11 01:52:15,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 01:52:15,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:52:15,829 INFO L215 NwaCegarLoop]: trace histogram [16, 15, 15, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:52:15,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 01:52:16,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:52:16,030 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:52:16,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:52:16,031 INFO L85 PathProgramCache]: Analyzing trace with hash -239313979, now seen corresponding path program 2 times [2024-10-11 01:52:16,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:52:16,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817177298] [2024-10-11 01:52:16,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:52:16,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:52:16,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:16,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:52:16,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:16,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 01:52:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:16,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 01:52:16,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:16,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 01:52:16,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:16,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 01:52:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:16,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 01:52:16,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:16,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 01:52:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:16,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 01:52:16,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:16,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 01:52:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:16,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 01:52:16,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:16,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 01:52:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:16,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 01:52:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:16,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 01:52:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:16,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 01:52:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:16,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 01:52:16,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:16,392 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 56 proven. 46 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-11 01:52:16,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:52:16,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817177298] [2024-10-11 01:52:16,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817177298] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:52:16,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177163267] [2024-10-11 01:52:16,392 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 01:52:16,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:52:16,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:52:16,394 INFO L229 MonitoredProcess]: Starting monitored process 5 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 01:52:16,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 01:52:16,464 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 01:52:16,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 01:52:16,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 01:52:16,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:52:16,622 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 64 proven. 67 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2024-10-11 01:52:16,623 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:52:16,816 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 71 proven. 60 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2024-10-11 01:52:16,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177163267] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:52:16,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:52:16,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 20 [2024-10-11 01:52:16,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910926599] [2024-10-11 01:52:16,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:52:16,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 01:52:16,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:52:16,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 01:52:16,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2024-10-11 01:52:16,819 INFO L87 Difference]: Start difference. First operand 90 states and 107 transitions. Second operand has 20 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 10 states have call predecessors, (25), 11 states have call successors, (25) [2024-10-11 01:52:17,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:52:17,174 INFO L93 Difference]: Finished difference Result 101 states and 122 transitions. [2024-10-11 01:52:17,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 01:52:17,175 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 10 states have call predecessors, (25), 11 states have call successors, (25) Word has length 98 [2024-10-11 01:52:17,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:52:17,176 INFO L225 Difference]: With dead ends: 101 [2024-10-11 01:52:17,176 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 01:52:17,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 216 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2024-10-11 01:52:17,178 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 13 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 01:52:17,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 306 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 01:52:17,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 01:52:17,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 01:52:17,179 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-11 01:52:17,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 01:52:17,179 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 98 [2024-10-11 01:52:17,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:52:17,179 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 01:52:17,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 10 states have call predecessors, (25), 11 states have call successors, (25) [2024-10-11 01:52:17,180 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 01:52:17,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 01:52:17,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 01:52:17,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 01:52:17,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 01:52:17,386 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 01:52:17,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 01:52:18,091 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 01:52:18,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:52:18 BoogieIcfgContainer [2024-10-11 01:52:18,109 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 01:52:18,109 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 01:52:18,109 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 01:52:18,109 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 01:52:18,110 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:52:10" (3/4) ... [2024-10-11 01:52:18,112 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 01:52:18,115 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-11 01:52:18,119 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-11 01:52:18,119 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 01:52:18,119 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 01:52:18,119 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 01:52:18,208 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 01:52:18,209 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 01:52:18,209 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 01:52:18,209 INFO L158 Benchmark]: Toolchain (without parser) took 8396.28ms. Allocated memory was 119.5MB in the beginning and 211.8MB in the end (delta: 92.3MB). Free memory was 50.6MB in the beginning and 106.5MB in the end (delta: -55.9MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. [2024-10-11 01:52:18,210 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 119.5MB. Free memory is still 78.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 01:52:18,210 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.30ms. Allocated memory was 119.5MB in the beginning and 146.8MB in the end (delta: 27.3MB). Free memory was 50.3MB in the beginning and 115.6MB in the end (delta: -65.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 01:52:18,210 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.25ms. Allocated memory is still 146.8MB. Free memory was 115.6MB in the beginning and 113.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 01:52:18,210 INFO L158 Benchmark]: Boogie Preprocessor took 53.02ms. Allocated memory is still 146.8MB. Free memory was 113.5MB in the beginning and 112.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 01:52:18,211 INFO L158 Benchmark]: RCFGBuilder took 338.68ms. Allocated memory is still 146.8MB. Free memory was 112.3MB in the beginning and 99.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 01:52:18,211 INFO L158 Benchmark]: TraceAbstraction took 7551.09ms. Allocated memory was 146.8MB in the beginning and 211.8MB in the end (delta: 65.0MB). Free memory was 98.8MB in the beginning and 110.7MB in the end (delta: -11.9MB). Peak memory consumption was 82.9MB. Max. memory is 16.1GB. [2024-10-11 01:52:18,211 INFO L158 Benchmark]: Witness Printer took 99.85ms. Allocated memory is still 211.8MB. Free memory was 110.7MB in the beginning and 106.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 01:52:18,213 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.16ms. Allocated memory is still 119.5MB. Free memory is still 78.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 311.30ms. Allocated memory was 119.5MB in the beginning and 146.8MB in the end (delta: 27.3MB). Free memory was 50.3MB in the beginning and 115.6MB in the end (delta: -65.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.25ms. Allocated memory is still 146.8MB. Free memory was 115.6MB in the beginning and 113.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.02ms. Allocated memory is still 146.8MB. Free memory was 113.5MB in the beginning and 112.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 338.68ms. Allocated memory is still 146.8MB. Free memory was 112.3MB in the beginning and 99.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7551.09ms. Allocated memory was 146.8MB in the beginning and 211.8MB in the end (delta: 65.0MB). Free memory was 98.8MB in the beginning and 110.7MB in the end (delta: -11.9MB). Peak memory consumption was 82.9MB. Max. memory is 16.1GB. * Witness Printer took 99.85ms. Allocated memory is still 211.8MB. Free memory was 110.7MB in the beginning and 106.5MB in the end (delta: 4.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: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.8s, OverallIterations: 10, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 306 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 252 mSDsluCounter, 1362 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1101 mSDsCounter, 225 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1049 IncrementalHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 225 mSolverCounterUnsat, 261 mSDtfsCounter, 1049 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 748 GetRequests, 608 SyntacticMatches, 18 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=9, InterpolantAutomatonStates: 85, 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, 10 MinimizatonAttempts, 18 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 657 NumberOfCodeBlocks, 657 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 913 ConstructedInterpolants, 0 QuantifiedInterpolants, 2953 SizeOfPredicates, 14 NumberOfNonLiveVariables, 600 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 2623/2902 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: 37]: Loop Invariant Derived loop invariant: ((((((buf == 0) && (bufferlen == ((long long) 2 + buflim))) && (0 <= buflim)) && (((long long) 3 + buflim) <= inlen)) && (in == 0)) || ((((((((long long) bufferlen + in) + 1) <= ((long long) buf + inlen)) && (bufferlen == ((long long) 2 + buflim))) && (1 <= in)) && (buf <= buflim)) && (0 <= buf))) - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (cond != 0) Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-10-11 01:52:18,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE