./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_vlunc.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_vlunc.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f9c847a826e86c06ca90730b1e3bd09118dbfcc8c7c9aa6dc001687e12e32563 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 00:54:46,671 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 00:54:46,753 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-12 00:54:46,759 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 00:54:46,761 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 00:54:46,788 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 00:54:46,790 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 00:54:46,791 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 00:54:46,792 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 00:54:46,793 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 00:54:46,794 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 00:54:46,794 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 00:54:46,795 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 00:54:46,796 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 00:54:46,797 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 00:54:46,797 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 00:54:46,797 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 00:54:46,798 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 00:54:46,798 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 00:54:46,798 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 00:54:46,798 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 00:54:46,801 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 00:54:46,801 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 00:54:46,801 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 00:54:46,802 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 00:54:46,802 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 00:54:46,802 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 00:54:46,802 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 00:54:46,803 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 00:54:46,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:54:46,803 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 00:54:46,803 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 00:54:46,803 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 00:54:46,804 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 00:54:46,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 00:54:46,805 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 00:54:46,805 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 00:54:46,806 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 00:54:46,806 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 00:54:46,807 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f9c847a826e86c06ca90730b1e3bd09118dbfcc8c7c9aa6dc001687e12e32563 [2024-11-12 00:54:47,079 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 00:54:47,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 00:54:47,102 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 00:54:47,104 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 00:54:47,104 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 00:54:47,105 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_vlunc.c [2024-11-12 00:54:48,599 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 00:54:48,799 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 00:54:48,799 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_vlunc.c [2024-11-12 00:54:48,810 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b61e763dd/e4c3f8375d924424a4912a489a0412eb/FLAG789f401f7 [2024-11-12 00:54:49,175 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b61e763dd/e4c3f8375d924424a4912a489a0412eb [2024-11-12 00:54:49,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 00:54:49,180 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 00:54:49,183 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 00:54:49,185 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 00:54:49,190 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 00:54:49,191 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:54:49" (1/1) ... [2024-11-12 00:54:49,192 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25833d90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:49, skipping insertion in model container [2024-11-12 00:54:49,192 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:54:49" (1/1) ... [2024-11-12 00:54:49,223 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 00:54:49,425 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_vlunc.c[1255,1268] [2024-11-12 00:54:49,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:54:49,544 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 00:54:49,558 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_vlunc.c[1255,1268] [2024-11-12 00:54:49,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:54:49,651 INFO L204 MainTranslator]: Completed translation [2024-11-12 00:54:49,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:49 WrapperNode [2024-11-12 00:54:49,652 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 00:54:49,653 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 00:54:49,654 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 00:54:49,654 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 00:54:49,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:49" (1/1) ... [2024-11-12 00:54:49,679 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:49" (1/1) ... [2024-11-12 00:54:49,755 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 517 [2024-11-12 00:54:49,756 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 00:54:49,757 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 00:54:49,757 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 00:54:49,757 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 00:54:49,768 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:49" (1/1) ... [2024-11-12 00:54:49,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:49" (1/1) ... [2024-11-12 00:54:49,788 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:49" (1/1) ... [2024-11-12 00:54:49,832 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-11-12 00:54:49,836 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:49" (1/1) ... [2024-11-12 00:54:49,837 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:49" (1/1) ... [2024-11-12 00:54:49,864 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:49" (1/1) ... [2024-11-12 00:54:49,877 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:49" (1/1) ... [2024-11-12 00:54:49,887 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:49" (1/1) ... [2024-11-12 00:54:49,899 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:49" (1/1) ... [2024-11-12 00:54:49,919 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 00:54:49,922 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 00:54:49,922 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 00:54:49,922 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 00:54:49,923 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:49" (1/1) ... [2024-11-12 00:54:49,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:54:49,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 00:54:49,955 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 00:54:49,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 00:54:50,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 00:54:50,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 00:54:50,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 00:54:50,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 00:54:50,124 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 00:54:50,126 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 00:54:50,919 INFO L? ?]: Removed 314 outVars from TransFormulas that were not future-live. [2024-11-12 00:54:50,919 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 00:54:50,934 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 00:54:50,936 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 00:54:50,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:54:50 BoogieIcfgContainer [2024-11-12 00:54:50,937 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 00:54:50,964 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 00:54:50,965 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 00:54:50,970 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 00:54:50,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:54:49" (1/3) ... [2024-11-12 00:54:50,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a87c87d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:54:50, skipping insertion in model container [2024-11-12 00:54:50,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:49" (2/3) ... [2024-11-12 00:54:50,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a87c87d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:54:50, skipping insertion in model container [2024-11-12 00:54:50,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:54:50" (3/3) ... [2024-11-12 00:54:50,973 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_vlunc.c [2024-11-12 00:54:50,988 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 00:54:50,988 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 00:54:51,047 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 00:54:51,052 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;@12b635d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 00:54:51,052 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 00:54:51,056 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 128 states have (on average 1.4921875) internal successors, (191), 129 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:51,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-12 00:54:51,064 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:54:51,065 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:54:51,065 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:54:51,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:54:51,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1161288925, now seen corresponding path program 1 times [2024-11-12 00:54:51,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:54:51,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116128529] [2024-11-12 00:54:51,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:54:51,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:54:51,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:54:51,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:54:51,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:54:51,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116128529] [2024-11-12 00:54:51,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116128529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:54:51,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:54:51,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:54:51,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161650704] [2024-11-12 00:54:51,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:54:51,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:54:51,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:54:51,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:54:51,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:54:51,810 INFO L87 Difference]: Start difference. First operand has 130 states, 128 states have (on average 1.4921875) internal successors, (191), 129 states have internal predecessors, (191), 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) Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:51,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:54:51,866 INFO L93 Difference]: Finished difference Result 233 states and 345 transitions. [2024-11-12 00:54:51,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:54:51,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-11-12 00:54:51,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:54:51,877 INFO L225 Difference]: With dead ends: 233 [2024-11-12 00:54:51,877 INFO L226 Difference]: Without dead ends: 129 [2024-11-12 00:54:51,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:54:51,882 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 0 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:54:51,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 549 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:54:51,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-12 00:54:51,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-11-12 00:54:51,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.4765625) internal successors, (189), 128 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:51,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 189 transitions. [2024-11-12 00:54:51,924 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 189 transitions. Word has length 45 [2024-11-12 00:54:51,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:54:51,925 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 189 transitions. [2024-11-12 00:54:51,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:51,925 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 189 transitions. [2024-11-12 00:54:51,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-12 00:54:51,927 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:54:51,927 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:54:51,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 00:54:51,927 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:54:51,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:54:51,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1638522894, now seen corresponding path program 1 times [2024-11-12 00:54:51,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:54:51,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027625329] [2024-11-12 00:54:51,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:54:51,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:54:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:54:52,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:54:52,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:54:52,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027625329] [2024-11-12 00:54:52,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027625329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:54:52,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:54:52,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:54:52,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467721525] [2024-11-12 00:54:52,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:54:52,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:54:52,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:54:52,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:54:52,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:54:52,153 INFO L87 Difference]: Start difference. First operand 129 states and 189 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:52,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:54:52,199 INFO L93 Difference]: Finished difference Result 234 states and 343 transitions. [2024-11-12 00:54:52,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:54:52,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-11-12 00:54:52,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:54:52,202 INFO L225 Difference]: With dead ends: 234 [2024-11-12 00:54:52,202 INFO L226 Difference]: Without dead ends: 131 [2024-11-12 00:54:52,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:54:52,204 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 0 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:54:52,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 545 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:54:52,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-12 00:54:52,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-11-12 00:54:52,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.4692307692307693) internal successors, (191), 130 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:52,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 191 transitions. [2024-11-12 00:54:52,215 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 191 transitions. Word has length 46 [2024-11-12 00:54:52,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:54:52,215 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 191 transitions. [2024-11-12 00:54:52,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:52,216 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 191 transitions. [2024-11-12 00:54:52,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-12 00:54:52,217 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:54:52,217 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:54:52,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 00:54:52,218 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:54:52,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:54:52,218 INFO L85 PathProgramCache]: Analyzing trace with hash -352567844, now seen corresponding path program 1 times [2024-11-12 00:54:52,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:54:52,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757384324] [2024-11-12 00:54:52,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:54:52,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:54:52,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:54:52,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:54:52,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:54:52,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757384324] [2024-11-12 00:54:52,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757384324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:54:52,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:54:52,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 00:54:52,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399778942] [2024-11-12 00:54:52,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:54:52,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 00:54:52,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:54:52,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 00:54:52,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:54:52,626 INFO L87 Difference]: Start difference. First operand 131 states and 191 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:52,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:54:52,691 INFO L93 Difference]: Finished difference Result 241 states and 352 transitions. [2024-11-12 00:54:52,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 00:54:52,692 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-12 00:54:52,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:54:52,694 INFO L225 Difference]: With dead ends: 241 [2024-11-12 00:54:52,694 INFO L226 Difference]: Without dead ends: 136 [2024-11-12 00:54:52,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:54:52,696 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 1 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:54:52,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 889 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:54:52,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-12 00:54:52,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-12 00:54:52,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.4592592592592593) internal successors, (197), 135 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:52,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 197 transitions. [2024-11-12 00:54:52,705 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 197 transitions. Word has length 47 [2024-11-12 00:54:52,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:54:52,705 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 197 transitions. [2024-11-12 00:54:52,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:52,706 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 197 transitions. [2024-11-12 00:54:52,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-12 00:54:52,707 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:54:52,707 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:54:52,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 00:54:52,708 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:54:52,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:54:52,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1430781511, now seen corresponding path program 1 times [2024-11-12 00:54:52,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:54:52,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658328132] [2024-11-12 00:54:52,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:54:52,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:54:52,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:54:52,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:54:52,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:54:52,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658328132] [2024-11-12 00:54:52,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658328132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:54:52,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:54:52,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 00:54:52,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052796664] [2024-11-12 00:54:52,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:54:52,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 00:54:52,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:54:52,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 00:54:52,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:54:52,938 INFO L87 Difference]: Start difference. First operand 136 states and 197 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:53,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:54:53,007 INFO L93 Difference]: Finished difference Result 257 states and 373 transitions. [2024-11-12 00:54:53,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 00:54:53,008 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-12 00:54:53,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:54:53,009 INFO L225 Difference]: With dead ends: 257 [2024-11-12 00:54:53,009 INFO L226 Difference]: Without dead ends: 147 [2024-11-12 00:54:53,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:54:53,011 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 5 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:54:53,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1063 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:54:53,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-12 00:54:53,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-11-12 00:54:53,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 1.4452054794520548) internal successors, (211), 146 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:53,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 211 transitions. [2024-11-12 00:54:53,031 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 211 transitions. Word has length 48 [2024-11-12 00:54:53,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:54:53,032 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 211 transitions. [2024-11-12 00:54:53,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:53,032 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 211 transitions. [2024-11-12 00:54:53,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-12 00:54:53,033 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:54:53,033 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:54:53,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 00:54:53,033 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:54:53,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:54:53,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1285611392, now seen corresponding path program 1 times [2024-11-12 00:54:53,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:54:53,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843072812] [2024-11-12 00:54:53,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:54:53,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:54:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:54:53,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:54:53,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:54:53,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843072812] [2024-11-12 00:54:53,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843072812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:54:53,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:54:53,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:54:53,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369026807] [2024-11-12 00:54:53,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:54:53,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:54:53,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:54:53,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:54:53,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:54:53,188 INFO L87 Difference]: Start difference. First operand 147 states and 211 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:53,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:54:53,265 INFO L93 Difference]: Finished difference Result 363 states and 519 transitions. [2024-11-12 00:54:53,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:54:53,266 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-12 00:54:53,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:54:53,268 INFO L225 Difference]: With dead ends: 363 [2024-11-12 00:54:53,270 INFO L226 Difference]: Without dead ends: 242 [2024-11-12 00:54:53,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:54:53,272 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 391 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:54:53,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 528 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:54:53,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-12 00:54:53,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 194. [2024-11-12 00:54:53,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.4455958549222798) internal successors, (279), 193 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:53,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 279 transitions. [2024-11-12 00:54:53,288 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 279 transitions. Word has length 48 [2024-11-12 00:54:53,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:54:53,288 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 279 transitions. [2024-11-12 00:54:53,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:53,289 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 279 transitions. [2024-11-12 00:54:53,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-12 00:54:53,290 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:54:53,290 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:54:53,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 00:54:53,290 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:54:53,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:54:53,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1420291833, now seen corresponding path program 1 times [2024-11-12 00:54:53,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:54:53,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035512282] [2024-11-12 00:54:53,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:54:53,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:54:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:54:53,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:54:53,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:54:53,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035512282] [2024-11-12 00:54:53,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035512282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:54:53,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:54:53,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:54:53,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923177198] [2024-11-12 00:54:53,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:54:53,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:54:53,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:54:53,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:54:53,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:54:53,423 INFO L87 Difference]: Start difference. First operand 194 states and 279 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:53,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:54:53,487 INFO L93 Difference]: Finished difference Result 357 states and 507 transitions. [2024-11-12 00:54:53,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:54:53,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-12 00:54:53,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:54:53,489 INFO L225 Difference]: With dead ends: 357 [2024-11-12 00:54:53,489 INFO L226 Difference]: Without dead ends: 228 [2024-11-12 00:54:53,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:54:53,490 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 359 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:54:53,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 528 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:54:53,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-12 00:54:53,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 188. [2024-11-12 00:54:53,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.4385026737967914) internal successors, (269), 187 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:53,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 269 transitions. [2024-11-12 00:54:53,499 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 269 transitions. Word has length 49 [2024-11-12 00:54:53,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:54:53,499 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 269 transitions. [2024-11-12 00:54:53,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:53,499 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 269 transitions. [2024-11-12 00:54:53,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-12 00:54:53,500 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:54:53,501 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:54:53,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 00:54:53,501 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:54:53,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:54:53,502 INFO L85 PathProgramCache]: Analyzing trace with hash -559412370, now seen corresponding path program 1 times [2024-11-12 00:54:53,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:54:53,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508498614] [2024-11-12 00:54:53,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:54:53,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:54:53,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:54:53,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:54:53,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:54:53,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508498614] [2024-11-12 00:54:53,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508498614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:54:53,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:54:53,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 00:54:53,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665725331] [2024-11-12 00:54:53,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:54:53,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 00:54:53,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:54:53,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 00:54:53,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:54:53,695 INFO L87 Difference]: Start difference. First operand 188 states and 269 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:53,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:54:53,760 INFO L93 Difference]: Finished difference Result 337 states and 480 transitions. [2024-11-12 00:54:53,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 00:54:53,761 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-12 00:54:53,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:54:53,762 INFO L225 Difference]: With dead ends: 337 [2024-11-12 00:54:53,762 INFO L226 Difference]: Without dead ends: 206 [2024-11-12 00:54:53,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:54:53,763 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 5 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:54:53,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1063 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:54:53,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-12 00:54:53,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2024-11-12 00:54:53,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.4195121951219511) internal successors, (291), 205 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:53,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 291 transitions. [2024-11-12 00:54:53,783 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 291 transitions. Word has length 49 [2024-11-12 00:54:53,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:54:53,784 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 291 transitions. [2024-11-12 00:54:53,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:53,784 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 291 transitions. [2024-11-12 00:54:53,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-12 00:54:53,785 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:54:53,785 INFO L218 NwaCegarLoop]: trace histogram [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, 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-11-12 00:54:53,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 00:54:53,786 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:54:53,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:54:53,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1444590169, now seen corresponding path program 1 times [2024-11-12 00:54:53,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:54:53,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761010113] [2024-11-12 00:54:53,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:54:53,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:54:53,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:54:54,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:54:54,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:54:54,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761010113] [2024-11-12 00:54:54,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761010113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:54:54,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:54:54,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 00:54:54,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29994643] [2024-11-12 00:54:54,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:54:54,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 00:54:54,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:54:54,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 00:54:54,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:54:54,003 INFO L87 Difference]: Start difference. First operand 206 states and 291 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:54,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:54:54,060 INFO L93 Difference]: Finished difference Result 385 states and 543 transitions. [2024-11-12 00:54:54,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 00:54:54,060 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-12 00:54:54,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:54:54,061 INFO L225 Difference]: With dead ends: 385 [2024-11-12 00:54:54,061 INFO L226 Difference]: Without dead ends: 228 [2024-11-12 00:54:54,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:54:54,062 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 5 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:54:54,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1063 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:54:54,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-12 00:54:54,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2024-11-12 00:54:54,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.4052863436123348) internal successors, (319), 227 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:54,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 319 transitions. [2024-11-12 00:54:54,076 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 319 transitions. Word has length 50 [2024-11-12 00:54:54,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:54:54,078 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 319 transitions. [2024-11-12 00:54:54,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:54,079 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 319 transitions. [2024-11-12 00:54:54,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-12 00:54:54,079 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:54:54,080 INFO L218 NwaCegarLoop]: trace histogram [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, 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-11-12 00:54:54,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 00:54:54,080 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:54:54,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:54:54,080 INFO L85 PathProgramCache]: Analyzing trace with hash -662315090, now seen corresponding path program 1 times [2024-11-12 00:54:54,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:54:54,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988459056] [2024-11-12 00:54:54,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:54:54,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:54:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:54:54,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:54:54,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:54:54,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988459056] [2024-11-12 00:54:54,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988459056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:54:54,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:54:54,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:54:54,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987898191] [2024-11-12 00:54:54,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:54:54,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:54:54,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:54:54,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:54:54,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:54:54,241 INFO L87 Difference]: Start difference. First operand 228 states and 319 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:54,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:54:54,301 INFO L93 Difference]: Finished difference Result 428 states and 595 transitions. [2024-11-12 00:54:54,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:54:54,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-12 00:54:54,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:54:54,306 INFO L225 Difference]: With dead ends: 428 [2024-11-12 00:54:54,306 INFO L226 Difference]: Without dead ends: 266 [2024-11-12 00:54:54,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:54:54,307 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 375 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:54:54,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 528 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:54:54,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-12 00:54:54,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 218. [2024-11-12 00:54:54,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 1.3963133640552996) internal successors, (303), 217 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:54,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 303 transitions. [2024-11-12 00:54:54,319 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 303 transitions. Word has length 50 [2024-11-12 00:54:54,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:54:54,319 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 303 transitions. [2024-11-12 00:54:54,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:54,320 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 303 transitions. [2024-11-12 00:54:54,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-12 00:54:54,320 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:54:54,321 INFO L218 NwaCegarLoop]: trace histogram [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, 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-11-12 00:54:54,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 00:54:54,321 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:54:54,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:54:54,321 INFO L85 PathProgramCache]: Analyzing trace with hash -75276800, now seen corresponding path program 1 times [2024-11-12 00:54:54,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:54:54,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419175350] [2024-11-12 00:54:54,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:54:54,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:54:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:54:54,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:54:54,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:54:54,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419175350] [2024-11-12 00:54:54,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419175350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:54:54,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:54:54,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 00:54:54,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91579058] [2024-11-12 00:54:54,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:54:54,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 00:54:54,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:54:54,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 00:54:54,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:54:54,482 INFO L87 Difference]: Start difference. First operand 218 states and 303 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:54,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:54:54,534 INFO L93 Difference]: Finished difference Result 417 states and 579 transitions. [2024-11-12 00:54:54,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 00:54:54,535 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-12 00:54:54,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:54:54,536 INFO L225 Difference]: With dead ends: 417 [2024-11-12 00:54:54,536 INFO L226 Difference]: Without dead ends: 240 [2024-11-12 00:54:54,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:54:54,537 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 5 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:54:54,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1063 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:54:54,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-12 00:54:54,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2024-11-12 00:54:54,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 239 states have (on average 1.3849372384937237) internal successors, (331), 239 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:54,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 331 transitions. [2024-11-12 00:54:54,545 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 331 transitions. Word has length 51 [2024-11-12 00:54:54,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:54:54,545 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 331 transitions. [2024-11-12 00:54:54,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:54,546 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 331 transitions. [2024-11-12 00:54:54,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-12 00:54:54,547 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:54:54,547 INFO L218 NwaCegarLoop]: trace histogram [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, 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-11-12 00:54:54,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 00:54:54,547 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:54:54,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:54:54,548 INFO L85 PathProgramCache]: Analyzing trace with hash 543160409, now seen corresponding path program 1 times [2024-11-12 00:54:54,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:54:54,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871270695] [2024-11-12 00:54:54,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:54:54,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:54:54,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:54:54,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:54:54,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:54:54,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871270695] [2024-11-12 00:54:54,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871270695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:54:54,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:54:54,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:54:54,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828249050] [2024-11-12 00:54:54,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:54:54,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:54:54,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:54:54,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:54:54,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:54:54,687 INFO L87 Difference]: Start difference. First operand 240 states and 331 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:54,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:54:54,745 INFO L93 Difference]: Finished difference Result 444 states and 607 transitions. [2024-11-12 00:54:54,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:54:54,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-12 00:54:54,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:54:54,747 INFO L225 Difference]: With dead ends: 444 [2024-11-12 00:54:54,747 INFO L226 Difference]: Without dead ends: 262 [2024-11-12 00:54:54,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:54:54,748 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 319 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:54:54,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 528 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:54:54,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-12 00:54:54,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 230. [2024-11-12 00:54:54,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.3755458515283843) internal successors, (315), 229 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:54,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 315 transitions. [2024-11-12 00:54:54,755 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 315 transitions. Word has length 51 [2024-11-12 00:54:54,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:54:54,755 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 315 transitions. [2024-11-12 00:54:54,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:54,755 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 315 transitions. [2024-11-12 00:54:54,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-12 00:54:54,756 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:54:54,756 INFO L218 NwaCegarLoop]: trace histogram [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, 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-11-12 00:54:54,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 00:54:54,757 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:54:54,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:54:54,757 INFO L85 PathProgramCache]: Analyzing trace with hash -131357547, now seen corresponding path program 1 times [2024-11-12 00:54:54,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:54:54,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412429273] [2024-11-12 00:54:54,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:54:54,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:54:54,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:54:54,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:54:54,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:54:54,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412429273] [2024-11-12 00:54:54,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412429273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:54:54,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:54:54,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:54:54,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440060303] [2024-11-12 00:54:54,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:54:54,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:54:54,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:54:54,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:54:54,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:54:54,876 INFO L87 Difference]: Start difference. First operand 230 states and 315 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:54,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:54:54,902 INFO L93 Difference]: Finished difference Result 430 states and 588 transitions. [2024-11-12 00:54:54,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:54:54,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-12 00:54:54,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:54:54,903 INFO L225 Difference]: With dead ends: 430 [2024-11-12 00:54:54,903 INFO L226 Difference]: Without dead ends: 246 [2024-11-12 00:54:54,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:54:54,904 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 4 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:54:54,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 725 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:54:54,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-12 00:54:54,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2024-11-12 00:54:54,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 1.3673469387755102) internal successors, (335), 245 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:54,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 335 transitions. [2024-11-12 00:54:54,911 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 335 transitions. Word has length 52 [2024-11-12 00:54:54,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:54:54,912 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 335 transitions. [2024-11-12 00:54:54,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:54,913 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 335 transitions. [2024-11-12 00:54:54,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-12 00:54:54,913 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:54:54,913 INFO L218 NwaCegarLoop]: trace histogram [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, 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-11-12 00:54:54,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 00:54:54,914 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:54:54,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:54:54,914 INFO L85 PathProgramCache]: Analyzing trace with hash -553739812, now seen corresponding path program 1 times [2024-11-12 00:54:54,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:54:54,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499441224] [2024-11-12 00:54:54,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:54:54,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:54:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:54:55,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:54:55,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:54:55,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499441224] [2024-11-12 00:54:55,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499441224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:54:55,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:54:55,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:54:55,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256144127] [2024-11-12 00:54:55,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:54:55,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:54:55,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:54:55,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:54:55,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:54:55,036 INFO L87 Difference]: Start difference. First operand 246 states and 335 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:55,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:54:55,095 INFO L93 Difference]: Finished difference Result 467 states and 631 transitions. [2024-11-12 00:54:55,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:54:55,096 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-12 00:54:55,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:54:55,097 INFO L225 Difference]: With dead ends: 467 [2024-11-12 00:54:55,097 INFO L226 Difference]: Without dead ends: 268 [2024-11-12 00:54:55,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:54:55,099 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 311 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:54:55,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 528 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:54:55,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-12 00:54:55,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 236. [2024-11-12 00:54:55,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 1.3574468085106384) internal successors, (319), 235 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:55,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 319 transitions. [2024-11-12 00:54:55,106 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 319 transitions. Word has length 52 [2024-11-12 00:54:55,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:54:55,106 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 319 transitions. [2024-11-12 00:54:55,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:55,107 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 319 transitions. [2024-11-12 00:54:55,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-12 00:54:55,107 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:54:55,107 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1] [2024-11-12 00:54:55,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 00:54:55,108 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:54:55,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:54:55,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1014688366, now seen corresponding path program 1 times [2024-11-12 00:54:55,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:54:55,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767906352] [2024-11-12 00:54:55,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:54:55,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:54:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:54:55,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:54:55,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:54:55,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767906352] [2024-11-12 00:54:55,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767906352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:54:55,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:54:55,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:54:55,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339804306] [2024-11-12 00:54:55,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:54:55,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:54:55,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:54:55,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:54:55,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:54:55,238 INFO L87 Difference]: Start difference. First operand 236 states and 319 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:55,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:54:55,294 INFO L93 Difference]: Finished difference Result 437 states and 591 transitions. [2024-11-12 00:54:55,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:54:55,294 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-12 00:54:55,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:54:55,295 INFO L225 Difference]: With dead ends: 437 [2024-11-12 00:54:55,295 INFO L226 Difference]: Without dead ends: 237 [2024-11-12 00:54:55,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:54:55,296 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 289 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:54:55,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 528 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:54:55,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-12 00:54:55,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 212. [2024-11-12 00:54:55,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 1.3696682464454977) internal successors, (289), 211 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:55,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 289 transitions. [2024-11-12 00:54:55,301 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 289 transitions. Word has length 53 [2024-11-12 00:54:55,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:54:55,302 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 289 transitions. [2024-11-12 00:54:55,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:54:55,302 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 289 transitions. [2024-11-12 00:54:55,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-12 00:54:55,302 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:54:55,303 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:54:55,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 00:54:55,303 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:54:55,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:54:55,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1013570968, now seen corresponding path program 1 times [2024-11-12 00:54:55,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:54:55,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280302573] [2024-11-12 00:54:55,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:54:55,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:54:55,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:54:57,345 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:54:57,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:54:57,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280302573] [2024-11-12 00:54:57,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280302573] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 00:54:57,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951633528] [2024-11-12 00:54:57,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:54:57,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 00:54:57,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 00:54:57,348 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 00:54:57,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 00:54:57,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:54:57,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 152 conjuncts are in the unsatisfiable core [2024-11-12 00:54:57,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:55:00,084 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:55:00,085 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 00:55:02,912 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:55:02,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951633528] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 00:55:02,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 00:55:02,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 22, 25] total 54 [2024-11-12 00:55:02,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32073037] [2024-11-12 00:55:02,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 00:55:02,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-12 00:55:02,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:55:02,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-12 00:55:02,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=2554, Unknown=0, NotChecked=0, Total=2862 [2024-11-12 00:55:02,917 INFO L87 Difference]: Start difference. First operand 212 states and 289 transitions. Second operand has 54 states, 54 states have (on average 5.2407407407407405) internal successors, (283), 54 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:55:06,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:55:06,500 INFO L93 Difference]: Finished difference Result 636 states and 871 transitions. [2024-11-12 00:55:06,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-11-12 00:55:06,500 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.2407407407407405) internal successors, (283), 54 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2024-11-12 00:55:06,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:55:06,503 INFO L225 Difference]: With dead ends: 636 [2024-11-12 00:55:06,503 INFO L226 Difference]: Without dead ends: 474 [2024-11-12 00:55:06,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 155 SyntacticMatches, 2 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3944 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1254, Invalid=11628, Unknown=0, NotChecked=0, Total=12882 [2024-11-12 00:55:06,508 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 989 mSDsluCounter, 2896 mSDsCounter, 0 mSdLazyCounter, 2527 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 989 SdHoareTripleChecker+Valid, 3001 SdHoareTripleChecker+Invalid, 2566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 2527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-12 00:55:06,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [989 Valid, 3001 Invalid, 2566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 2527 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-12 00:55:06,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-11-12 00:55:06,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 359. [2024-11-12 00:55:06,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 1.3519553072625698) internal successors, (484), 358 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:55:06,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 484 transitions. [2024-11-12 00:55:06,517 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 484 transitions. Word has length 99 [2024-11-12 00:55:06,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:55:06,517 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 484 transitions. [2024-11-12 00:55:06,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.2407407407407405) internal successors, (283), 54 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:55:06,517 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 484 transitions. [2024-11-12 00:55:06,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-12 00:55:06,519 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:55:06,519 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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-11-12 00:55:06,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 00:55:06,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-12 00:55:06,724 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:55:06,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:55:06,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1576973281, now seen corresponding path program 1 times [2024-11-12 00:55:06,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:55:06,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40127182] [2024-11-12 00:55:06,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:55:06,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:55:07,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:55:08,827 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:55:08,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:55:08,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40127182] [2024-11-12 00:55:08,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40127182] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 00:55:08,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632597836] [2024-11-12 00:55:08,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:55:08,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 00:55:08,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 00:55:08,829 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 00:55:08,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 00:55:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:55:09,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 186 conjuncts are in the unsatisfiable core [2024-11-12 00:55:09,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:55:11,391 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:55:11,391 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 00:55:16,810 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:55:16,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632597836] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 00:55:16,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 00:55:16,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 25, 24] total 62 [2024-11-12 00:55:16,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091598184] [2024-11-12 00:55:16,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 00:55:16,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-11-12 00:55:16,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:55:16,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-11-12 00:55:16,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=404, Invalid=3378, Unknown=0, NotChecked=0, Total=3782 [2024-11-12 00:55:16,815 INFO L87 Difference]: Start difference. First operand 359 states and 484 transitions. Second operand has 62 states, 62 states have (on average 4.596774193548387) internal successors, (285), 62 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:55:22,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:55:22,328 INFO L93 Difference]: Finished difference Result 1057 states and 1446 transitions. [2024-11-12 00:55:22,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2024-11-12 00:55:22,329 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 4.596774193548387) internal successors, (285), 62 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-11-12 00:55:22,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:55:22,331 INFO L225 Difference]: With dead ends: 1057 [2024-11-12 00:55:22,332 INFO L226 Difference]: Without dead ends: 780 [2024-11-12 00:55:22,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5765 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1960, Invalid=17780, Unknown=0, NotChecked=0, Total=19740 [2024-11-12 00:55:22,338 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 1493 mSDsluCounter, 3384 mSDsCounter, 0 mSdLazyCounter, 3254 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1493 SdHoareTripleChecker+Valid, 3490 SdHoareTripleChecker+Invalid, 3294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 3254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:55:22,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1493 Valid, 3490 Invalid, 3294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 3254 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-12 00:55:22,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2024-11-12 00:55:22,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 546. [2024-11-12 00:55:22,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 545 states have (on average 1.3541284403669724) internal successors, (738), 545 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:55:22,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 738 transitions. [2024-11-12 00:55:22,351 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 738 transitions. Word has length 100 [2024-11-12 00:55:22,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:55:22,351 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 738 transitions. [2024-11-12 00:55:22,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 4.596774193548387) internal successors, (285), 62 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:55:22,352 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 738 transitions. [2024-11-12 00:55:22,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-12 00:55:22,353 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:55:22,353 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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-11-12 00:55:22,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 00:55:22,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-12 00:55:22,554 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:55:22,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:55:22,555 INFO L85 PathProgramCache]: Analyzing trace with hash 2083150738, now seen corresponding path program 1 times [2024-11-12 00:55:22,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:55:22,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670201524] [2024-11-12 00:55:22,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:55:22,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:55:22,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:55:23,667 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:55:23,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:55:23,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670201524] [2024-11-12 00:55:23,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670201524] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 00:55:23,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200990616] [2024-11-12 00:55:23,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:55:23,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 00:55:23,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 00:55:23,670 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 00:55:23,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 00:55:24,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:55:24,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 151 conjuncts are in the unsatisfiable core [2024-11-12 00:55:24,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:55:25,324 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:55:25,325 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 00:55:26,849 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:55:26,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200990616] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 00:55:26,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 00:55:26,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 21, 21] total 48 [2024-11-12 00:55:26,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051882208] [2024-11-12 00:55:26,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 00:55:26,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-12 00:55:26,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:55:26,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-12 00:55:26,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=1978, Unknown=0, NotChecked=0, Total=2256 [2024-11-12 00:55:26,852 INFO L87 Difference]: Start difference. First operand 546 states and 738 transitions. Second operand has 48 states, 48 states have (on average 5.958333333333333) internal successors, (286), 48 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:55:32,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:55:32,101 INFO L93 Difference]: Finished difference Result 2106 states and 2854 transitions. [2024-11-12 00:55:32,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2024-11-12 00:55:32,102 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 5.958333333333333) internal successors, (286), 48 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-11-12 00:55:32,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:55:32,109 INFO L225 Difference]: With dead ends: 2106 [2024-11-12 00:55:32,111 INFO L226 Difference]: Without dead ends: 1791 [2024-11-12 00:55:32,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 165 SyntacticMatches, 1 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6350 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2459, Invalid=17001, Unknown=0, NotChecked=0, Total=19460 [2024-11-12 00:55:32,117 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 1498 mSDsluCounter, 6914 mSDsCounter, 0 mSdLazyCounter, 4027 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 7189 SdHoareTripleChecker+Invalid, 4045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 4027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:55:32,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1498 Valid, 7189 Invalid, 4045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 4027 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-12 00:55:32,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states. [2024-11-12 00:55:32,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791 to 832. [2024-11-12 00:55:32,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 831 states have (on average 1.3465703971119134) internal successors, (1119), 831 states have internal predecessors, (1119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:55:32,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1119 transitions. [2024-11-12 00:55:32,142 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1119 transitions. Word has length 100 [2024-11-12 00:55:32,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:55:32,143 INFO L471 AbstractCegarLoop]: Abstraction has 832 states and 1119 transitions. [2024-11-12 00:55:32,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 5.958333333333333) internal successors, (286), 48 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:55:32,143 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1119 transitions. [2024-11-12 00:55:32,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-12 00:55:32,144 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:55:32,145 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1] [2024-11-12 00:55:32,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 00:55:32,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 00:55:32,349 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:55:32,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:55:32,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1224472682, now seen corresponding path program 1 times [2024-11-12 00:55:32,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:55:32,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098351778] [2024-11-12 00:55:32,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:55:32,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:55:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:55:34,079 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:55:34,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:55:34,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098351778] [2024-11-12 00:55:34,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098351778] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 00:55:34,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987397225] [2024-11-12 00:55:34,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:55:34,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 00:55:34,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 00:55:34,082 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 00:55:34,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 00:55:34,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:55:34,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 106 conjuncts are in the unsatisfiable core [2024-11-12 00:55:34,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:55:35,325 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:55:35,326 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 00:55:36,877 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:55:36,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987397225] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 00:55:36,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 00:55:36,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 20] total 50 [2024-11-12 00:55:36,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204894745] [2024-11-12 00:55:36,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 00:55:36,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-12 00:55:36,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:55:36,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-12 00:55:36,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=2246, Unknown=0, NotChecked=0, Total=2450 [2024-11-12 00:55:36,881 INFO L87 Difference]: Start difference. First operand 832 states and 1119 transitions. Second operand has 50 states, 50 states have (on average 5.66) internal successors, (283), 50 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:55:42,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:55:42,421 INFO L93 Difference]: Finished difference Result 2066 states and 2803 transitions. [2024-11-12 00:55:42,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2024-11-12 00:55:42,421 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.66) internal successors, (283), 50 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2024-11-12 00:55:42,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:55:42,426 INFO L225 Difference]: With dead ends: 2066 [2024-11-12 00:55:42,426 INFO L226 Difference]: Without dead ends: 1544 [2024-11-12 00:55:42,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 169 SyntacticMatches, 1 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5435 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1769, Invalid=18823, Unknown=0, NotChecked=0, Total=20592 [2024-11-12 00:55:42,429 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 2334 mSDsluCounter, 4411 mSDsCounter, 0 mSdLazyCounter, 4241 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2334 SdHoareTripleChecker+Valid, 4561 SdHoareTripleChecker+Invalid, 4273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 4241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:55:42,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2334 Valid, 4561 Invalid, 4273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 4241 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-12 00:55:42,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2024-11-12 00:55:42,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1146. [2024-11-12 00:55:42,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 1145 states have (on average 1.3362445414847162) internal successors, (1530), 1145 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:55:42,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1530 transitions. [2024-11-12 00:55:42,461 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1530 transitions. Word has length 101 [2024-11-12 00:55:42,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:55:42,461 INFO L471 AbstractCegarLoop]: Abstraction has 1146 states and 1530 transitions. [2024-11-12 00:55:42,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.66) internal successors, (283), 50 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:55:42,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1530 transitions. [2024-11-12 00:55:42,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-12 00:55:42,463 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:55:42,464 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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-11-12 00:55:42,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-12 00:55:42,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-12 00:55:42,668 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:55:42,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:55:42,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1373936955, now seen corresponding path program 1 times [2024-11-12 00:55:42,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:55:42,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41040423] [2024-11-12 00:55:42,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:55:42,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:55:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:55:44,399 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:55:44,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:55:44,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41040423] [2024-11-12 00:55:44,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41040423] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 00:55:44,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534248324] [2024-11-12 00:55:44,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:55:44,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 00:55:44,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 00:55:44,403 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 00:55:44,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-12 00:55:44,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:55:44,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 86 conjuncts are in the unsatisfiable core [2024-11-12 00:55:44,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:55:45,506 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:55:45,506 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 00:55:46,891 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:55:46,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534248324] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 00:55:46,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 00:55:46,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18, 15] total 38 [2024-11-12 00:55:46,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396862880] [2024-11-12 00:55:46,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 00:55:46,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-12 00:55:46,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:55:46,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-12 00:55:46,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1214, Unknown=0, NotChecked=0, Total=1406 [2024-11-12 00:55:46,894 INFO L87 Difference]: Start difference. First operand 1146 states and 1530 transitions. Second operand has 38 states, 38 states have (on average 7.315789473684211) internal successors, (278), 38 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:55:48,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:55:48,232 INFO L93 Difference]: Finished difference Result 2131 states and 2862 transitions. [2024-11-12 00:55:48,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-12 00:55:48,232 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 7.315789473684211) internal successors, (278), 38 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2024-11-12 00:55:48,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:55:48,236 INFO L225 Difference]: With dead ends: 2131 [2024-11-12 00:55:48,236 INFO L226 Difference]: Without dead ends: 1247 [2024-11-12 00:55:48,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 174 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1169 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=585, Invalid=3447, Unknown=0, NotChecked=0, Total=4032 [2024-11-12 00:55:48,239 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 1170 mSDsluCounter, 1739 mSDsCounter, 0 mSdLazyCounter, 1392 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1170 SdHoareTripleChecker+Valid, 1852 SdHoareTripleChecker+Invalid, 1407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 00:55:48,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1170 Valid, 1852 Invalid, 1407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1392 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 00:55:48,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2024-11-12 00:55:48,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 947. [2024-11-12 00:55:48,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 946 states have (on average 1.3456659619450317) internal successors, (1273), 946 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:55:48,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1273 transitions. [2024-11-12 00:55:48,257 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1273 transitions. Word has length 101 [2024-11-12 00:55:48,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:55:48,258 INFO L471 AbstractCegarLoop]: Abstraction has 947 states and 1273 transitions. [2024-11-12 00:55:48,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 7.315789473684211) internal successors, (278), 38 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:55:48,258 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1273 transitions. [2024-11-12 00:55:48,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-12 00:55:48,259 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:55:48,259 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1] [2024-11-12 00:55:48,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-12 00:55:48,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 00:55:48,461 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:55:48,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:55:48,461 INFO L85 PathProgramCache]: Analyzing trace with hash 296144241, now seen corresponding path program 1 times [2024-11-12 00:55:48,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:55:48,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740601391] [2024-11-12 00:55:48,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:55:48,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:55:48,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:55:49,879 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:55:49,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:55:49,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740601391] [2024-11-12 00:55:49,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740601391] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 00:55:49,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313294573] [2024-11-12 00:55:49,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:55:49,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 00:55:49,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 00:55:49,883 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 00:55:49,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-12 00:55:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:55:50,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 137 conjuncts are in the unsatisfiable core [2024-11-12 00:55:50,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:55:51,497 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:55:51,497 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 00:55:53,015 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:55:53,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313294573] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 00:55:53,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 00:55:53,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 35 [2024-11-12 00:55:53,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151434266] [2024-11-12 00:55:53,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 00:55:53,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-12 00:55:53,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:55:53,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-12 00:55:53,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1056, Unknown=0, NotChecked=0, Total=1190 [2024-11-12 00:55:53,018 INFO L87 Difference]: Start difference. First operand 947 states and 1273 transitions. Second operand has 35 states, 35 states have (on average 7.857142857142857) internal successors, (275), 35 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:55:54,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:55:54,595 INFO L93 Difference]: Finished difference Result 1825 states and 2449 transitions. [2024-11-12 00:55:54,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-12 00:55:54,596 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 7.857142857142857) internal successors, (275), 35 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2024-11-12 00:55:54,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:55:54,598 INFO L225 Difference]: With dead ends: 1825 [2024-11-12 00:55:54,598 INFO L226 Difference]: Without dead ends: 1009 [2024-11-12 00:55:54,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1085 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=586, Invalid=3970, Unknown=0, NotChecked=0, Total=4556 [2024-11-12 00:55:54,600 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 553 mSDsluCounter, 2150 mSDsCounter, 0 mSdLazyCounter, 1486 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 2265 SdHoareTripleChecker+Invalid, 1497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 00:55:54,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 2265 Invalid, 1497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1486 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 00:55:54,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2024-11-12 00:55:54,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 925. [2024-11-12 00:55:54,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 924 states have (on average 1.3474025974025974) internal successors, (1245), 924 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:55:54,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1245 transitions. [2024-11-12 00:55:54,617 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1245 transitions. Word has length 102 [2024-11-12 00:55:54,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:55:54,617 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1245 transitions. [2024-11-12 00:55:54,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 7.857142857142857) internal successors, (275), 35 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:55:54,618 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1245 transitions. [2024-11-12 00:55:54,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-12 00:55:54,625 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:55:54,626 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:55:54,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-12 00:55:54,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 00:55:54,827 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:55:54,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:55:54,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1122330496, now seen corresponding path program 2 times [2024-11-12 00:55:54,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:55:54,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113578872] [2024-11-12 00:55:54,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:55:54,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:55:55,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:55:58,847 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 16 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:55:58,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:55:58,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113578872] [2024-11-12 00:55:58,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113578872] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 00:55:58,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715271679] [2024-11-12 00:55:58,848 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 00:55:58,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 00:55:58,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 00:55:58,852 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 00:55:58,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-12 00:55:59,544 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 00:55:59,545 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 00:55:59,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 1188 conjuncts, 133 conjuncts are in the unsatisfiable core [2024-11-12 00:55:59,558 INFO L279 TraceCheckSpWp]: Computing forward predicates...