/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label23.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 01:15:49,755 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 01:15:49,801 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-16 01:15:49,805 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 01:15:49,805 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 01:15:49,819 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 01:15:49,820 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 01:15:49,820 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 01:15:49,820 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 01:15:49,821 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 01:15:49,821 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 01:15:49,821 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 01:15:49,822 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 01:15:49,822 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 01:15:49,822 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 01:15:49,822 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 01:15:49,822 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 01:15:49,823 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 01:15:49,823 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 01:15:49,823 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 01:15:49,823 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 01:15:49,826 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 01:15:49,826 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 01:15:49,826 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 01:15:49,826 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 01:15:49,826 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 01:15:49,826 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 01:15:49,827 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 01:15:49,827 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 01:15:49,827 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 01:15:49,827 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 01:15:49,827 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 01:15:49,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 01:15:49,828 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 01:15:49,828 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 01:15:49,828 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 01:15:49,828 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 01:15:49,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 01:15:49,829 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 01:15:49,829 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 01:15:49,829 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 01:15:49,831 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 01:15:49,831 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 01:15:49,831 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: Use bitabs translation -> false [2023-12-16 01:15:50,029 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 01:15:50,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 01:15:50,050 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 01:15:50,051 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 01:15:50,051 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 01:15:50,052 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label23.c [2023-12-16 01:15:51,155 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 01:15:51,350 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 01:15:51,350 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label23.c [2023-12-16 01:15:51,359 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cb7de09e/a91a4b53407f4b6a92e0dfa7da6521f0/FLAG242a922d3 [2023-12-16 01:15:51,369 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cb7de09e/a91a4b53407f4b6a92e0dfa7da6521f0 [2023-12-16 01:15:51,371 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 01:15:51,371 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 01:15:51,372 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 01:15:51,372 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 01:15:51,375 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 01:15:51,376 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 01:15:51" (1/1) ... [2023-12-16 01:15:51,377 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@289a1100 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:15:51, skipping insertion in model container [2023-12-16 01:15:51,377 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 01:15:51" (1/1) ... [2023-12-16 01:15:51,430 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 01:15:51,649 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label23.c[20538,20551] [2023-12-16 01:15:51,663 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 01:15:51,672 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 01:15:51,772 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label23.c[20538,20551] [2023-12-16 01:15:51,777 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 01:15:51,787 INFO L206 MainTranslator]: Completed translation [2023-12-16 01:15:51,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:15:51 WrapperNode [2023-12-16 01:15:51,787 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 01:15:51,788 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 01:15:51,788 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 01:15:51,788 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 01:15:51,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:15:51" (1/1) ... [2023-12-16 01:15:51,813 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:15:51" (1/1) ... [2023-12-16 01:15:51,854 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 669 [2023-12-16 01:15:51,855 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 01:15:51,855 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 01:15:51,856 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 01:15:51,856 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 01:15:51,863 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:15:51" (1/1) ... [2023-12-16 01:15:51,864 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:15:51" (1/1) ... [2023-12-16 01:15:51,867 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:15:51" (1/1) ... [2023-12-16 01:15:51,880 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]. [2023-12-16 01:15:51,880 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:15:51" (1/1) ... [2023-12-16 01:15:51,881 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:15:51" (1/1) ... [2023-12-16 01:15:51,906 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:15:51" (1/1) ... [2023-12-16 01:15:51,910 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:15:51" (1/1) ... [2023-12-16 01:15:51,915 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:15:51" (1/1) ... [2023-12-16 01:15:51,918 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:15:51" (1/1) ... [2023-12-16 01:15:51,923 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 01:15:51,924 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 01:15:51,924 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 01:15:51,924 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 01:15:51,925 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:15:51" (1/1) ... [2023-12-16 01:15:51,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 01:15:51,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 01:15:51,973 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) [2023-12-16 01:15:52,020 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 [2023-12-16 01:15:52,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 01:15:52,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 01:15:52,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 01:15:52,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 01:15:52,085 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 01:15:52,087 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 01:15:52,862 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 01:15:52,905 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 01:15:52,906 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 01:15:52,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 01:15:52 BoogieIcfgContainer [2023-12-16 01:15:52,906 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 01:15:52,908 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 01:15:52,908 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 01:15:52,910 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 01:15:52,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 01:15:51" (1/3) ... [2023-12-16 01:15:52,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cd668b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 01:15:52, skipping insertion in model container [2023-12-16 01:15:52,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:15:51" (2/3) ... [2023-12-16 01:15:52,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cd668b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 01:15:52, skipping insertion in model container [2023-12-16 01:15:52,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 01:15:52" (3/3) ... [2023-12-16 01:15:52,912 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label23.c [2023-12-16 01:15:52,924 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 01:15:52,924 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 01:15:52,992 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 01:15:52,996 INFO L357 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, mHoare=true, 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;@20d37387, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 01:15:52,997 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 01:15:53,000 INFO L276 IsEmpty]: Start isEmpty. Operand has 165 states, 163 states have (on average 1.9202453987730062) internal successors, (313), 164 states have internal predecessors, (313), 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) [2023-12-16 01:15:53,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-16 01:15:53,007 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:15:53,008 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:15:53,008 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:15:53,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:15:53,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1381881502, now seen corresponding path program 1 times [2023-12-16 01:15:53,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:15:53,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572128510] [2023-12-16 01:15:53,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:15:53,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:15:53,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:15:53,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 01:15:53,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:15:53,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572128510] [2023-12-16 01:15:53,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572128510] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:15:53,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:15:53,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 01:15:53,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982811436] [2023-12-16 01:15:53,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:15:53,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 01:15:53,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:15:53,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 01:15:53,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 01:15:53,318 INFO L87 Difference]: Start difference. First operand has 165 states, 163 states have (on average 1.9202453987730062) internal successors, (313), 164 states have internal predecessors, (313), 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 2 states, 2 states have (on average 66.0) internal successors, (132), 2 states have internal predecessors, (132), 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) [2023-12-16 01:15:53,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:15:53,356 INFO L93 Difference]: Finished difference Result 329 states and 625 transitions. [2023-12-16 01:15:53,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 01:15:53,358 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 66.0) internal successors, (132), 2 states have internal predecessors, (132), 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 132 [2023-12-16 01:15:53,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:15:53,366 INFO L225 Difference]: With dead ends: 329 [2023-12-16 01:15:53,366 INFO L226 Difference]: Without dead ends: 163 [2023-12-16 01:15:53,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 01:15:53,372 INFO L413 NwaCegarLoop]: 248 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 01:15:53,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 248 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 01:15:53,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-12-16 01:15:53,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2023-12-16 01:15:53,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 162 states have internal predecessors, (248), 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) [2023-12-16 01:15:53,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 248 transitions. [2023-12-16 01:15:53,404 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 248 transitions. Word has length 132 [2023-12-16 01:15:53,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:15:53,404 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 248 transitions. [2023-12-16 01:15:53,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 66.0) internal successors, (132), 2 states have internal predecessors, (132), 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) [2023-12-16 01:15:53,405 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 248 transitions. [2023-12-16 01:15:53,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-16 01:15:53,406 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:15:53,406 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:15:53,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 01:15:53,407 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:15:53,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:15:53,408 INFO L85 PathProgramCache]: Analyzing trace with hash 221199683, now seen corresponding path program 1 times [2023-12-16 01:15:53,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:15:53,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975659381] [2023-12-16 01:15:53,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:15:53,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:15:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:15:53,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 01:15:53,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:15:53,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975659381] [2023-12-16 01:15:53,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975659381] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:15:53,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:15:53,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 01:15:53,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767559183] [2023-12-16 01:15:53,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:15:53,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:15:53,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:15:53,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:15:53,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:15:53,664 INFO L87 Difference]: Start difference. First operand 163 states and 248 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 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) [2023-12-16 01:15:54,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:15:54,131 INFO L93 Difference]: Finished difference Result 479 states and 734 transitions. [2023-12-16 01:15:54,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:15:54,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 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 132 [2023-12-16 01:15:54,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:15:54,138 INFO L225 Difference]: With dead ends: 479 [2023-12-16 01:15:54,138 INFO L226 Difference]: Without dead ends: 317 [2023-12-16 01:15:54,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:15:54,142 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 43 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 01:15:54,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 98 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 01:15:54,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2023-12-16 01:15:54,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 312. [2023-12-16 01:15:54,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 311 states have (on average 1.472668810289389) internal successors, (458), 311 states have internal predecessors, (458), 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) [2023-12-16 01:15:54,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 458 transitions. [2023-12-16 01:15:54,163 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 458 transitions. Word has length 132 [2023-12-16 01:15:54,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:15:54,164 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 458 transitions. [2023-12-16 01:15:54,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 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) [2023-12-16 01:15:54,164 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 458 transitions. [2023-12-16 01:15:54,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-12-16 01:15:54,166 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:15:54,166 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:15:54,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 01:15:54,166 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:15:54,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:15:54,167 INFO L85 PathProgramCache]: Analyzing trace with hash -51356488, now seen corresponding path program 1 times [2023-12-16 01:15:54,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:15:54,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256847964] [2023-12-16 01:15:54,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:15:54,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:15:54,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:15:54,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 01:15:54,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:15:54,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256847964] [2023-12-16 01:15:54,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256847964] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:15:54,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:15:54,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 01:15:54,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110044600] [2023-12-16 01:15:54,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:15:54,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:15:54,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:15:54,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:15:54,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:15:54,408 INFO L87 Difference]: Start difference. First operand 312 states and 458 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 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) [2023-12-16 01:15:54,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:15:54,824 INFO L93 Difference]: Finished difference Result 909 states and 1340 transitions. [2023-12-16 01:15:54,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:15:54,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 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 136 [2023-12-16 01:15:54,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:15:54,826 INFO L225 Difference]: With dead ends: 909 [2023-12-16 01:15:54,826 INFO L226 Difference]: Without dead ends: 598 [2023-12-16 01:15:54,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:15:54,829 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 143 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 01:15:54,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 113 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 01:15:54,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2023-12-16 01:15:54,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 595. [2023-12-16 01:15:54,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 594 states have (on average 1.297979797979798) internal successors, (771), 594 states have internal predecessors, (771), 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) [2023-12-16 01:15:54,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 771 transitions. [2023-12-16 01:15:54,857 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 771 transitions. Word has length 136 [2023-12-16 01:15:54,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:15:54,860 INFO L495 AbstractCegarLoop]: Abstraction has 595 states and 771 transitions. [2023-12-16 01:15:54,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 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) [2023-12-16 01:15:54,863 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 771 transitions. [2023-12-16 01:15:54,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-16 01:15:54,866 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:15:54,867 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:15:54,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 01:15:54,867 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:15:54,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:15:54,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1899648381, now seen corresponding path program 1 times [2023-12-16 01:15:54,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:15:54,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80712379] [2023-12-16 01:15:54,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:15:54,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:15:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:15:55,023 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 01:15:55,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:15:55,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80712379] [2023-12-16 01:15:55,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80712379] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:15:55,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:15:55,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 01:15:55,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542825488] [2023-12-16 01:15:55,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:15:55,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:15:55,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:15:55,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:15:55,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:15:55,026 INFO L87 Difference]: Start difference. First operand 595 states and 771 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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) [2023-12-16 01:15:55,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:15:55,364 INFO L93 Difference]: Finished difference Result 1476 states and 1966 transitions. [2023-12-16 01:15:55,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:15:55,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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 141 [2023-12-16 01:15:55,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:15:55,367 INFO L225 Difference]: With dead ends: 1476 [2023-12-16 01:15:55,367 INFO L226 Difference]: Without dead ends: 882 [2023-12-16 01:15:55,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:15:55,375 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 144 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 01:15:55,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 252 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 01:15:55,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2023-12-16 01:15:55,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 879. [2023-12-16 01:15:55,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 878 states have (on average 1.2357630979498861) internal successors, (1085), 878 states have internal predecessors, (1085), 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) [2023-12-16 01:15:55,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1085 transitions. [2023-12-16 01:15:55,389 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1085 transitions. Word has length 141 [2023-12-16 01:15:55,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:15:55,389 INFO L495 AbstractCegarLoop]: Abstraction has 879 states and 1085 transitions. [2023-12-16 01:15:55,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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) [2023-12-16 01:15:55,389 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1085 transitions. [2023-12-16 01:15:55,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-16 01:15:55,392 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:15:55,392 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:15:55,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 01:15:55,392 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:15:55,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:15:55,395 INFO L85 PathProgramCache]: Analyzing trace with hash 113411282, now seen corresponding path program 1 times [2023-12-16 01:15:55,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:15:55,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434422687] [2023-12-16 01:15:55,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:15:55,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:15:55,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:15:55,516 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 01:15:55,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:15:55,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434422687] [2023-12-16 01:15:55,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434422687] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:15:55,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:15:55,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 01:15:55,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66294634] [2023-12-16 01:15:55,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:15:55,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:15:55,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:15:55,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:15:55,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:15:55,519 INFO L87 Difference]: Start difference. First operand 879 states and 1085 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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) [2023-12-16 01:15:55,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:15:55,857 INFO L93 Difference]: Finished difference Result 2180 states and 2700 transitions. [2023-12-16 01:15:55,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:15:55,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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 141 [2023-12-16 01:15:55,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:15:55,861 INFO L225 Difference]: With dead ends: 2180 [2023-12-16 01:15:55,861 INFO L226 Difference]: Without dead ends: 1302 [2023-12-16 01:15:55,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:15:55,863 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 16 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 01:15:55,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 267 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 01:15:55,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2023-12-16 01:15:55,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1299. [2023-12-16 01:15:55,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1299 states, 1298 states have (on average 1.1864406779661016) internal successors, (1540), 1298 states have internal predecessors, (1540), 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) [2023-12-16 01:15:55,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 1540 transitions. [2023-12-16 01:15:55,882 INFO L78 Accepts]: Start accepts. Automaton has 1299 states and 1540 transitions. Word has length 141 [2023-12-16 01:15:55,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:15:55,883 INFO L495 AbstractCegarLoop]: Abstraction has 1299 states and 1540 transitions. [2023-12-16 01:15:55,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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) [2023-12-16 01:15:55,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1540 transitions. [2023-12-16 01:15:55,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-16 01:15:55,885 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:15:55,885 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:15:55,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 01:15:55,885 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:15:55,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:15:55,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1556313276, now seen corresponding path program 1 times [2023-12-16 01:15:55,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:15:55,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288232146] [2023-12-16 01:15:55,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:15:55,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:15:55,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:15:55,938 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 01:15:55,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:15:55,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288232146] [2023-12-16 01:15:55,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288232146] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:15:55,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:15:55,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 01:15:55,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189758900] [2023-12-16 01:15:55,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:15:55,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:15:55,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:15:55,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:15:55,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:15:55,940 INFO L87 Difference]: Start difference. First operand 1299 states and 1540 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 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) [2023-12-16 01:15:56,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:15:56,256 INFO L93 Difference]: Finished difference Result 3297 states and 3955 transitions. [2023-12-16 01:15:56,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:15:56,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 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 146 [2023-12-16 01:15:56,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:15:56,261 INFO L225 Difference]: With dead ends: 3297 [2023-12-16 01:15:56,261 INFO L226 Difference]: Without dead ends: 1999 [2023-12-16 01:15:56,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:15:56,263 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 174 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 01:15:56,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 97 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 01:15:56,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2023-12-16 01:15:56,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1999. [2023-12-16 01:15:56,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1999 states, 1998 states have (on average 1.1686686686686687) internal successors, (2335), 1998 states have internal predecessors, (2335), 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) [2023-12-16 01:15:56,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1999 states to 1999 states and 2335 transitions. [2023-12-16 01:15:56,292 INFO L78 Accepts]: Start accepts. Automaton has 1999 states and 2335 transitions. Word has length 146 [2023-12-16 01:15:56,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:15:56,293 INFO L495 AbstractCegarLoop]: Abstraction has 1999 states and 2335 transitions. [2023-12-16 01:15:56,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 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) [2023-12-16 01:15:56,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1999 states and 2335 transitions. [2023-12-16 01:15:56,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-12-16 01:15:56,296 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:15:56,296 INFO L195 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:15:56,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 01:15:56,296 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:15:56,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:15:56,297 INFO L85 PathProgramCache]: Analyzing trace with hash 51815168, now seen corresponding path program 1 times [2023-12-16 01:15:56,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:15:56,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816547799] [2023-12-16 01:15:56,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:15:56,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:15:56,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:15:56,397 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-12-16 01:15:56,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:15:56,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816547799] [2023-12-16 01:15:56,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816547799] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:15:56,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:15:56,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 01:15:56,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541122743] [2023-12-16 01:15:56,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:15:56,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:15:56,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:15:56,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:15:56,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:15:56,399 INFO L87 Difference]: Start difference. First operand 1999 states and 2335 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 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) [2023-12-16 01:15:56,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:15:56,735 INFO L93 Difference]: Finished difference Result 5256 states and 6195 transitions. [2023-12-16 01:15:56,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:15:56,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 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 162 [2023-12-16 01:15:56,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:15:56,744 INFO L225 Difference]: With dead ends: 5256 [2023-12-16 01:15:56,744 INFO L226 Difference]: Without dead ends: 3258 [2023-12-16 01:15:56,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:15:56,747 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 85 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 01:15:56,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 42 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 01:15:56,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3258 states. [2023-12-16 01:15:56,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3258 to 2278. [2023-12-16 01:15:56,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2278 states, 2277 states have (on average 1.2024593763724198) internal successors, (2738), 2277 states have internal predecessors, (2738), 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) [2023-12-16 01:15:56,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2278 states to 2278 states and 2738 transitions. [2023-12-16 01:15:56,785 INFO L78 Accepts]: Start accepts. Automaton has 2278 states and 2738 transitions. Word has length 162 [2023-12-16 01:15:56,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:15:56,785 INFO L495 AbstractCegarLoop]: Abstraction has 2278 states and 2738 transitions. [2023-12-16 01:15:56,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 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) [2023-12-16 01:15:56,785 INFO L276 IsEmpty]: Start isEmpty. Operand 2278 states and 2738 transitions. [2023-12-16 01:15:56,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2023-12-16 01:15:56,789 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:15:56,789 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:15:56,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 01:15:56,789 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:15:56,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:15:56,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1964070487, now seen corresponding path program 1 times [2023-12-16 01:15:56,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:15:56,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150353295] [2023-12-16 01:15:56,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:15:56,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:15:56,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:15:56,878 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-16 01:15:56,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:15:56,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150353295] [2023-12-16 01:15:56,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150353295] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:15:56,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:15:56,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 01:15:56,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630337853] [2023-12-16 01:15:56,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:15:56,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:15:56,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:15:56,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:15:56,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:15:56,880 INFO L87 Difference]: Start difference. First operand 2278 states and 2738 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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) [2023-12-16 01:15:57,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:15:57,172 INFO L93 Difference]: Finished difference Result 4557 states and 5477 transitions. [2023-12-16 01:15:57,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:15:57,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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 187 [2023-12-16 01:15:57,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:15:57,178 INFO L225 Difference]: With dead ends: 4557 [2023-12-16 01:15:57,178 INFO L226 Difference]: Without dead ends: 2280 [2023-12-16 01:15:57,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:15:57,181 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 161 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 01:15:57,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 56 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 01:15:57,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2280 states. [2023-12-16 01:15:57,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2280 to 2138. [2023-12-16 01:15:57,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2138 states, 2137 states have (on average 1.182966775854001) internal successors, (2528), 2137 states have internal predecessors, (2528), 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) [2023-12-16 01:15:57,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2138 states to 2138 states and 2528 transitions. [2023-12-16 01:15:57,213 INFO L78 Accepts]: Start accepts. Automaton has 2138 states and 2528 transitions. Word has length 187 [2023-12-16 01:15:57,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:15:57,213 INFO L495 AbstractCegarLoop]: Abstraction has 2138 states and 2528 transitions. [2023-12-16 01:15:57,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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) [2023-12-16 01:15:57,213 INFO L276 IsEmpty]: Start isEmpty. Operand 2138 states and 2528 transitions. [2023-12-16 01:15:57,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2023-12-16 01:15:57,217 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:15:57,217 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:15:57,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 01:15:57,217 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:15:57,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:15:57,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1860147341, now seen corresponding path program 1 times [2023-12-16 01:15:57,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:15:57,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269459273] [2023-12-16 01:15:57,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:15:57,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:15:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:15:57,311 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-16 01:15:57,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:15:57,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269459273] [2023-12-16 01:15:57,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269459273] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:15:57,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:15:57,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 01:15:57,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962813388] [2023-12-16 01:15:57,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:15:57,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:15:57,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:15:57,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:15:57,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:15:57,313 INFO L87 Difference]: Start difference. First operand 2138 states and 2528 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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) [2023-12-16 01:15:57,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:15:57,579 INFO L93 Difference]: Finished difference Result 3994 states and 4729 transitions. [2023-12-16 01:15:57,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:15:57,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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 191 [2023-12-16 01:15:57,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:15:57,584 INFO L225 Difference]: With dead ends: 3994 [2023-12-16 01:15:57,585 INFO L226 Difference]: Without dead ends: 1857 [2023-12-16 01:15:57,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:15:57,587 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 144 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 01:15:57,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 269 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 01:15:57,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1857 states. [2023-12-16 01:15:57,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1857 to 1852. [2023-12-16 01:15:57,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1852 states, 1851 states have (on average 1.1491085899513775) internal successors, (2127), 1851 states have internal predecessors, (2127), 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) [2023-12-16 01:15:57,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1852 states to 1852 states and 2127 transitions. [2023-12-16 01:15:57,623 INFO L78 Accepts]: Start accepts. Automaton has 1852 states and 2127 transitions. Word has length 191 [2023-12-16 01:15:57,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:15:57,623 INFO L495 AbstractCegarLoop]: Abstraction has 1852 states and 2127 transitions. [2023-12-16 01:15:57,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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) [2023-12-16 01:15:57,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1852 states and 2127 transitions. [2023-12-16 01:15:57,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2023-12-16 01:15:57,626 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:15:57,626 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:15:57,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-16 01:15:57,626 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:15:57,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:15:57,627 INFO L85 PathProgramCache]: Analyzing trace with hash -917919341, now seen corresponding path program 1 times [2023-12-16 01:15:57,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:15:57,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907818076] [2023-12-16 01:15:57,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:15:57,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:15:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:15:57,701 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2023-12-16 01:15:57,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:15:57,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907818076] [2023-12-16 01:15:57,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907818076] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:15:57,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:15:57,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 01:15:57,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289063557] [2023-12-16 01:15:57,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:15:57,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:15:57,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:15:57,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:15:57,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:15:57,703 INFO L87 Difference]: Start difference. First operand 1852 states and 2127 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 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) [2023-12-16 01:15:57,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:15:57,864 INFO L93 Difference]: Finished difference Result 3268 states and 3786 transitions. [2023-12-16 01:15:57,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:15:57,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 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 201 [2023-12-16 01:15:57,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:15:57,868 INFO L225 Difference]: With dead ends: 3268 [2023-12-16 01:15:57,868 INFO L226 Difference]: Without dead ends: 1275 [2023-12-16 01:15:57,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:15:57,870 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 187 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 01:15:57,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 18 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 01:15:57,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2023-12-16 01:15:57,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1275. [2023-12-16 01:15:57,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1275 states, 1274 states have (on average 1.1271585557299844) internal successors, (1436), 1274 states have internal predecessors, (1436), 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) [2023-12-16 01:15:57,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1436 transitions. [2023-12-16 01:15:57,885 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1436 transitions. Word has length 201 [2023-12-16 01:15:57,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:15:57,885 INFO L495 AbstractCegarLoop]: Abstraction has 1275 states and 1436 transitions. [2023-12-16 01:15:57,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 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) [2023-12-16 01:15:57,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1436 transitions. [2023-12-16 01:15:57,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2023-12-16 01:15:57,888 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:15:57,888 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:15:57,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 01:15:57,888 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:15:57,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:15:57,888 INFO L85 PathProgramCache]: Analyzing trace with hash -716578695, now seen corresponding path program 1 times [2023-12-16 01:15:57,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:15:57,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208903379] [2023-12-16 01:15:57,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:15:57,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:15:57,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:15:58,003 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-16 01:15:58,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:15:58,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208903379] [2023-12-16 01:15:58,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208903379] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:15:58,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:15:58,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 01:15:58,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150805332] [2023-12-16 01:15:58,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:15:58,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:15:58,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:15:58,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:15:58,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:15:58,005 INFO L87 Difference]: Start difference. First operand 1275 states and 1436 transitions. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 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) [2023-12-16 01:15:58,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:15:58,349 INFO L93 Difference]: Finished difference Result 2831 states and 3232 transitions. [2023-12-16 01:15:58,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:15:58,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 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 230 [2023-12-16 01:15:58,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:15:58,354 INFO L225 Difference]: With dead ends: 2831 [2023-12-16 01:15:58,354 INFO L226 Difference]: Without dead ends: 1697 [2023-12-16 01:15:58,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:15:58,356 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 131 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 01:15:58,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 183 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 01:15:58,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2023-12-16 01:15:58,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1696. [2023-12-16 01:15:58,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1696 states, 1695 states have (on average 1.1227138643067847) internal successors, (1903), 1695 states have internal predecessors, (1903), 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) [2023-12-16 01:15:58,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 1903 transitions. [2023-12-16 01:15:58,378 INFO L78 Accepts]: Start accepts. Automaton has 1696 states and 1903 transitions. Word has length 230 [2023-12-16 01:15:58,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:15:58,378 INFO L495 AbstractCegarLoop]: Abstraction has 1696 states and 1903 transitions. [2023-12-16 01:15:58,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 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) [2023-12-16 01:15:58,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 1903 transitions. [2023-12-16 01:15:58,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2023-12-16 01:15:58,381 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:15:58,381 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:15:58,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-16 01:15:58,382 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:15:58,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:15:58,382 INFO L85 PathProgramCache]: Analyzing trace with hash -768517619, now seen corresponding path program 1 times [2023-12-16 01:15:58,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:15:58,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361389011] [2023-12-16 01:15:58,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:15:58,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:15:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:15:58,466 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-16 01:15:58,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:15:58,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361389011] [2023-12-16 01:15:58,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361389011] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:15:58,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 01:15:58,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 01:15:58,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364797936] [2023-12-16 01:15:58,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:15:58,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:15:58,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:15:58,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:15:58,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:15:58,467 INFO L87 Difference]: Start difference. First operand 1696 states and 1903 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 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) [2023-12-16 01:15:58,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:15:58,788 INFO L93 Difference]: Finished difference Result 3810 states and 4286 transitions. [2023-12-16 01:15:58,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:15:58,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 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 230 [2023-12-16 01:15:58,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:15:58,794 INFO L225 Difference]: With dead ends: 3810 [2023-12-16 01:15:58,794 INFO L226 Difference]: Without dead ends: 2255 [2023-12-16 01:15:58,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 01:15:58,796 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 145 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 01:15:58,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 31 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 01:15:58,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2255 states. [2023-12-16 01:15:58,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2255 to 1695. [2023-12-16 01:15:58,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1695 states, 1694 states have (on average 1.1221959858323494) internal successors, (1901), 1694 states have internal predecessors, (1901), 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) [2023-12-16 01:15:58,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1695 states and 1901 transitions. [2023-12-16 01:15:58,826 INFO L78 Accepts]: Start accepts. Automaton has 1695 states and 1901 transitions. Word has length 230 [2023-12-16 01:15:58,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:15:58,826 INFO L495 AbstractCegarLoop]: Abstraction has 1695 states and 1901 transitions. [2023-12-16 01:15:58,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 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) [2023-12-16 01:15:58,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 1901 transitions. [2023-12-16 01:15:58,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2023-12-16 01:15:58,829 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 01:15:58,830 INFO L195 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:15:58,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-16 01:15:58,830 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 01:15:58,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 01:15:58,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1541008392, now seen corresponding path program 1 times [2023-12-16 01:15:58,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 01:15:58,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458223976] [2023-12-16 01:15:58,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:15:58,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 01:15:58,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:15:59,169 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 68 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 01:15:59,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 01:15:59,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458223976] [2023-12-16 01:15:59,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458223976] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 01:15:59,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330862301] [2023-12-16 01:15:59,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 01:15:59,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 01:15:59,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 01:15:59,182 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) [2023-12-16 01:15:59,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-16 01:15:59,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 01:15:59,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 01:15:59,288 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 01:15:59,423 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-12-16 01:15:59,424 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 01:15:59,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330862301] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 01:15:59,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 01:15:59,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2023-12-16 01:15:59,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710563041] [2023-12-16 01:15:59,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 01:15:59,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 01:15:59,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 01:15:59,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 01:15:59,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 01:15:59,425 INFO L87 Difference]: Start difference. First operand 1695 states and 1901 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 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) [2023-12-16 01:15:59,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 01:15:59,680 INFO L93 Difference]: Finished difference Result 3246 states and 3654 transitions. [2023-12-16 01:15:59,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 01:15:59,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 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 230 [2023-12-16 01:15:59,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 01:15:59,680 INFO L225 Difference]: With dead ends: 3246 [2023-12-16 01:15:59,681 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 01:15:59,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 01:15:59,683 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 26 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 01:15:59,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 192 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 01:15:59,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 01:15:59,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 01:15:59,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 01:15:59,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 01:15:59,683 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 230 [2023-12-16 01:15:59,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 01:15:59,684 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 01:15:59,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 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) [2023-12-16 01:15:59,684 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 01:15:59,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 01:15:59,686 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 01:15:59,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-16 01:15:59,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-16 01:15:59,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 01:16:00,180 INFO L899 garLoopResultBuilder]: For program point L565-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,181 INFO L899 garLoopResultBuilder]: For program point L499-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,181 INFO L899 garLoopResultBuilder]: For program point L433-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,181 INFO L899 garLoopResultBuilder]: For program point L301(lines 301 423) no Hoare annotation was computed. [2023-12-16 01:16:00,181 INFO L899 garLoopResultBuilder]: For program point L235(lines 235 423) no Hoare annotation was computed. [2023-12-16 01:16:00,181 INFO L899 garLoopResultBuilder]: For program point L169(lines 169 423) no Hoare annotation was computed. [2023-12-16 01:16:00,181 INFO L899 garLoopResultBuilder]: For program point L303(lines 303 423) no Hoare annotation was computed. [2023-12-16 01:16:00,181 INFO L899 garLoopResultBuilder]: For program point L105(lines 105 423) no Hoare annotation was computed. [2023-12-16 01:16:00,181 INFO L899 garLoopResultBuilder]: For program point L568-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,181 INFO L899 garLoopResultBuilder]: For program point L502-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,181 INFO L899 garLoopResultBuilder]: For program point L436-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,181 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 423) no Hoare annotation was computed. [2023-12-16 01:16:00,181 INFO L899 garLoopResultBuilder]: For program point L371(lines 371 423) no Hoare annotation was computed. [2023-12-16 01:16:00,182 INFO L899 garLoopResultBuilder]: For program point L571-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,182 INFO L899 garLoopResultBuilder]: For program point L505-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,182 INFO L899 garLoopResultBuilder]: For program point L439-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,182 INFO L899 garLoopResultBuilder]: For program point L307(lines 307 423) no Hoare annotation was computed. [2023-12-16 01:16:00,182 INFO L899 garLoopResultBuilder]: For program point L175(lines 175 423) no Hoare annotation was computed. [2023-12-16 01:16:00,182 INFO L899 garLoopResultBuilder]: For program point L109(lines 109 423) no Hoare annotation was computed. [2023-12-16 01:16:00,182 INFO L899 garLoopResultBuilder]: For program point L308(lines 308 317) no Hoare annotation was computed. [2023-12-16 01:16:00,182 INFO L899 garLoopResultBuilder]: For program point L242(lines 242 423) no Hoare annotation was computed. [2023-12-16 01:16:00,182 INFO L899 garLoopResultBuilder]: For program point L308-2(lines 308 317) no Hoare annotation was computed. [2023-12-16 01:16:00,182 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 423) no Hoare annotation was computed. [2023-12-16 01:16:00,182 INFO L899 garLoopResultBuilder]: For program point L574-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,182 INFO L899 garLoopResultBuilder]: For program point L508-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,182 INFO L899 garLoopResultBuilder]: For program point L442-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,182 INFO L899 garLoopResultBuilder]: For program point L244(lines 244 423) no Hoare annotation was computed. [2023-12-16 01:16:00,182 INFO L899 garLoopResultBuilder]: For program point L179(lines 179 423) no Hoare annotation was computed. [2023-12-16 01:16:00,182 INFO L899 garLoopResultBuilder]: For program point L378(lines 378 423) no Hoare annotation was computed. [2023-12-16 01:16:00,182 INFO L899 garLoopResultBuilder]: For program point L48(lines 48 423) no Hoare annotation was computed. [2023-12-16 01:16:00,183 INFO L899 garLoopResultBuilder]: For program point L577-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,183 INFO L899 garLoopResultBuilder]: For program point L511-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,183 INFO L899 garLoopResultBuilder]: For program point L445-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,183 INFO L899 garLoopResultBuilder]: For program point L247(lines 247 423) no Hoare annotation was computed. [2023-12-16 01:16:00,183 INFO L899 garLoopResultBuilder]: For program point L248(lines 248 256) no Hoare annotation was computed. [2023-12-16 01:16:00,183 INFO L899 garLoopResultBuilder]: For program point L248-2(lines 248 256) no Hoare annotation was computed. [2023-12-16 01:16:00,183 INFO L899 garLoopResultBuilder]: For program point L116(lines 116 423) no Hoare annotation was computed. [2023-12-16 01:16:00,183 INFO L899 garLoopResultBuilder]: For program point L580-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,183 INFO L899 garLoopResultBuilder]: For program point L514-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,183 INFO L899 garLoopResultBuilder]: For program point L448-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,183 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 423) no Hoare annotation was computed. [2023-12-16 01:16:00,183 INFO L899 garLoopResultBuilder]: For program point L581(line 581) no Hoare annotation was computed. [2023-12-16 01:16:00,183 INFO L899 garLoopResultBuilder]: For program point L185(lines 185 423) no Hoare annotation was computed. [2023-12-16 01:16:00,183 INFO L899 garLoopResultBuilder]: For program point L583-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,183 INFO L899 garLoopResultBuilder]: For program point L517-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,183 INFO L899 garLoopResultBuilder]: For program point L451-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,183 INFO L899 garLoopResultBuilder]: For program point L385(lines 385 423) no Hoare annotation was computed. [2023-12-16 01:16:00,183 INFO L899 garLoopResultBuilder]: For program point L319(lines 319 423) no Hoare annotation was computed. [2023-12-16 01:16:00,184 INFO L899 garLoopResultBuilder]: For program point L189(lines 189 423) no Hoare annotation was computed. [2023-12-16 01:16:00,184 INFO L899 garLoopResultBuilder]: For program point L123(lines 123 423) no Hoare annotation was computed. [2023-12-16 01:16:00,184 INFO L899 garLoopResultBuilder]: For program point L57(lines 57 423) no Hoare annotation was computed. [2023-12-16 01:16:00,184 INFO L899 garLoopResultBuilder]: For program point L586-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,184 INFO L899 garLoopResultBuilder]: For program point L520-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,184 INFO L899 garLoopResultBuilder]: For program point L454-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,184 INFO L899 garLoopResultBuilder]: For program point L388(lines 388 423) no Hoare annotation was computed. [2023-12-16 01:16:00,184 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 01:16:00,184 INFO L899 garLoopResultBuilder]: For program point L390(lines 390 423) no Hoare annotation was computed. [2023-12-16 01:16:00,184 INFO L899 garLoopResultBuilder]: For program point L324(lines 324 423) no Hoare annotation was computed. [2023-12-16 01:16:00,184 INFO L899 garLoopResultBuilder]: For program point L258(lines 258 423) no Hoare annotation was computed. [2023-12-16 01:16:00,184 INFO L899 garLoopResultBuilder]: For program point L60(lines 60 423) no Hoare annotation was computed. [2023-12-16 01:16:00,184 INFO L899 garLoopResultBuilder]: For program point L589-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,184 INFO L899 garLoopResultBuilder]: For program point L523-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,184 INFO L899 garLoopResultBuilder]: For program point L457-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,184 INFO L899 garLoopResultBuilder]: For program point L391(lines 391 397) no Hoare annotation was computed. [2023-12-16 01:16:00,184 INFO L899 garLoopResultBuilder]: For program point L325(lines 325 336) no Hoare annotation was computed. [2023-12-16 01:16:00,184 INFO L899 garLoopResultBuilder]: For program point L391-2(lines 391 397) no Hoare annotation was computed. [2023-12-16 01:16:00,185 INFO L899 garLoopResultBuilder]: For program point L325-2(lines 325 336) no Hoare annotation was computed. [2023-12-16 01:16:00,185 INFO L899 garLoopResultBuilder]: For program point L195(lines 195 423) no Hoare annotation was computed. [2023-12-16 01:16:00,185 INFO L899 garLoopResultBuilder]: For program point L129(lines 129 423) no Hoare annotation was computed. [2023-12-16 01:16:00,185 INFO L899 garLoopResultBuilder]: For program point L592-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,185 INFO L899 garLoopResultBuilder]: For program point L526-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,185 INFO L899 garLoopResultBuilder]: For program point L460-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,185 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 423) no Hoare annotation was computed. [2023-12-16 01:16:00,185 INFO L899 garLoopResultBuilder]: For program point L263(lines 263 423) no Hoare annotation was computed. [2023-12-16 01:16:00,185 INFO L899 garLoopResultBuilder]: For program point L197(lines 197 423) no Hoare annotation was computed. [2023-12-16 01:16:00,185 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 581) no Hoare annotation was computed. [2023-12-16 01:16:00,185 INFO L899 garLoopResultBuilder]: For program point L595-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,185 INFO L899 garLoopResultBuilder]: For program point L529-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,185 INFO L899 garLoopResultBuilder]: For program point L463-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,185 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 423) no Hoare annotation was computed. [2023-12-16 01:16:00,185 INFO L899 garLoopResultBuilder]: For program point L133(lines 133 423) no Hoare annotation was computed. [2023-12-16 01:16:00,185 INFO L899 garLoopResultBuilder]: For program point L399(lines 399 423) no Hoare annotation was computed. [2023-12-16 01:16:00,185 INFO L899 garLoopResultBuilder]: For program point L201(lines 201 423) no Hoare annotation was computed. [2023-12-16 01:16:00,185 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 423) no Hoare annotation was computed. [2023-12-16 01:16:00,186 INFO L899 garLoopResultBuilder]: For program point L598-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,186 INFO L899 garLoopResultBuilder]: For program point L532-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,186 INFO L899 garLoopResultBuilder]: For program point L466-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,186 INFO L899 garLoopResultBuilder]: For program point L269(lines 269 423) no Hoare annotation was computed. [2023-12-16 01:16:00,186 INFO L899 garLoopResultBuilder]: For program point L204(lines 204 423) no Hoare annotation was computed. [2023-12-16 01:16:00,186 INFO L899 garLoopResultBuilder]: For program point L601-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,186 INFO L899 garLoopResultBuilder]: For program point L535-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,186 INFO L899 garLoopResultBuilder]: For program point L469-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,186 INFO L899 garLoopResultBuilder]: For program point L271(lines 271 423) no Hoare annotation was computed. [2023-12-16 01:16:00,186 INFO L899 garLoopResultBuilder]: For program point L404(lines 404 423) no Hoare annotation was computed. [2023-12-16 01:16:00,186 INFO L899 garLoopResultBuilder]: For program point L338(lines 338 423) no Hoare annotation was computed. [2023-12-16 01:16:00,186 INFO L899 garLoopResultBuilder]: For program point L272(lines 272 284) no Hoare annotation was computed. [2023-12-16 01:16:00,186 INFO L899 garLoopResultBuilder]: For program point L272-2(lines 272 284) no Hoare annotation was computed. [2023-12-16 01:16:00,186 INFO L899 garLoopResultBuilder]: For program point L140(lines 140 423) no Hoare annotation was computed. [2023-12-16 01:16:00,186 INFO L899 garLoopResultBuilder]: For program point L75(lines 75 423) no Hoare annotation was computed. [2023-12-16 01:16:00,186 INFO L899 garLoopResultBuilder]: For program point L604-1(lines 604 606) no Hoare annotation was computed. [2023-12-16 01:16:00,186 INFO L899 garLoopResultBuilder]: For program point L538-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,186 INFO L899 garLoopResultBuilder]: For program point L472-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,187 INFO L899 garLoopResultBuilder]: For program point L208(lines 208 423) no Hoare annotation was computed. [2023-12-16 01:16:00,187 INFO L899 garLoopResultBuilder]: For program point L341(lines 341 423) no Hoare annotation was computed. [2023-12-16 01:16:00,187 INFO L899 garLoopResultBuilder]: For program point L408(lines 408 423) no Hoare annotation was computed. [2023-12-16 01:16:00,187 INFO L899 garLoopResultBuilder]: For program point L342(lines 342 345) no Hoare annotation was computed. [2023-12-16 01:16:00,187 INFO L899 garLoopResultBuilder]: For program point L342-2(lines 342 345) no Hoare annotation was computed. [2023-12-16 01:16:00,187 INFO L899 garLoopResultBuilder]: For program point L144(lines 144 423) no Hoare annotation was computed. [2023-12-16 01:16:00,187 INFO L899 garLoopResultBuilder]: For program point L541-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,187 INFO L899 garLoopResultBuilder]: For program point L475-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,187 INFO L899 garLoopResultBuilder]: For program point L79(lines 79 423) no Hoare annotation was computed. [2023-12-16 01:16:00,187 INFO L899 garLoopResultBuilder]: For program point L212(lines 212 423) no Hoare annotation was computed. [2023-12-16 01:16:00,187 INFO L899 garLoopResultBuilder]: For program point L213(lines 213 220) no Hoare annotation was computed. [2023-12-16 01:16:00,187 INFO L899 garLoopResultBuilder]: For program point L213-2(lines 213 220) no Hoare annotation was computed. [2023-12-16 01:16:00,187 INFO L899 garLoopResultBuilder]: For program point L610(lines 610 627) no Hoare annotation was computed. [2023-12-16 01:16:00,187 INFO L899 garLoopResultBuilder]: For program point L544-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,187 INFO L899 garLoopResultBuilder]: For program point L478-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,187 INFO L899 garLoopResultBuilder]: For program point L412(lines 412 423) no Hoare annotation was computed. [2023-12-16 01:16:00,187 INFO L899 garLoopResultBuilder]: For program point L347(lines 347 423) no Hoare annotation was computed. [2023-12-16 01:16:00,187 INFO L899 garLoopResultBuilder]: For program point L149(lines 149 423) no Hoare annotation was computed. [2023-12-16 01:16:00,187 INFO L899 garLoopResultBuilder]: For program point L414(lines 414 423) no Hoare annotation was computed. [2023-12-16 01:16:00,188 INFO L899 garLoopResultBuilder]: For program point L348(lines 348 357) no Hoare annotation was computed. [2023-12-16 01:16:00,188 INFO L899 garLoopResultBuilder]: For program point L348-2(lines 348 357) no Hoare annotation was computed. [2023-12-16 01:16:00,188 INFO L899 garLoopResultBuilder]: For program point L84(lines 84 423) no Hoare annotation was computed. [2023-12-16 01:16:00,188 INFO L899 garLoopResultBuilder]: For program point L547-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,188 INFO L899 garLoopResultBuilder]: For program point L481-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,188 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 90) no Hoare annotation was computed. [2023-12-16 01:16:00,188 INFO L899 garLoopResultBuilder]: For program point L85-2(lines 85 90) no Hoare annotation was computed. [2023-12-16 01:16:00,188 INFO L899 garLoopResultBuilder]: For program point L417(lines 417 423) no Hoare annotation was computed. [2023-12-16 01:16:00,188 INFO L899 garLoopResultBuilder]: For program point L153(lines 153 423) no Hoare annotation was computed. [2023-12-16 01:16:00,188 INFO L895 garLoopResultBuilder]: At program point L616-2(lines 616 626) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1))) (let ((.cse5 (<= ~a28~0 7)) (.cse0 (= ~a17~0 8)) (.cse10 (not .cse3)) (.cse1 (= ~a19~0 1)) (.cse6 (= ~a25~0 0)) (.cse9 (<= 9 ~a28~0)) (.cse2 (= ~a25~0 1)) (.cse4 (<= ~a17~0 8)) (.cse7 (<= ~a28~0 10)) (.cse8 (<= ~a19~0 0))) (or (and .cse0 (= ~a28~0 10) .cse1) (and .cse2 .cse3 .cse4 .cse1 .cse5) (and .cse0 (= ~a11~0 0) .cse1 .cse6 .cse5) (and .cse4 .cse7 .cse6 .cse8) (and .cse0 .cse9 .cse2 .cse7 .cse1) (and .cse0 .cse2 .cse1 .cse10) (and .cse0 .cse2 .cse7 .cse10 .cse8) (and (<= 11 ~a28~0) .cse2 .cse4 .cse1 .cse10) (and .cse9 .cse4 .cse7 .cse1 .cse6) (and .cse9 .cse2 .cse4 .cse7 .cse8)))) [2023-12-16 01:16:00,189 INFO L899 garLoopResultBuilder]: For program point L550-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,189 INFO L899 garLoopResultBuilder]: For program point L484-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,189 INFO L899 garLoopResultBuilder]: For program point L286(lines 286 423) no Hoare annotation was computed. [2023-12-16 01:16:00,189 INFO L899 garLoopResultBuilder]: For program point L419(lines 419 423) no Hoare annotation was computed. [2023-12-16 01:16:00,189 INFO L899 garLoopResultBuilder]: For program point L222(lines 222 423) no Hoare annotation was computed. [2023-12-16 01:16:00,189 INFO L899 garLoopResultBuilder]: For program point L553-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,189 INFO L899 garLoopResultBuilder]: For program point L487-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,189 INFO L899 garLoopResultBuilder]: For program point L290(lines 290 423) no Hoare annotation was computed. [2023-12-16 01:16:00,189 INFO L899 garLoopResultBuilder]: For program point L158(lines 158 423) no Hoare annotation was computed. [2023-12-16 01:16:00,189 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 423) no Hoare annotation was computed. [2023-12-16 01:16:00,189 INFO L899 garLoopResultBuilder]: For program point L621(line 621) no Hoare annotation was computed. [2023-12-16 01:16:00,189 INFO L899 garLoopResultBuilder]: For program point L225(lines 225 423) no Hoare annotation was computed. [2023-12-16 01:16:00,189 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 99) no Hoare annotation was computed. [2023-12-16 01:16:00,189 INFO L899 garLoopResultBuilder]: For program point L93-2(lines 93 99) no Hoare annotation was computed. [2023-12-16 01:16:00,189 INFO L899 garLoopResultBuilder]: For program point L556-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,189 INFO L899 garLoopResultBuilder]: For program point L490-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,189 INFO L899 garLoopResultBuilder]: For program point L424(lines 424 426) no Hoare annotation was computed. [2023-12-16 01:16:00,189 INFO L899 garLoopResultBuilder]: For program point L424-2(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,189 INFO L899 garLoopResultBuilder]: For program point L359(lines 359 423) no Hoare annotation was computed. [2023-12-16 01:16:00,190 INFO L899 garLoopResultBuilder]: For program point L293(lines 293 423) no Hoare annotation was computed. [2023-12-16 01:16:00,190 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 01:16:00,190 INFO L899 garLoopResultBuilder]: For program point L228(lines 228 423) no Hoare annotation was computed. [2023-12-16 01:16:00,190 INFO L899 garLoopResultBuilder]: For program point L559-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,190 INFO L899 garLoopResultBuilder]: For program point L493-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,190 INFO L899 garLoopResultBuilder]: For program point L427-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,190 INFO L899 garLoopResultBuilder]: For program point L296(lines 296 423) no Hoare annotation was computed. [2023-12-16 01:16:00,190 INFO L899 garLoopResultBuilder]: For program point L164(lines 164 423) no Hoare annotation was computed. [2023-12-16 01:16:00,190 INFO L899 garLoopResultBuilder]: For program point calculate_output_returnLabel#1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,190 INFO L899 garLoopResultBuilder]: For program point L562-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,190 INFO L899 garLoopResultBuilder]: For program point L496-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,190 INFO L899 garLoopResultBuilder]: For program point L430-1(lines 39 608) no Hoare annotation was computed. [2023-12-16 01:16:00,190 INFO L899 garLoopResultBuilder]: For program point L364(lines 364 423) no Hoare annotation was computed. [2023-12-16 01:16:00,190 INFO L899 garLoopResultBuilder]: For program point L233(lines 233 423) no Hoare annotation was computed. [2023-12-16 01:16:00,190 INFO L899 garLoopResultBuilder]: For program point L101(lines 101 423) no Hoare annotation was computed. [2023-12-16 01:16:00,193 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 01:16:00,194 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 01:16:00,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 01:16:00 BoogieIcfgContainer [2023-12-16 01:16:00,220 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 01:16:00,220 INFO L158 Benchmark]: Toolchain (without parser) took 8848.77ms. Allocated memory was 224.4MB in the beginning and 408.9MB in the end (delta: 184.5MB). Free memory was 168.9MB in the beginning and 343.2MB in the end (delta: -174.3MB). Peak memory consumption was 226.0MB. Max. memory is 8.0GB. [2023-12-16 01:16:00,220 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 224.4MB. Free memory is still 176.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 01:16:00,220 INFO L158 Benchmark]: CACSL2BoogieTranslator took 415.32ms. Allocated memory is still 224.4MB. Free memory was 168.9MB in the beginning and 141.6MB in the end (delta: 27.2MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2023-12-16 01:16:00,221 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.72ms. Allocated memory is still 224.4MB. Free memory was 141.6MB in the beginning and 136.1MB in the end (delta: 5.5MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-16 01:16:00,221 INFO L158 Benchmark]: Boogie Preprocessor took 67.71ms. Allocated memory is still 224.4MB. Free memory was 136.1MB in the beginning and 130.9MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-16 01:16:00,221 INFO L158 Benchmark]: RCFGBuilder took 982.68ms. Allocated memory was 224.4MB in the beginning and 272.6MB in the end (delta: 48.2MB). Free memory was 130.9MB in the beginning and 157.0MB in the end (delta: -26.1MB). Peak memory consumption was 23.2MB. Max. memory is 8.0GB. [2023-12-16 01:16:00,222 INFO L158 Benchmark]: TraceAbstraction took 7312.00ms. Allocated memory was 272.6MB in the beginning and 408.9MB in the end (delta: 136.3MB). Free memory was 155.9MB in the beginning and 343.2MB in the end (delta: -187.2MB). Peak memory consumption was 164.0MB. Max. memory is 8.0GB. [2023-12-16 01:16:00,222 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.41ms. Allocated memory is still 224.4MB. Free memory is still 176.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 415.32ms. Allocated memory is still 224.4MB. Free memory was 168.9MB in the beginning and 141.6MB in the end (delta: 27.2MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.72ms. Allocated memory is still 224.4MB. Free memory was 141.6MB in the beginning and 136.1MB in the end (delta: 5.5MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 67.71ms. Allocated memory is still 224.4MB. Free memory was 136.1MB in the beginning and 130.9MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 982.68ms. Allocated memory was 224.4MB in the beginning and 272.6MB in the end (delta: 48.2MB). Free memory was 130.9MB in the beginning and 157.0MB in the end (delta: -26.1MB). Peak memory consumption was 23.2MB. Max. memory is 8.0GB. * TraceAbstraction took 7312.00ms. Allocated memory was 272.6MB in the beginning and 408.9MB in the end (delta: 136.3MB). Free memory was 155.9MB in the beginning and 343.2MB in the end (delta: -187.2MB). Peak memory consumption was 164.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 581]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 165 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.2s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1399 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1399 mSDsluCounter, 1866 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 153 mSDsCounter, 714 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4123 IncrementalHoareTripleChecker+Invalid, 4837 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 714 mSolverCounterUnsat, 1713 mSDtfsCounter, 4123 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 263 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2278occurred in iteration=7, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 1702 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 14 NumberOfFragments, 152 HoareAnnotationTreeSize, 1 FormulaSimplifications, 81 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FormulaSimplificationsInter, 263 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 2489 NumberOfCodeBlocks, 2489 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2475 ConstructedInterpolants, 0 QuantifiedInterpolants, 5868 SizeOfPredicates, 0 NumberOfNonLiveVariables, 355 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 14 InterpolantComputations, 13 PerfectInterpolantSequences, 954/1012 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: ((((((((((((a17 == 8) && (a28 == 10)) && (a19 == 1)) || (((((a25 == 1) && (a11 == 1)) && (a17 <= 8)) && (a19 == 1)) && (a28 <= 7))) || (((((a17 == 8) && (a11 == 0)) && (a19 == 1)) && (a25 == 0)) && (a28 <= 7))) || ((((a17 <= 8) && (a28 <= 10)) && (a25 == 0)) && (a19 <= 0))) || (((((a17 == 8) && (9 <= a28)) && (a25 == 1)) && (a28 <= 10)) && (a19 == 1))) || ((((a17 == 8) && (a25 == 1)) && (a19 == 1)) && !((a11 == 1)))) || (((((a17 == 8) && (a25 == 1)) && (a28 <= 10)) && !((a11 == 1))) && (a19 <= 0))) || (((((11 <= a28) && (a25 == 1)) && (a17 <= 8)) && (a19 == 1)) && !((a11 == 1)))) || (((((9 <= a28) && (a17 <= 8)) && (a28 <= 10)) && (a19 == 1)) && (a25 == 0))) || (((((9 <= a28) && (a25 == 1)) && (a17 <= 8)) && (a28 <= 10)) && (a19 <= 0))) RESULT: Ultimate proved your program to be correct! [2023-12-16 01:16:00,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...