/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/systemc/kundu1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 05:55:03,913 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 05:55:03,978 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 05:55:03,982 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 05:55:03,982 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 05:55:04,004 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 05:55:04,004 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 05:55:04,005 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 05:55:04,005 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 05:55:04,008 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 05:55:04,008 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 05:55:04,009 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 05:55:04,009 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 05:55:04,010 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 05:55:04,010 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 05:55:04,010 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 05:55:04,010 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 05:55:04,010 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 05:55:04,011 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 05:55:04,011 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 05:55:04,012 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 05:55:04,012 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 05:55:04,012 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 05:55:04,012 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 05:55:04,012 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 05:55:04,013 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 05:55:04,013 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 05:55:04,013 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 05:55:04,013 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 05:55:04,013 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 05:55:04,014 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 05:55:04,014 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 05:55:04,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 05:55:04,014 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 05:55:04,015 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 05:55:04,015 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 05:55:04,015 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 05:55:04,015 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 05:55:04,015 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 05:55:04,015 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 05:55:04,015 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 05:55:04,015 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 05:55:04,015 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 05:55:04,016 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 05:55:04,203 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 05:55:04,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 05:55:04,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 05:55:04,222 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 05:55:04,222 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 05:55:04,223 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/kundu1.cil.c [2023-12-16 05:55:05,297 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 05:55:05,440 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 05:55:05,440 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/kundu1.cil.c [2023-12-16 05:55:05,446 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/340ce5e9c/9dffb0540e8f45acbec6f90ce25108bd/FLAGa457e5ebb [2023-12-16 05:55:05,457 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/340ce5e9c/9dffb0540e8f45acbec6f90ce25108bd [2023-12-16 05:55:05,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 05:55:05,460 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 05:55:05,468 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 05:55:05,468 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 05:55:05,476 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 05:55:05,476 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:55:05" (1/1) ... [2023-12-16 05:55:05,477 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24f5383c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:55:05, skipping insertion in model container [2023-12-16 05:55:05,477 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:55:05" (1/1) ... [2023-12-16 05:55:05,541 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 05:55:05,683 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/kundu1.cil.c[636,649] [2023-12-16 05:55:05,762 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 05:55:05,769 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 05:55:05,776 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/kundu1.cil.c[636,649] [2023-12-16 05:55:05,789 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 05:55:05,799 INFO L206 MainTranslator]: Completed translation [2023-12-16 05:55:05,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:55:05 WrapperNode [2023-12-16 05:55:05,799 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 05:55:05,800 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 05:55:05,800 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 05:55:05,800 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 05:55:05,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:55:05" (1/1) ... [2023-12-16 05:55:05,809 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:55:05" (1/1) ... [2023-12-16 05:55:05,830 INFO L138 Inliner]: procedures = 32, calls = 36, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 258 [2023-12-16 05:55:05,830 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 05:55:05,831 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 05:55:05,831 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 05:55:05,831 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 05:55:05,838 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:55:05" (1/1) ... [2023-12-16 05:55:05,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:55:05" (1/1) ... [2023-12-16 05:55:05,839 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:55:05" (1/1) ... [2023-12-16 05:55:05,848 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 05:55:05,848 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:55:05" (1/1) ... [2023-12-16 05:55:05,848 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:55:05" (1/1) ... [2023-12-16 05:55:05,852 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:55:05" (1/1) ... [2023-12-16 05:55:05,856 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:55:05" (1/1) ... [2023-12-16 05:55:05,857 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:55:05" (1/1) ... [2023-12-16 05:55:05,857 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:55:05" (1/1) ... [2023-12-16 05:55:05,859 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 05:55:05,860 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 05:55:05,860 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 05:55:05,860 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 05:55:05,860 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:55:05" (1/1) ... [2023-12-16 05:55:05,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 05:55:05,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 05:55:05,881 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 05:55:05,897 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 05:55:05,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 05:55:05,919 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-12-16 05:55:05,919 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-12-16 05:55:05,919 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-12-16 05:55:05,919 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-12-16 05:55:05,919 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-12-16 05:55:05,920 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-12-16 05:55:05,920 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-12-16 05:55:05,920 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-12-16 05:55:05,921 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-12-16 05:55:05,921 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-12-16 05:55:05,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 05:55:05,921 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-12-16 05:55:05,922 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-12-16 05:55:05,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 05:55:05,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 05:55:06,020 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 05:55:06,022 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 05:55:06,333 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 05:55:06,395 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 05:55:06,395 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-16 05:55:06,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:55:06 BoogieIcfgContainer [2023-12-16 05:55:06,396 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 05:55:06,397 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 05:55:06,397 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 05:55:06,399 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 05:55:06,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 05:55:05" (1/3) ... [2023-12-16 05:55:06,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18fbba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:55:06, skipping insertion in model container [2023-12-16 05:55:06,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:55:05" (2/3) ... [2023-12-16 05:55:06,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18fbba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:55:06, skipping insertion in model container [2023-12-16 05:55:06,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:55:06" (3/3) ... [2023-12-16 05:55:06,413 INFO L112 eAbstractionObserver]: Analyzing ICFG kundu1.cil.c [2023-12-16 05:55:06,425 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 05:55:06,425 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 05:55:06,486 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 05:55:06,513 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;@26bf7c33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 05:55:06,513 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 05:55:06,516 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 72 states have (on average 1.5833333333333333) internal successors, (114), 76 states have internal predecessors, (114), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 05:55:06,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-16 05:55:06,526 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:55:06,526 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] [2023-12-16 05:55:06,527 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:55:06,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:55:06,532 INFO L85 PathProgramCache]: Analyzing trace with hash 351875085, now seen corresponding path program 1 times [2023-12-16 05:55:06,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:55:06,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806404527] [2023-12-16 05:55:06,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:55:06,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:55:06,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:06,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:55:06,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:06,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 05:55:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:06,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-16 05:55:06,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:06,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 05:55:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:06,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 05:55:06,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:06,804 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 05:55:06,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:55:06,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806404527] [2023-12-16 05:55:06,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806404527] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:55:06,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 05:55:06,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 05:55:06,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279597824] [2023-12-16 05:55:06,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:55:06,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 05:55:06,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:55:06,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 05:55:06,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 05:55:06,830 INFO L87 Difference]: Start difference. First operand has 95 states, 72 states have (on average 1.5833333333333333) internal successors, (114), 76 states have internal predecessors, (114), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 05:55:07,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:55:07,163 INFO L93 Difference]: Finished difference Result 282 states and 434 transitions. [2023-12-16 05:55:07,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 05:55:07,165 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2023-12-16 05:55:07,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:55:07,172 INFO L225 Difference]: With dead ends: 282 [2023-12-16 05:55:07,173 INFO L226 Difference]: Without dead ends: 191 [2023-12-16 05:55:07,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 05:55:07,178 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 271 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 05:55:07,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 532 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 05:55:07,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-12-16 05:55:07,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 163. [2023-12-16 05:55:07,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 129 states have (on average 1.4573643410852712) internal successors, (188), 132 states have internal predecessors, (188), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-16 05:55:07,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 231 transitions. [2023-12-16 05:55:07,219 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 231 transitions. Word has length 44 [2023-12-16 05:55:07,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:55:07,219 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 231 transitions. [2023-12-16 05:55:07,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 05:55:07,219 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 231 transitions. [2023-12-16 05:55:07,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-16 05:55:07,221 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:55:07,221 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] [2023-12-16 05:55:07,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 05:55:07,222 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:55:07,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:55:07,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1419595890, now seen corresponding path program 1 times [2023-12-16 05:55:07,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:55:07,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044415220] [2023-12-16 05:55:07,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:55:07,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:55:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:07,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:55:07,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:07,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 05:55:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:07,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-16 05:55:07,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:07,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 05:55:07,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:07,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 05:55:07,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:07,346 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 05:55:07,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:55:07,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044415220] [2023-12-16 05:55:07,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044415220] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:55:07,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 05:55:07,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 05:55:07,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238918263] [2023-12-16 05:55:07,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:55:07,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 05:55:07,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:55:07,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 05:55:07,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 05:55:07,349 INFO L87 Difference]: Start difference. First operand 163 states and 231 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 05:55:07,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:55:07,463 INFO L93 Difference]: Finished difference Result 334 states and 480 transitions. [2023-12-16 05:55:07,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 05:55:07,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2023-12-16 05:55:07,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:55:07,466 INFO L225 Difference]: With dead ends: 334 [2023-12-16 05:55:07,466 INFO L226 Difference]: Without dead ends: 179 [2023-12-16 05:55:07,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 05:55:07,467 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 48 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 05:55:07,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 398 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 05:55:07,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2023-12-16 05:55:07,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 165. [2023-12-16 05:55:07,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 131 states have (on average 1.4427480916030535) internal successors, (189), 134 states have internal predecessors, (189), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-16 05:55:07,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 232 transitions. [2023-12-16 05:55:07,480 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 232 transitions. Word has length 44 [2023-12-16 05:55:07,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:55:07,480 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 232 transitions. [2023-12-16 05:55:07,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 05:55:07,480 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 232 transitions. [2023-12-16 05:55:07,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-16 05:55:07,481 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:55:07,481 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] [2023-12-16 05:55:07,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 05:55:07,481 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:55:07,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:55:07,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1929068980, now seen corresponding path program 1 times [2023-12-16 05:55:07,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:55:07,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171974920] [2023-12-16 05:55:07,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:55:07,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:55:07,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:07,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:55:07,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:07,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 05:55:07,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:07,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-16 05:55:07,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:07,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 05:55:07,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:07,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 05:55:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:07,617 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 05:55:07,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:55:07,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171974920] [2023-12-16 05:55:07,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171974920] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:55:07,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 05:55:07,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 05:55:07,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280099197] [2023-12-16 05:55:07,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:55:07,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 05:55:07,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:55:07,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 05:55:07,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 05:55:07,619 INFO L87 Difference]: Start difference. First operand 165 states and 232 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 05:55:07,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:55:07,957 INFO L93 Difference]: Finished difference Result 653 states and 933 transitions. [2023-12-16 05:55:07,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 05:55:07,958 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2023-12-16 05:55:07,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:55:07,961 INFO L225 Difference]: With dead ends: 653 [2023-12-16 05:55:07,961 INFO L226 Difference]: Without dead ends: 496 [2023-12-16 05:55:07,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-12-16 05:55:07,962 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 432 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 05:55:07,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 581 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 05:55:07,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2023-12-16 05:55:07,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 302. [2023-12-16 05:55:07,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 242 states have (on average 1.4173553719008265) internal successors, (343), 245 states have internal predecessors, (343), 39 states have call successors, (39), 21 states have call predecessors, (39), 20 states have return successors, (38), 36 states have call predecessors, (38), 36 states have call successors, (38) [2023-12-16 05:55:07,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 420 transitions. [2023-12-16 05:55:07,990 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 420 transitions. Word has length 44 [2023-12-16 05:55:07,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:55:07,990 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 420 transitions. [2023-12-16 05:55:07,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 05:55:07,991 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 420 transitions. [2023-12-16 05:55:07,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-16 05:55:07,992 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:55:07,992 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] [2023-12-16 05:55:07,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 05:55:07,992 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:55:07,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:55:07,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1946946491, now seen corresponding path program 1 times [2023-12-16 05:55:07,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:55:07,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650806837] [2023-12-16 05:55:07,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:55:07,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:55:07,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:08,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:55:08,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:08,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 05:55:08,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:08,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-16 05:55:08,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:08,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 05:55:08,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:08,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 05:55:08,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:08,038 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 05:55:08,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:55:08,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650806837] [2023-12-16 05:55:08,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650806837] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:55:08,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 05:55:08,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 05:55:08,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599994402] [2023-12-16 05:55:08,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:55:08,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 05:55:08,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:55:08,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 05:55:08,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 05:55:08,040 INFO L87 Difference]: Start difference. First operand 302 states and 420 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 05:55:08,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:55:08,294 INFO L93 Difference]: Finished difference Result 1073 states and 1529 transitions. [2023-12-16 05:55:08,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 05:55:08,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 45 [2023-12-16 05:55:08,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:55:08,301 INFO L225 Difference]: With dead ends: 1073 [2023-12-16 05:55:08,301 INFO L226 Difference]: Without dead ends: 779 [2023-12-16 05:55:08,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 05:55:08,310 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 270 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 05:55:08,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 610 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 05:55:08,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2023-12-16 05:55:08,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 687. [2023-12-16 05:55:08,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 549 states have (on average 1.3624772313296905) internal successors, (748), 552 states have internal predecessors, (748), 87 states have call successors, (87), 51 states have call predecessors, (87), 50 states have return successors, (98), 84 states have call predecessors, (98), 84 states have call successors, (98) [2023-12-16 05:55:08,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 933 transitions. [2023-12-16 05:55:08,374 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 933 transitions. Word has length 45 [2023-12-16 05:55:08,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:55:08,375 INFO L495 AbstractCegarLoop]: Abstraction has 687 states and 933 transitions. [2023-12-16 05:55:08,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 05:55:08,375 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 933 transitions. [2023-12-16 05:55:08,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-16 05:55:08,376 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:55:08,376 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] [2023-12-16 05:55:08,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 05:55:08,377 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:55:08,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:55:08,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1308162012, now seen corresponding path program 1 times [2023-12-16 05:55:08,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:55:08,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484032340] [2023-12-16 05:55:08,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:55:08,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:55:08,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:08,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:55:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:08,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 05:55:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:08,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-16 05:55:08,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:08,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 05:55:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:08,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 05:55:08,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:08,450 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 05:55:08,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:55:08,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484032340] [2023-12-16 05:55:08,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484032340] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:55:08,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 05:55:08,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 05:55:08,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425943788] [2023-12-16 05:55:08,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:55:08,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 05:55:08,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:55:08,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 05:55:08,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 05:55:08,452 INFO L87 Difference]: Start difference. First operand 687 states and 933 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 05:55:08,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:55:08,555 INFO L93 Difference]: Finished difference Result 1420 states and 1981 transitions. [2023-12-16 05:55:08,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 05:55:08,556 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 45 [2023-12-16 05:55:08,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:55:08,559 INFO L225 Difference]: With dead ends: 1420 [2023-12-16 05:55:08,559 INFO L226 Difference]: Without dead ends: 741 [2023-12-16 05:55:08,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 05:55:08,560 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 37 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 05:55:08,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 383 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 05:55:08,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2023-12-16 05:55:08,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 699. [2023-12-16 05:55:08,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 561 states have (on average 1.3475935828877006) internal successors, (756), 564 states have internal predecessors, (756), 87 states have call successors, (87), 51 states have call predecessors, (87), 50 states have return successors, (98), 84 states have call predecessors, (98), 84 states have call successors, (98) [2023-12-16 05:55:08,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 941 transitions. [2023-12-16 05:55:08,593 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 941 transitions. Word has length 45 [2023-12-16 05:55:08,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:55:08,593 INFO L495 AbstractCegarLoop]: Abstraction has 699 states and 941 transitions. [2023-12-16 05:55:08,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 05:55:08,593 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 941 transitions. [2023-12-16 05:55:08,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-16 05:55:08,594 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:55:08,594 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] [2023-12-16 05:55:08,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 05:55:08,594 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:55:08,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:55:08,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1181366950, now seen corresponding path program 1 times [2023-12-16 05:55:08,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:55:08,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714307608] [2023-12-16 05:55:08,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:55:08,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:55:08,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:08,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:55:08,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:08,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 05:55:08,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:08,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-16 05:55:08,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:08,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 05:55:08,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:08,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 05:55:08,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:08,633 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 05:55:08,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:55:08,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714307608] [2023-12-16 05:55:08,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714307608] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:55:08,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 05:55:08,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 05:55:08,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355006354] [2023-12-16 05:55:08,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:55:08,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 05:55:08,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:55:08,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 05:55:08,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 05:55:08,657 INFO L87 Difference]: Start difference. First operand 699 states and 941 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-16 05:55:08,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:55:08,797 INFO L93 Difference]: Finished difference Result 1884 states and 2563 transitions. [2023-12-16 05:55:08,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 05:55:08,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 45 [2023-12-16 05:55:08,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:55:08,802 INFO L225 Difference]: With dead ends: 1884 [2023-12-16 05:55:08,802 INFO L226 Difference]: Without dead ends: 1255 [2023-12-16 05:55:08,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 05:55:08,804 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 164 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 05:55:08,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 399 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 05:55:08,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2023-12-16 05:55:08,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1172. [2023-12-16 05:55:08,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1172 states, 943 states have (on average 1.3435843054082715) internal successors, (1267), 946 states have internal predecessors, (1267), 143 states have call successors, (143), 86 states have call predecessors, (143), 85 states have return successors, (166), 140 states have call predecessors, (166), 140 states have call successors, (166) [2023-12-16 05:55:08,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1576 transitions. [2023-12-16 05:55:08,851 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1576 transitions. Word has length 45 [2023-12-16 05:55:08,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:55:08,851 INFO L495 AbstractCegarLoop]: Abstraction has 1172 states and 1576 transitions. [2023-12-16 05:55:08,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-16 05:55:08,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1576 transitions. [2023-12-16 05:55:08,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-16 05:55:08,852 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:55:08,852 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] [2023-12-16 05:55:08,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 05:55:08,853 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:55:08,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:55:08,853 INFO L85 PathProgramCache]: Analyzing trace with hash -741508000, now seen corresponding path program 1 times [2023-12-16 05:55:08,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:55:08,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316318251] [2023-12-16 05:55:08,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:55:08,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:55:08,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:08,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:55:08,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:08,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 05:55:08,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:08,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-16 05:55:08,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:08,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 05:55:08,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:08,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 05:55:08,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:08,901 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 05:55:08,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:55:08,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316318251] [2023-12-16 05:55:08,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316318251] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:55:08,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 05:55:08,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 05:55:08,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941315984] [2023-12-16 05:55:08,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:55:08,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 05:55:08,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:55:08,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 05:55:08,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 05:55:08,902 INFO L87 Difference]: Start difference. First operand 1172 states and 1576 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-16 05:55:09,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:55:09,089 INFO L93 Difference]: Finished difference Result 2250 states and 3058 transitions. [2023-12-16 05:55:09,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 05:55:09,090 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 53 [2023-12-16 05:55:09,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:55:09,095 INFO L225 Difference]: With dead ends: 2250 [2023-12-16 05:55:09,095 INFO L226 Difference]: Without dead ends: 1415 [2023-12-16 05:55:09,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-16 05:55:09,097 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 375 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 05:55:09,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 502 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 05:55:09,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2023-12-16 05:55:09,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1317. [2023-12-16 05:55:09,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1317 states, 1062 states have (on average 1.3408662900188324) internal successors, (1424), 1065 states have internal predecessors, (1424), 159 states have call successors, (159), 96 states have call predecessors, (159), 95 states have return successors, (184), 156 states have call predecessors, (184), 156 states have call successors, (184) [2023-12-16 05:55:09,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1767 transitions. [2023-12-16 05:55:09,180 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1767 transitions. Word has length 53 [2023-12-16 05:55:09,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:55:09,180 INFO L495 AbstractCegarLoop]: Abstraction has 1317 states and 1767 transitions. [2023-12-16 05:55:09,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-16 05:55:09,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1767 transitions. [2023-12-16 05:55:09,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-16 05:55:09,181 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:55:09,181 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] [2023-12-16 05:55:09,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 05:55:09,182 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:55:09,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:55:09,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1263305305, now seen corresponding path program 1 times [2023-12-16 05:55:09,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:55:09,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515652403] [2023-12-16 05:55:09,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:55:09,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:55:09,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:09,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:55:09,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:09,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 05:55:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:09,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-16 05:55:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:09,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 05:55:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:09,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 05:55:09,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:09,253 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 05:55:09,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:55:09,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515652403] [2023-12-16 05:55:09,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515652403] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:55:09,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 05:55:09,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 05:55:09,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297146556] [2023-12-16 05:55:09,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:55:09,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 05:55:09,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:55:09,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 05:55:09,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-16 05:55:09,255 INFO L87 Difference]: Start difference. First operand 1317 states and 1767 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-16 05:55:09,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:55:09,487 INFO L93 Difference]: Finished difference Result 3271 states and 4430 transitions. [2023-12-16 05:55:09,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 05:55:09,488 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 56 [2023-12-16 05:55:09,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:55:09,494 INFO L225 Difference]: With dead ends: 3271 [2023-12-16 05:55:09,494 INFO L226 Difference]: Without dead ends: 2024 [2023-12-16 05:55:09,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-12-16 05:55:09,497 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 368 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 05:55:09,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 558 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 05:55:09,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2024 states. [2023-12-16 05:55:09,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2024 to 1868. [2023-12-16 05:55:09,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1868 states, 1509 states have (on average 1.3386348575215374) internal successors, (2020), 1512 states have internal predecessors, (2020), 223 states have call successors, (223), 136 states have call predecessors, (223), 135 states have return successors, (262), 220 states have call predecessors, (262), 220 states have call successors, (262) [2023-12-16 05:55:09,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1868 states to 1868 states and 2505 transitions. [2023-12-16 05:55:09,560 INFO L78 Accepts]: Start accepts. Automaton has 1868 states and 2505 transitions. Word has length 56 [2023-12-16 05:55:09,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:55:09,560 INFO L495 AbstractCegarLoop]: Abstraction has 1868 states and 2505 transitions. [2023-12-16 05:55:09,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-16 05:55:09,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1868 states and 2505 transitions. [2023-12-16 05:55:09,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-16 05:55:09,561 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:55:09,561 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-16 05:55:09,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 05:55:09,561 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:55:09,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:55:09,562 INFO L85 PathProgramCache]: Analyzing trace with hash -109102014, now seen corresponding path program 1 times [2023-12-16 05:55:09,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:55:09,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064776624] [2023-12-16 05:55:09,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:55:09,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:55:09,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:09,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:55:09,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:09,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 05:55:09,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:09,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-16 05:55:09,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:09,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 05:55:09,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:09,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 05:55:09,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:09,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-16 05:55:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:09,626 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-16 05:55:09,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:55:09,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064776624] [2023-12-16 05:55:09,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064776624] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 05:55:09,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241008827] [2023-12-16 05:55:09,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:55:09,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 05:55:09,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 05:55:09,668 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 05:55:09,720 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 05:55:09,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:09,790 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 05:55:09,793 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 05:55:09,818 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 05:55:09,818 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 05:55:09,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241008827] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:55:09,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 05:55:09,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-12-16 05:55:09,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384016286] [2023-12-16 05:55:09,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:55:09,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 05:55:09,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:55:09,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 05:55:09,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 05:55:09,820 INFO L87 Difference]: Start difference. First operand 1868 states and 2505 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 05:55:09,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:55:09,925 INFO L93 Difference]: Finished difference Result 5196 states and 7106 transitions. [2023-12-16 05:55:09,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 05:55:09,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 61 [2023-12-16 05:55:09,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:55:09,937 INFO L225 Difference]: With dead ends: 5196 [2023-12-16 05:55:09,937 INFO L226 Difference]: Without dead ends: 3337 [2023-12-16 05:55:09,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 05:55:09,942 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 86 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 05:55:09,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 310 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 05:55:09,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3337 states. [2023-12-16 05:55:10,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3337 to 3212. [2023-12-16 05:55:10,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3212 states, 2564 states have (on average 1.3151326053042123) internal successors, (3372), 2568 states have internal predecessors, (3372), 402 states have call successors, (402), 246 states have call predecessors, (402), 245 states have return successors, (553), 399 states have call predecessors, (553), 399 states have call successors, (553) [2023-12-16 05:55:10,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3212 states to 3212 states and 4327 transitions. [2023-12-16 05:55:10,074 INFO L78 Accepts]: Start accepts. Automaton has 3212 states and 4327 transitions. Word has length 61 [2023-12-16 05:55:10,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:55:10,074 INFO L495 AbstractCegarLoop]: Abstraction has 3212 states and 4327 transitions. [2023-12-16 05:55:10,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 05:55:10,074 INFO L276 IsEmpty]: Start isEmpty. Operand 3212 states and 4327 transitions. [2023-12-16 05:55:10,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-16 05:55:10,076 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:55:10,076 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-16 05:55:10,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-16 05:55:10,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 05:55:10,284 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:55:10,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:55:10,284 INFO L85 PathProgramCache]: Analyzing trace with hash -376855157, now seen corresponding path program 1 times [2023-12-16 05:55:10,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:55:10,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511444084] [2023-12-16 05:55:10,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:55:10,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:55:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:10,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:55:10,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:10,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 05:55:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:10,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-16 05:55:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:10,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 05:55:10,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:10,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 05:55:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:10,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 05:55:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:10,356 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 05:55:10,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:55:10,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511444084] [2023-12-16 05:55:10,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511444084] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:55:10,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 05:55:10,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 05:55:10,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950375548] [2023-12-16 05:55:10,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:55:10,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 05:55:10,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:55:10,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 05:55:10,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 05:55:10,358 INFO L87 Difference]: Start difference. First operand 3212 states and 4327 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-16 05:55:10,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:55:10,651 INFO L93 Difference]: Finished difference Result 6660 states and 9019 transitions. [2023-12-16 05:55:10,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 05:55:10,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 62 [2023-12-16 05:55:10,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:55:10,675 INFO L225 Difference]: With dead ends: 6660 [2023-12-16 05:55:10,675 INFO L226 Difference]: Without dead ends: 3461 [2023-12-16 05:55:10,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-16 05:55:10,692 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 149 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 05:55:10,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 362 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 05:55:10,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3461 states. [2023-12-16 05:55:10,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3461 to 3250. [2023-12-16 05:55:10,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3250 states, 2583 states have (on average 1.2942315137437088) internal successors, (3343), 2606 states have internal predecessors, (3343), 402 states have call successors, (402), 246 states have call predecessors, (402), 264 states have return successors, (553), 399 states have call predecessors, (553), 399 states have call successors, (553) [2023-12-16 05:55:10,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3250 states to 3250 states and 4298 transitions. [2023-12-16 05:55:10,901 INFO L78 Accepts]: Start accepts. Automaton has 3250 states and 4298 transitions. Word has length 62 [2023-12-16 05:55:10,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:55:10,902 INFO L495 AbstractCegarLoop]: Abstraction has 3250 states and 4298 transitions. [2023-12-16 05:55:10,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-16 05:55:10,902 INFO L276 IsEmpty]: Start isEmpty. Operand 3250 states and 4298 transitions. [2023-12-16 05:55:10,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-16 05:55:10,903 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:55:10,903 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-16 05:55:10,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 05:55:10,903 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:55:10,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:55:10,904 INFO L85 PathProgramCache]: Analyzing trace with hash -336180407, now seen corresponding path program 1 times [2023-12-16 05:55:10,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:55:10,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915290732] [2023-12-16 05:55:10,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:55:10,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:55:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:10,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:55:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:10,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 05:55:10,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:10,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-16 05:55:10,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:10,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 05:55:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:10,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 05:55:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:10,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 05:55:10,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:10,930 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-16 05:55:10,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:55:10,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915290732] [2023-12-16 05:55:10,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915290732] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:55:10,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 05:55:10,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 05:55:10,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184947364] [2023-12-16 05:55:10,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:55:10,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 05:55:10,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:55:10,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 05:55:10,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 05:55:10,931 INFO L87 Difference]: Start difference. First operand 3250 states and 4298 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 05:55:11,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:55:11,059 INFO L93 Difference]: Finished difference Result 3660 states and 4878 transitions. [2023-12-16 05:55:11,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 05:55:11,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2023-12-16 05:55:11,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:55:11,069 INFO L225 Difference]: With dead ends: 3660 [2023-12-16 05:55:11,069 INFO L226 Difference]: Without dead ends: 3476 [2023-12-16 05:55:11,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 05:55:11,071 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 162 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 05:55:11,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 178 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 05:55:11,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3476 states. [2023-12-16 05:55:11,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3476 to 3187. [2023-12-16 05:55:11,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3187 states, 2536 states have (on average 1.2953470031545742) internal successors, (3285), 2558 states have internal predecessors, (3285), 391 states have call successors, (391), 241 states have call predecessors, (391), 259 states have return successors, (542), 388 states have call predecessors, (542), 388 states have call successors, (542) [2023-12-16 05:55:11,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3187 states to 3187 states and 4218 transitions. [2023-12-16 05:55:11,240 INFO L78 Accepts]: Start accepts. Automaton has 3187 states and 4218 transitions. Word has length 62 [2023-12-16 05:55:11,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:55:11,240 INFO L495 AbstractCegarLoop]: Abstraction has 3187 states and 4218 transitions. [2023-12-16 05:55:11,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 05:55:11,240 INFO L276 IsEmpty]: Start isEmpty. Operand 3187 states and 4218 transitions. [2023-12-16 05:55:11,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-16 05:55:11,243 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:55:11,243 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-16 05:55:11,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-16 05:55:11,243 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:55:11,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:55:11,243 INFO L85 PathProgramCache]: Analyzing trace with hash 90638681, now seen corresponding path program 1 times [2023-12-16 05:55:11,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:55:11,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387622008] [2023-12-16 05:55:11,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:55:11,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:55:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:11,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:55:11,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:11,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 05:55:11,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:11,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-16 05:55:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:11,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 05:55:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:11,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 05:55:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:11,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 05:55:11,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:11,301 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-16 05:55:11,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:55:11,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387622008] [2023-12-16 05:55:11,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387622008] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:55:11,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 05:55:11,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 05:55:11,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385521233] [2023-12-16 05:55:11,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:55:11,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 05:55:11,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:55:11,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 05:55:11,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 05:55:11,303 INFO L87 Difference]: Start difference. First operand 3187 states and 4218 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-16 05:55:11,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:55:11,913 INFO L93 Difference]: Finished difference Result 9519 states and 12993 transitions. [2023-12-16 05:55:11,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 05:55:11,928 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 63 [2023-12-16 05:55:11,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:55:11,954 INFO L225 Difference]: With dead ends: 9519 [2023-12-16 05:55:11,954 INFO L226 Difference]: Without dead ends: 6176 [2023-12-16 05:55:11,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-12-16 05:55:11,977 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 577 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 05:55:11,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 635 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 05:55:11,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6176 states. [2023-12-16 05:55:12,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6176 to 6046. [2023-12-16 05:55:12,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6046 states, 4768 states have (on average 1.2523070469798658) internal successors, (5971), 4830 states have internal predecessors, (5971), 754 states have call successors, (754), 466 states have call predecessors, (754), 523 states have return successors, (1151), 751 states have call predecessors, (1151), 751 states have call successors, (1151) [2023-12-16 05:55:12,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6046 states to 6046 states and 7876 transitions. [2023-12-16 05:55:12,354 INFO L78 Accepts]: Start accepts. Automaton has 6046 states and 7876 transitions. Word has length 63 [2023-12-16 05:55:12,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:55:12,354 INFO L495 AbstractCegarLoop]: Abstraction has 6046 states and 7876 transitions. [2023-12-16 05:55:12,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-16 05:55:12,355 INFO L276 IsEmpty]: Start isEmpty. Operand 6046 states and 7876 transitions. [2023-12-16 05:55:12,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-16 05:55:12,359 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:55:12,359 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 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] [2023-12-16 05:55:12,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-16 05:55:12,359 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:55:12,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:55:12,359 INFO L85 PathProgramCache]: Analyzing trace with hash 551115313, now seen corresponding path program 1 times [2023-12-16 05:55:12,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:55:12,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275240110] [2023-12-16 05:55:12,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:55:12,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:55:12,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:12,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:55:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:12,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 05:55:12,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:12,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-16 05:55:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:12,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 05:55:12,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:12,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 05:55:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:12,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 05:55:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:12,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-12-16 05:55:12,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:12,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 05:55:12,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:12,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-12-16 05:55:12,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:12,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 05:55:12,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:12,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 05:55:12,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:12,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-16 05:55:12,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:12,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-16 05:55:12,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:12,434 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-12-16 05:55:12,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:55:12,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275240110] [2023-12-16 05:55:12,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275240110] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 05:55:12,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100731506] [2023-12-16 05:55:12,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:55:12,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 05:55:12,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 05:55:12,435 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 05:55:12,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-16 05:55:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:12,519 INFO L262 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 05:55:12,522 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 05:55:12,582 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-12-16 05:55:12,582 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 05:55:12,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100731506] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:55:12,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 05:55:12,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2023-12-16 05:55:12,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697001977] [2023-12-16 05:55:12,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:55:12,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 05:55:12,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:55:12,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 05:55:12,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-16 05:55:12,583 INFO L87 Difference]: Start difference. First operand 6046 states and 7876 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 05:55:12,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:55:12,795 INFO L93 Difference]: Finished difference Result 10046 states and 13154 transitions. [2023-12-16 05:55:12,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 05:55:12,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 113 [2023-12-16 05:55:12,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:55:12,807 INFO L225 Difference]: With dead ends: 10046 [2023-12-16 05:55:12,807 INFO L226 Difference]: Without dead ends: 3828 [2023-12-16 05:55:12,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-16 05:55:12,818 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 72 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 05:55:12,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 116 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 05:55:12,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3828 states. [2023-12-16 05:55:12,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3828 to 3824. [2023-12-16 05:55:12,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3824 states, 3016 states have (on average 1.2374005305039788) internal successors, (3732), 3052 states have internal predecessors, (3732), 478 states have call successors, (478), 296 states have call predecessors, (478), 329 states have return successors, (694), 476 states have call predecessors, (694), 476 states have call successors, (694) [2023-12-16 05:55:12,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3824 states to 3824 states and 4904 transitions. [2023-12-16 05:55:12,956 INFO L78 Accepts]: Start accepts. Automaton has 3824 states and 4904 transitions. Word has length 113 [2023-12-16 05:55:12,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:55:12,956 INFO L495 AbstractCegarLoop]: Abstraction has 3824 states and 4904 transitions. [2023-12-16 05:55:12,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 05:55:12,956 INFO L276 IsEmpty]: Start isEmpty. Operand 3824 states and 4904 transitions. [2023-12-16 05:55:12,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-16 05:55:12,959 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:55:12,959 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 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] [2023-12-16 05:55:12,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-16 05:55:13,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-16 05:55:13,180 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:55:13,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:55:13,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1763703259, now seen corresponding path program 1 times [2023-12-16 05:55:13,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:55:13,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076331586] [2023-12-16 05:55:13,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:55:13,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:55:13,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:13,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:55:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:13,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 05:55:13,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:13,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-16 05:55:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:13,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 05:55:13,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:13,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 05:55:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:13,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 05:55:13,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:13,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 05:55:13,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:13,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-16 05:55:13,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:13,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-16 05:55:13,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:13,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 05:55:13,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:13,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 05:55:13,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:13,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-16 05:55:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:13,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-12-16 05:55:13,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:13,254 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-12-16 05:55:13,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:55:13,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076331586] [2023-12-16 05:55:13,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076331586] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 05:55:13,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249539160] [2023-12-16 05:55:13,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:55:13,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 05:55:13,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 05:55:13,269 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 05:55:13,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-16 05:55:13,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:13,353 INFO L262 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 05:55:13,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 05:55:13,409 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-16 05:55:13,409 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 05:55:13,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249539160] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:55:13,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 05:55:13,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2023-12-16 05:55:13,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819627990] [2023-12-16 05:55:13,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:55:13,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 05:55:13,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:55:13,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 05:55:13,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-16 05:55:13,410 INFO L87 Difference]: Start difference. First operand 3824 states and 4904 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 05:55:13,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:55:13,618 INFO L93 Difference]: Finished difference Result 8159 states and 10428 transitions. [2023-12-16 05:55:13,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 05:55:13,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2023-12-16 05:55:13,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:55:13,650 INFO L225 Difference]: With dead ends: 8159 [2023-12-16 05:55:13,650 INFO L226 Difference]: Without dead ends: 4632 [2023-12-16 05:55:13,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-16 05:55:13,659 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 43 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 05:55:13,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 224 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 05:55:13,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2023-12-16 05:55:13,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4632. [2023-12-16 05:55:13,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4632 states, 3640 states have (on average 1.2230769230769232) internal successors, (4452), 3680 states have internal predecessors, (4452), 583 states have call successors, (583), 371 states have call predecessors, (583), 408 states have return successors, (809), 581 states have call predecessors, (809), 581 states have call successors, (809) [2023-12-16 05:55:13,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 5844 transitions. [2023-12-16 05:55:13,874 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 5844 transitions. Word has length 115 [2023-12-16 05:55:13,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:55:13,874 INFO L495 AbstractCegarLoop]: Abstraction has 4632 states and 5844 transitions. [2023-12-16 05:55:13,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 05:55:13,875 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 5844 transitions. [2023-12-16 05:55:13,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-16 05:55:13,879 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:55:13,879 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:55:13,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-16 05:55:14,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 05:55:14,084 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:55:14,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:55:14,085 INFO L85 PathProgramCache]: Analyzing trace with hash -607311514, now seen corresponding path program 1 times [2023-12-16 05:55:14,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:55:14,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873152862] [2023-12-16 05:55:14,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:55:14,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:55:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:14,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:55:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:14,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 05:55:14,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:14,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-16 05:55:14,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:14,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 05:55:14,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:14,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 05:55:14,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:14,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 05:55:14,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:14,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 05:55:14,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:14,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-16 05:55:14,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:14,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-16 05:55:14,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:14,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-12-16 05:55:14,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:14,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-16 05:55:14,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:14,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 05:55:14,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:14,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-16 05:55:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:14,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-16 05:55:14,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:14,177 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2023-12-16 05:55:14,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:55:14,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873152862] [2023-12-16 05:55:14,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873152862] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 05:55:14,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555320521] [2023-12-16 05:55:14,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:55:14,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 05:55:14,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 05:55:14,179 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 05:55:14,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-16 05:55:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:14,252 INFO L262 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 05:55:14,257 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 05:55:14,283 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-16 05:55:14,283 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 05:55:14,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555320521] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:55:14,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 05:55:14,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2023-12-16 05:55:14,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283006420] [2023-12-16 05:55:14,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:55:14,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 05:55:14,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:55:14,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 05:55:14,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-16 05:55:14,284 INFO L87 Difference]: Start difference. First operand 4632 states and 5844 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-16 05:55:14,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:55:14,522 INFO L93 Difference]: Finished difference Result 12231 states and 15568 transitions. [2023-12-16 05:55:14,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 05:55:14,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 135 [2023-12-16 05:55:14,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:55:14,544 INFO L225 Difference]: With dead ends: 12231 [2023-12-16 05:55:14,544 INFO L226 Difference]: Without dead ends: 7814 [2023-12-16 05:55:14,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-16 05:55:14,555 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 89 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 05:55:14,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 306 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 05:55:14,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7814 states. [2023-12-16 05:55:14,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7814 to 7810. [2023-12-16 05:55:14,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7810 states, 6166 states have (on average 1.1959130716834252) internal successors, (7374), 6222 states have internal predecessors, (7374), 947 states have call successors, (947), 643 states have call predecessors, (947), 696 states have return successors, (1365), 945 states have call predecessors, (1365), 945 states have call successors, (1365) [2023-12-16 05:55:14,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7810 states to 7810 states and 9686 transitions. [2023-12-16 05:55:14,873 INFO L78 Accepts]: Start accepts. Automaton has 7810 states and 9686 transitions. Word has length 135 [2023-12-16 05:55:14,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:55:14,873 INFO L495 AbstractCegarLoop]: Abstraction has 7810 states and 9686 transitions. [2023-12-16 05:55:14,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-16 05:55:14,873 INFO L276 IsEmpty]: Start isEmpty. Operand 7810 states and 9686 transitions. [2023-12-16 05:55:14,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-16 05:55:14,876 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:55:14,877 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:55:14,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-16 05:55:15,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-16 05:55:15,083 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:55:15,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:55:15,084 INFO L85 PathProgramCache]: Analyzing trace with hash -629943768, now seen corresponding path program 1 times [2023-12-16 05:55:15,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:55:15,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111489321] [2023-12-16 05:55:15,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:55:15,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:55:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:15,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:55:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:15,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 05:55:15,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:15,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-16 05:55:15,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:15,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 05:55:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:15,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 05:55:15,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:15,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 05:55:15,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:15,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 05:55:15,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:15,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-16 05:55:15,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:15,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-16 05:55:15,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:15,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-12-16 05:55:15,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:15,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-16 05:55:15,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:15,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 05:55:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:15,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-16 05:55:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:15,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-16 05:55:15,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:15,179 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2023-12-16 05:55:15,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:55:15,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111489321] [2023-12-16 05:55:15,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111489321] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 05:55:15,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224742344] [2023-12-16 05:55:15,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:55:15,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 05:55:15,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 05:55:15,180 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 05:55:15,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-16 05:55:15,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:15,302 INFO L262 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 05:55:15,305 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 05:55:15,426 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-12-16 05:55:15,427 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 05:55:15,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224742344] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:55:15,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 05:55:15,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2023-12-16 05:55:15,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130927669] [2023-12-16 05:55:15,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:55:15,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 05:55:15,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:55:15,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 05:55:15,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-16 05:55:15,428 INFO L87 Difference]: Start difference. First operand 7810 states and 9686 transitions. Second operand has 6 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 05:55:15,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:55:15,591 INFO L93 Difference]: Finished difference Result 12624 states and 15700 transitions. [2023-12-16 05:55:15,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 05:55:15,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 135 [2023-12-16 05:55:15,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:55:15,602 INFO L225 Difference]: With dead ends: 12624 [2023-12-16 05:55:15,602 INFO L226 Difference]: Without dead ends: 4823 [2023-12-16 05:55:15,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-12-16 05:55:15,615 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 43 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 05:55:15,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 534 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 05:55:15,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4823 states. [2023-12-16 05:55:15,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4823 to 4531. [2023-12-16 05:55:15,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4531 states, 3758 states have (on average 1.1971793507184674) internal successors, (4499), 3770 states have internal predecessors, (4499), 440 states have call successors, (440), 276 states have call predecessors, (440), 332 states have return successors, (645), 484 states have call predecessors, (645), 438 states have call successors, (645) [2023-12-16 05:55:15,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4531 states to 4531 states and 5584 transitions. [2023-12-16 05:55:15,758 INFO L78 Accepts]: Start accepts. Automaton has 4531 states and 5584 transitions. Word has length 135 [2023-12-16 05:55:15,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:55:15,758 INFO L495 AbstractCegarLoop]: Abstraction has 4531 states and 5584 transitions. [2023-12-16 05:55:15,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 05:55:15,758 INFO L276 IsEmpty]: Start isEmpty. Operand 4531 states and 5584 transitions. [2023-12-16 05:55:15,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-12-16 05:55:15,761 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:55:15,761 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:55:15,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-16 05:55:15,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-16 05:55:15,967 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:55:15,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:55:15,968 INFO L85 PathProgramCache]: Analyzing trace with hash 92477145, now seen corresponding path program 1 times [2023-12-16 05:55:15,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:55:15,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248092447] [2023-12-16 05:55:15,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:55:15,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:55:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:16,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:55:16,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:16,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 05:55:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:16,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-16 05:55:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:16,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 05:55:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:16,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 05:55:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:16,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 05:55:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:16,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-16 05:55:16,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:16,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-16 05:55:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:16,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-12-16 05:55:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:16,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-16 05:55:16,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:16,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-16 05:55:16,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:16,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-16 05:55:16,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:16,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-16 05:55:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:16,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-12-16 05:55:16,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:16,049 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2023-12-16 05:55:16,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:55:16,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248092447] [2023-12-16 05:55:16,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248092447] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:55:16,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 05:55:16,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 05:55:16,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853897004] [2023-12-16 05:55:16,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:55:16,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 05:55:16,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:55:16,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 05:55:16,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 05:55:16,050 INFO L87 Difference]: Start difference. First operand 4531 states and 5584 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-16 05:55:16,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:55:16,252 INFO L93 Difference]: Finished difference Result 4695 states and 5778 transitions. [2023-12-16 05:55:16,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 05:55:16,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 139 [2023-12-16 05:55:16,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:55:16,261 INFO L225 Difference]: With dead ends: 4695 [2023-12-16 05:55:16,261 INFO L226 Difference]: Without dead ends: 4450 [2023-12-16 05:55:16,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 05:55:16,263 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 84 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 05:55:16,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 252 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 05:55:16,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4450 states. [2023-12-16 05:55:16,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4450 to 4289. [2023-12-16 05:55:16,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4289 states, 3558 states have (on average 1.2003934794828555) internal successors, (4271), 3569 states have internal predecessors, (4271), 417 states have call successors, (417), 260 states have call predecessors, (417), 313 states have return successors, (619), 459 states have call predecessors, (619), 415 states have call successors, (619) [2023-12-16 05:55:16,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4289 states to 4289 states and 5307 transitions. [2023-12-16 05:55:16,442 INFO L78 Accepts]: Start accepts. Automaton has 4289 states and 5307 transitions. Word has length 139 [2023-12-16 05:55:16,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:55:16,442 INFO L495 AbstractCegarLoop]: Abstraction has 4289 states and 5307 transitions. [2023-12-16 05:55:16,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-16 05:55:16,443 INFO L276 IsEmpty]: Start isEmpty. Operand 4289 states and 5307 transitions. [2023-12-16 05:55:16,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-16 05:55:16,445 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:55:16,445 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:55:16,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-16 05:55:16,445 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:55:16,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:55:16,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1401567099, now seen corresponding path program 1 times [2023-12-16 05:55:16,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:55:16,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250108380] [2023-12-16 05:55:16,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:55:16,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:55:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:16,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:55:16,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:16,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 05:55:16,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:16,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-16 05:55:16,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:16,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 05:55:16,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:16,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 05:55:16,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:16,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 05:55:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:16,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 05:55:16,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:16,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 05:55:16,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:16,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 05:55:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:16,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-16 05:55:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:16,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 05:55:16,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:16,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 05:55:16,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:16,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 05:55:16,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:16,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-16 05:55:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:16,534 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 14 proven. 23 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-12-16 05:55:16,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:55:16,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250108380] [2023-12-16 05:55:16,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250108380] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 05:55:16,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921110795] [2023-12-16 05:55:16,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:55:16,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 05:55:16,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 05:55:16,549 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 05:55:16,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-16 05:55:16,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:16,640 INFO L262 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 05:55:16,642 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 05:55:16,713 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-16 05:55:16,713 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 05:55:16,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921110795] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:55:16,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 05:55:16,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2023-12-16 05:55:16,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469412141] [2023-12-16 05:55:16,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:55:16,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 05:55:16,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:55:16,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 05:55:16,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-16 05:55:16,714 INFO L87 Difference]: Start difference. First operand 4289 states and 5307 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-16 05:55:16,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:55:16,855 INFO L93 Difference]: Finished difference Result 8042 states and 9995 transitions. [2023-12-16 05:55:16,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 05:55:16,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 144 [2023-12-16 05:55:16,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:55:16,864 INFO L225 Difference]: With dead ends: 8042 [2023-12-16 05:55:16,864 INFO L226 Difference]: Without dead ends: 3984 [2023-12-16 05:55:16,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-16 05:55:16,870 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 24 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 05:55:16,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 217 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 05:55:16,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3984 states. [2023-12-16 05:55:16,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3984 to 3984. [2023-12-16 05:55:16,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3984 states, 3322 states have (on average 1.2034918723660446) internal successors, (3998), 3333 states have internal predecessors, (3998), 377 states have call successors, (377), 234 states have call predecessors, (377), 284 states have return successors, (568), 416 states have call predecessors, (568), 375 states have call successors, (568) [2023-12-16 05:55:16,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3984 states to 3984 states and 4943 transitions. [2023-12-16 05:55:16,990 INFO L78 Accepts]: Start accepts. Automaton has 3984 states and 4943 transitions. Word has length 144 [2023-12-16 05:55:16,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:55:16,990 INFO L495 AbstractCegarLoop]: Abstraction has 3984 states and 4943 transitions. [2023-12-16 05:55:16,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-16 05:55:16,990 INFO L276 IsEmpty]: Start isEmpty. Operand 3984 states and 4943 transitions. [2023-12-16 05:55:16,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-16 05:55:16,991 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:55:16,992 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:55:17,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-16 05:55:17,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-16 05:55:17,197 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:55:17,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:55:17,198 INFO L85 PathProgramCache]: Analyzing trace with hash 151733564, now seen corresponding path program 1 times [2023-12-16 05:55:17,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:55:17,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765811083] [2023-12-16 05:55:17,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:55:17,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:55:17,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:17,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:55:17,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:17,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 05:55:17,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:17,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-16 05:55:17,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:17,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 05:55:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:17,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 05:55:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:17,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 05:55:17,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:17,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 05:55:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:17,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 05:55:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:17,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 05:55:17,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:17,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-16 05:55:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:17,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 05:55:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:17,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 05:55:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:17,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 05:55:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:17,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-16 05:55:17,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:17,256 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2023-12-16 05:55:17,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:55:17,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765811083] [2023-12-16 05:55:17,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765811083] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 05:55:17,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927065568] [2023-12-16 05:55:17,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:55:17,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 05:55:17,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 05:55:17,258 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 05:55:17,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-16 05:55:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:17,330 INFO L262 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 05:55:17,332 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 05:55:17,354 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-16 05:55:17,354 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 05:55:17,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927065568] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:55:17,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 05:55:17,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2023-12-16 05:55:17,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841330972] [2023-12-16 05:55:17,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:55:17,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 05:55:17,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:55:17,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 05:55:17,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 05:55:17,357 INFO L87 Difference]: Start difference. First operand 3984 states and 4943 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-16 05:55:17,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:55:17,492 INFO L93 Difference]: Finished difference Result 7704 states and 9687 transitions. [2023-12-16 05:55:17,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 05:55:17,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 144 [2023-12-16 05:55:17,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:55:17,498 INFO L225 Difference]: With dead ends: 7704 [2023-12-16 05:55:17,498 INFO L226 Difference]: Without dead ends: 3855 [2023-12-16 05:55:17,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 05:55:17,501 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 78 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 05:55:17,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 245 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 05:55:17,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3855 states. [2023-12-16 05:55:17,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3855 to 3852. [2023-12-16 05:55:17,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3852 states, 3190 states have (on average 1.1846394984326019) internal successors, (3779), 3201 states have internal predecessors, (3779), 377 states have call successors, (377), 234 states have call predecessors, (377), 284 states have return successors, (568), 416 states have call predecessors, (568), 375 states have call successors, (568) [2023-12-16 05:55:17,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3852 states to 3852 states and 4724 transitions. [2023-12-16 05:55:17,609 INFO L78 Accepts]: Start accepts. Automaton has 3852 states and 4724 transitions. Word has length 144 [2023-12-16 05:55:17,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:55:17,609 INFO L495 AbstractCegarLoop]: Abstraction has 3852 states and 4724 transitions. [2023-12-16 05:55:17,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-16 05:55:17,610 INFO L276 IsEmpty]: Start isEmpty. Operand 3852 states and 4724 transitions. [2023-12-16 05:55:17,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-16 05:55:17,611 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:55:17,611 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:55:17,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-16 05:55:17,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 05:55:17,816 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:55:17,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:55:17,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1828873167, now seen corresponding path program 1 times [2023-12-16 05:55:17,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:55:17,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142257541] [2023-12-16 05:55:17,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:55:17,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:55:17,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:17,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:55:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:17,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 05:55:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:17,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-16 05:55:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:17,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 05:55:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:17,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 05:55:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:17,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 05:55:17,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:17,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 05:55:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:17,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 05:55:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:17,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 05:55:17,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:17,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-16 05:55:17,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:17,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-16 05:55:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:17,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-12-16 05:55:17,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:17,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-16 05:55:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:17,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-16 05:55:17,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:17,890 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-12-16 05:55:17,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:55:17,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142257541] [2023-12-16 05:55:17,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142257541] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:55:17,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 05:55:17,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 05:55:17,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148877193] [2023-12-16 05:55:17,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:55:17,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 05:55:17,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:55:17,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 05:55:17,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 05:55:17,891 INFO L87 Difference]: Start difference. First operand 3852 states and 4724 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-16 05:55:18,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:55:18,123 INFO L93 Difference]: Finished difference Result 8291 states and 10182 transitions. [2023-12-16 05:55:18,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 05:55:18,123 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 145 [2023-12-16 05:55:18,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:55:18,131 INFO L225 Difference]: With dead ends: 8291 [2023-12-16 05:55:18,131 INFO L226 Difference]: Without dead ends: 4482 [2023-12-16 05:55:18,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-16 05:55:18,136 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 138 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 05:55:18,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 542 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 05:55:18,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4482 states. [2023-12-16 05:55:18,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4482 to 4253. [2023-12-16 05:55:18,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4253 states, 3522 states have (on average 1.1819988642816581) internal successors, (4163), 3537 states have internal predecessors, (4163), 415 states have call successors, (415), 257 states have call predecessors, (415), 315 states have return successors, (623), 458 states have call predecessors, (623), 413 states have call successors, (623) [2023-12-16 05:55:18,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4253 states to 4253 states and 5201 transitions. [2023-12-16 05:55:18,268 INFO L78 Accepts]: Start accepts. Automaton has 4253 states and 5201 transitions. Word has length 145 [2023-12-16 05:55:18,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:55:18,269 INFO L495 AbstractCegarLoop]: Abstraction has 4253 states and 5201 transitions. [2023-12-16 05:55:18,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-16 05:55:18,269 INFO L276 IsEmpty]: Start isEmpty. Operand 4253 states and 5201 transitions. [2023-12-16 05:55:18,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-16 05:55:18,270 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:55:18,271 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-16 05:55:18,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-16 05:55:18,271 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:55:18,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:55:18,271 INFO L85 PathProgramCache]: Analyzing trace with hash 525296427, now seen corresponding path program 1 times [2023-12-16 05:55:18,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:55:18,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755454415] [2023-12-16 05:55:18,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:55:18,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:55:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:18,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:55:18,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:18,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 05:55:18,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:18,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-16 05:55:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:18,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 05:55:18,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:18,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 05:55:18,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:18,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 05:55:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:18,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 05:55:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:18,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 05:55:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:18,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-16 05:55:18,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:18,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-12-16 05:55:18,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:18,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-16 05:55:18,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:18,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-16 05:55:18,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:18,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 05:55:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:18,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-12-16 05:55:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:18,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-16 05:55:18,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:18,323 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 37 proven. 5 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2023-12-16 05:55:18,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:55:18,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755454415] [2023-12-16 05:55:18,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755454415] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 05:55:18,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057409274] [2023-12-16 05:55:18,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:55:18,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 05:55:18,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 05:55:18,341 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 05:55:18,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-16 05:55:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:18,423 INFO L262 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 05:55:18,425 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 05:55:18,482 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-12-16 05:55:18,482 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 05:55:18,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057409274] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:55:18,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 05:55:18,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-12-16 05:55:18,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387682226] [2023-12-16 05:55:18,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:55:18,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 05:55:18,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:55:18,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 05:55:18,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 05:55:18,484 INFO L87 Difference]: Start difference. First operand 4253 states and 5201 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-16 05:55:18,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:55:18,617 INFO L93 Difference]: Finished difference Result 7878 states and 9665 transitions. [2023-12-16 05:55:18,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 05:55:18,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 150 [2023-12-16 05:55:18,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:55:18,623 INFO L225 Difference]: With dead ends: 7878 [2023-12-16 05:55:18,623 INFO L226 Difference]: Without dead ends: 3705 [2023-12-16 05:55:18,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 05:55:18,627 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 54 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 05:55:18,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 240 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 05:55:18,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3705 states. [2023-12-16 05:55:18,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3705 to 3459. [2023-12-16 05:55:18,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3459 states, 2879 states have (on average 1.1764501563042724) internal successors, (3387), 2890 states have internal predecessors, (3387), 329 states have call successors, (329), 203 states have call predecessors, (329), 250 states have return successors, (444), 365 states have call predecessors, (444), 327 states have call successors, (444) [2023-12-16 05:55:18,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 3459 states and 4160 transitions. [2023-12-16 05:55:18,735 INFO L78 Accepts]: Start accepts. Automaton has 3459 states and 4160 transitions. Word has length 150 [2023-12-16 05:55:18,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:55:18,736 INFO L495 AbstractCegarLoop]: Abstraction has 3459 states and 4160 transitions. [2023-12-16 05:55:18,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-16 05:55:18,736 INFO L276 IsEmpty]: Start isEmpty. Operand 3459 states and 4160 transitions. [2023-12-16 05:55:18,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-16 05:55:18,737 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:55:18,737 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-16 05:55:18,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-16 05:55:18,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-12-16 05:55:18,943 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:55:18,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:55:18,943 INFO L85 PathProgramCache]: Analyzing trace with hash 204611596, now seen corresponding path program 1 times [2023-12-16 05:55:18,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:55:18,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199732667] [2023-12-16 05:55:18,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:55:18,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:55:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:18,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:55:18,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:18,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 05:55:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:18,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-16 05:55:18,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:18,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 05:55:18,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:18,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 05:55:18,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:18,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 05:55:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:18,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 05:55:18,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:18,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 05:55:18,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:18,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-16 05:55:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:18,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-12-16 05:55:18,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:18,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-16 05:55:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:18,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-16 05:55:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:18,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 05:55:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:18,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-12-16 05:55:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:18,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-16 05:55:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:18,991 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-12-16 05:55:18,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:55:18,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199732667] [2023-12-16 05:55:18,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199732667] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 05:55:18,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242918783] [2023-12-16 05:55:18,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:55:18,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 05:55:18,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 05:55:19,005 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 05:55:19,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-16 05:55:19,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:19,098 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 05:55:19,100 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 05:55:19,132 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-16 05:55:19,132 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 05:55:19,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242918783] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:55:19,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 05:55:19,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2023-12-16 05:55:19,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028600515] [2023-12-16 05:55:19,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:55:19,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 05:55:19,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:55:19,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 05:55:19,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 05:55:19,134 INFO L87 Difference]: Start difference. First operand 3459 states and 4160 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-16 05:55:19,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:55:19,225 INFO L93 Difference]: Finished difference Result 4003 states and 4819 transitions. [2023-12-16 05:55:19,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 05:55:19,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 150 [2023-12-16 05:55:19,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:55:19,231 INFO L225 Difference]: With dead ends: 4003 [2023-12-16 05:55:19,231 INFO L226 Difference]: Without dead ends: 3462 [2023-12-16 05:55:19,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 05:55:19,234 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 47 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 05:55:19,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 283 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 05:55:19,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3462 states. [2023-12-16 05:55:19,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3462 to 3459. [2023-12-16 05:55:19,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3459 states, 2879 states have (on average 1.1719346995484543) internal successors, (3374), 2890 states have internal predecessors, (3374), 329 states have call successors, (329), 203 states have call predecessors, (329), 250 states have return successors, (444), 365 states have call predecessors, (444), 327 states have call successors, (444) [2023-12-16 05:55:19,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 3459 states and 4147 transitions. [2023-12-16 05:55:19,337 INFO L78 Accepts]: Start accepts. Automaton has 3459 states and 4147 transitions. Word has length 150 [2023-12-16 05:55:19,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:55:19,339 INFO L495 AbstractCegarLoop]: Abstraction has 3459 states and 4147 transitions. [2023-12-16 05:55:19,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-16 05:55:19,339 INFO L276 IsEmpty]: Start isEmpty. Operand 3459 states and 4147 transitions. [2023-12-16 05:55:19,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-16 05:55:19,340 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:55:19,340 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-16 05:55:19,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-16 05:55:19,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 05:55:19,545 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:55:19,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:55:19,545 INFO L85 PathProgramCache]: Analyzing trace with hash -538576786, now seen corresponding path program 1 times [2023-12-16 05:55:19,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:55:19,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913561065] [2023-12-16 05:55:19,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:55:19,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:55:19,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:19,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:55:19,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:19,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 05:55:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:19,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-16 05:55:19,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:19,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 05:55:19,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:19,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 05:55:19,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:19,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 05:55:19,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:19,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 05:55:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:19,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 05:55:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:19,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-16 05:55:19,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:19,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-12-16 05:55:19,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:19,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-12-16 05:55:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:19,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-12-16 05:55:19,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:19,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 05:55:19,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:19,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-16 05:55:19,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:19,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-12-16 05:55:19,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:19,665 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2023-12-16 05:55:19,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:55:19,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913561065] [2023-12-16 05:55:19,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913561065] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 05:55:19,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358321520] [2023-12-16 05:55:19,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:55:19,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 05:55:19,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 05:55:19,682 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 05:55:19,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-16 05:55:19,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:19,764 INFO L262 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 05:55:19,766 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 05:55:19,889 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2023-12-16 05:55:19,890 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 05:55:19,976 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2023-12-16 05:55:19,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358321520] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 05:55:19,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 05:55:19,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 6 [2023-12-16 05:55:19,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566798083] [2023-12-16 05:55:19,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 05:55:19,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 05:55:19,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:55:19,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 05:55:19,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 05:55:19,978 INFO L87 Difference]: Start difference. First operand 3459 states and 4147 transitions. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 5 states have internal predecessors, (119), 3 states have call successors, (30), 5 states have call predecessors, (30), 3 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2023-12-16 05:55:20,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:55:20,236 INFO L93 Difference]: Finished difference Result 6182 states and 7415 transitions. [2023-12-16 05:55:20,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 05:55:20,236 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 5 states have internal predecessors, (119), 3 states have call successors, (30), 5 states have call predecessors, (30), 3 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 152 [2023-12-16 05:55:20,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:55:20,242 INFO L225 Difference]: With dead ends: 6182 [2023-12-16 05:55:20,242 INFO L226 Difference]: Without dead ends: 3862 [2023-12-16 05:55:20,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-16 05:55:20,244 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 178 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 05:55:20,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 600 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 05:55:20,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3862 states. [2023-12-16 05:55:20,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3862 to 3714. [2023-12-16 05:55:20,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3714 states, 3089 states have (on average 1.1693104564584007) internal successors, (3612), 3100 states have internal predecessors, (3612), 355 states have call successors, (355), 219 states have call predecessors, (355), 269 states have return successors, (474), 394 states have call predecessors, (474), 353 states have call successors, (474) [2023-12-16 05:55:20,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3714 states to 3714 states and 4441 transitions. [2023-12-16 05:55:20,350 INFO L78 Accepts]: Start accepts. Automaton has 3714 states and 4441 transitions. Word has length 152 [2023-12-16 05:55:20,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:55:20,350 INFO L495 AbstractCegarLoop]: Abstraction has 3714 states and 4441 transitions. [2023-12-16 05:55:20,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 5 states have internal predecessors, (119), 3 states have call successors, (30), 5 states have call predecessors, (30), 3 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2023-12-16 05:55:20,351 INFO L276 IsEmpty]: Start isEmpty. Operand 3714 states and 4441 transitions. [2023-12-16 05:55:20,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2023-12-16 05:55:20,354 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:55:20,354 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:55:20,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-16 05:55:20,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-12-16 05:55:20,559 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:55:20,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:55:20,560 INFO L85 PathProgramCache]: Analyzing trace with hash -2090905181, now seen corresponding path program 1 times [2023-12-16 05:55:20,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:55:20,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527851014] [2023-12-16 05:55:20,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:55:20,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:55:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:20,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:55:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:20,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 05:55:20,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:20,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-16 05:55:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:20,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 05:55:20,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:20,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 05:55:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:20,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 05:55:20,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:20,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 05:55:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:20,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 05:55:20,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:20,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-16 05:55:20,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:20,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-12-16 05:55:20,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:20,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-12-16 05:55:20,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:20,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-12-16 05:55:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:20,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 05:55:20,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:20,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-16 05:55:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:20,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-12-16 05:55:20,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:20,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2023-12-16 05:55:20,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:20,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-12-16 05:55:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:20,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2023-12-16 05:55:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:20,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-16 05:55:20,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:20,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2023-12-16 05:55:20,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:20,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2023-12-16 05:55:20,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:20,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-16 05:55:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:20,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-12-16 05:55:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:20,649 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 101 proven. 29 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2023-12-16 05:55:20,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:55:20,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527851014] [2023-12-16 05:55:20,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527851014] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 05:55:20,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114473764] [2023-12-16 05:55:20,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:55:20,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 05:55:20,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 05:55:20,664 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 05:55:20,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-16 05:55:20,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:20,807 INFO L262 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 05:55:20,809 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 05:55:20,853 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2023-12-16 05:55:20,853 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 05:55:20,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114473764] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:55:20,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 05:55:20,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-16 05:55:20,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79123963] [2023-12-16 05:55:20,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:55:20,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 05:55:20,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:55:20,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 05:55:20,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-16 05:55:20,855 INFO L87 Difference]: Start difference. First operand 3714 states and 4441 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-16 05:55:21,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:55:21,007 INFO L93 Difference]: Finished difference Result 9349 states and 11210 transitions. [2023-12-16 05:55:21,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 05:55:21,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 223 [2023-12-16 05:55:21,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:55:21,018 INFO L225 Difference]: With dead ends: 9349 [2023-12-16 05:55:21,018 INFO L226 Difference]: Without dead ends: 5818 [2023-12-16 05:55:21,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-16 05:55:21,023 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 58 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 05:55:21,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 290 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 05:55:21,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5818 states. [2023-12-16 05:55:21,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5818 to 5712. [2023-12-16 05:55:21,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5712 states, 4747 states have (on average 1.1601011164946282) internal successors, (5507), 4758 states have internal predecessors, (5507), 561 states have call successors, (561), 346 states have call predecessors, (561), 403 states have return successors, (711), 607 states have call predecessors, (711), 559 states have call successors, (711) [2023-12-16 05:55:21,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5712 states to 5712 states and 6779 transitions. [2023-12-16 05:55:21,256 INFO L78 Accepts]: Start accepts. Automaton has 5712 states and 6779 transitions. Word has length 223 [2023-12-16 05:55:21,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:55:21,256 INFO L495 AbstractCegarLoop]: Abstraction has 5712 states and 6779 transitions. [2023-12-16 05:55:21,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-16 05:55:21,257 INFO L276 IsEmpty]: Start isEmpty. Operand 5712 states and 6779 transitions. [2023-12-16 05:55:21,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2023-12-16 05:55:21,264 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:55:21,265 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:55:21,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-12-16 05:55:21,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-12-16 05:55:21,470 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:55:21,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:55:21,470 INFO L85 PathProgramCache]: Analyzing trace with hash 337353441, now seen corresponding path program 1 times [2023-12-16 05:55:21,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:55:21,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810586830] [2023-12-16 05:55:21,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:55:21,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:55:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:21,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:55:21,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:21,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 05:55:21,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:21,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-16 05:55:21,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:21,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 05:55:21,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:21,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 05:55:21,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:21,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 05:55:21,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:21,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 05:55:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:21,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 05:55:21,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:21,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-16 05:55:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:21,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-12-16 05:55:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:21,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-12-16 05:55:21,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:21,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-12-16 05:55:21,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:21,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 05:55:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:21,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-16 05:55:21,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:21,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-12-16 05:55:21,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:21,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2023-12-16 05:55:21,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:21,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-12-16 05:55:21,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:21,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2023-12-16 05:55:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:21,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-16 05:55:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:21,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2023-12-16 05:55:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:21,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2023-12-16 05:55:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:21,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-16 05:55:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:21,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-12-16 05:55:21,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:21,532 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 86 proven. 11 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2023-12-16 05:55:21,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:55:21,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810586830] [2023-12-16 05:55:21,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810586830] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 05:55:21,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988033333] [2023-12-16 05:55:21,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:55:21,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 05:55:21,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 05:55:21,550 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 05:55:21,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-16 05:55:21,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:55:21,648 INFO L262 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 05:55:21,651 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 05:55:21,669 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-16 05:55:21,669 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 05:55:21,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988033333] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:55:21,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 05:55:21,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2023-12-16 05:55:21,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797678950] [2023-12-16 05:55:21,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:55:21,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 05:55:21,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:55:21,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 05:55:21,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 05:55:21,671 INFO L87 Difference]: Start difference. First operand 5712 states and 6779 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2023-12-16 05:55:21,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:55:21,786 INFO L93 Difference]: Finished difference Result 7860 states and 9327 transitions. [2023-12-16 05:55:21,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 05:55:21,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 223 [2023-12-16 05:55:21,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:55:21,791 INFO L225 Difference]: With dead ends: 7860 [2023-12-16 05:55:21,791 INFO L226 Difference]: Without dead ends: 2279 [2023-12-16 05:55:21,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 05:55:21,798 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 7 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 05:55:21,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 231 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 05:55:21,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2279 states. [2023-12-16 05:55:21,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2279 to 2279. [2023-12-16 05:55:21,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2279 states, 1878 states have (on average 1.1325878594249201) internal successors, (2127), 1891 states have internal predecessors, (2127), 220 states have call successors, (220), 149 states have call predecessors, (220), 180 states have return successors, (280), 238 states have call predecessors, (280), 218 states have call successors, (280) [2023-12-16 05:55:21,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 2279 states and 2627 transitions. [2023-12-16 05:55:21,891 INFO L78 Accepts]: Start accepts. Automaton has 2279 states and 2627 transitions. Word has length 223 [2023-12-16 05:55:21,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:55:21,892 INFO L495 AbstractCegarLoop]: Abstraction has 2279 states and 2627 transitions. [2023-12-16 05:55:21,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2023-12-16 05:55:21,892 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 2627 transitions. [2023-12-16 05:55:21,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 05:55:21,895 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:55:21,895 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 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 05:55:21,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-12-16 05:55:22,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-12-16 05:55:22,100 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:55:22,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:55:22,100 INFO L85 PathProgramCache]: Analyzing trace with hash -738756182, now seen corresponding path program 1 times [2023-12-16 05:55:22,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:55:22,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765583202] [2023-12-16 05:55:22,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:55:22,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:55:22,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 05:55:22,111 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 05:55:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 05:55:22,167 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 05:55:22,167 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 05:55:22,168 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 05:55:22,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-16 05:55:22,171 INFO L445 BasicCegarLoop]: Path program 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] [2023-12-16 05:55:22,174 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 05:55:22,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 05:55:22 BoogieIcfgContainer [2023-12-16 05:55:22,283 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 05:55:22,284 INFO L158 Benchmark]: Toolchain (without parser) took 16823.19ms. Allocated memory was 191.9MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 131.5MB in the beginning and 1.0GB in the end (delta: -901.0MB). Peak memory consumption was 304.8MB. Max. memory is 8.0GB. [2023-12-16 05:55:22,284 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 191.9MB. Free memory was 143.3MB in the beginning and 143.2MB in the end (delta: 89.6kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 05:55:22,284 INFO L158 Benchmark]: CACSL2BoogieTranslator took 331.47ms. Allocated memory is still 191.9MB. Free memory was 131.4MB in the beginning and 117.5MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-16 05:55:22,284 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.08ms. Allocated memory is still 191.9MB. Free memory was 117.5MB in the beginning and 115.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 05:55:22,284 INFO L158 Benchmark]: Boogie Preprocessor took 28.51ms. Allocated memory is still 191.9MB. Free memory was 115.4MB in the beginning and 113.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 05:55:22,285 INFO L158 Benchmark]: RCFGBuilder took 536.26ms. Allocated memory was 191.9MB in the beginning and 273.7MB in the end (delta: 81.8MB). Free memory was 112.7MB in the beginning and 225.2MB in the end (delta: -112.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 05:55:22,286 INFO L158 Benchmark]: TraceAbstraction took 15886.01ms. Allocated memory was 273.7MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 224.7MB in the beginning and 1.0GB in the end (delta: -807.8MB). Peak memory consumption was 315.3MB. Max. memory is 8.0GB. [2023-12-16 05:55:22,291 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 191.9MB. Free memory was 143.3MB in the beginning and 143.2MB in the end (delta: 89.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 331.47ms. Allocated memory is still 191.9MB. Free memory was 131.4MB in the beginning and 117.5MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.08ms. Allocated memory is still 191.9MB. Free memory was 117.5MB in the beginning and 115.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.51ms. Allocated memory is still 191.9MB. Free memory was 115.4MB in the beginning and 113.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 536.26ms. Allocated memory was 191.9MB in the beginning and 273.7MB in the end (delta: 81.8MB). Free memory was 112.7MB in the beginning and 225.2MB in the end (delta: -112.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 15886.01ms. Allocated memory was 273.7MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 224.7MB in the beginning and 1.0GB in the end (delta: -807.8MB). Peak memory consumption was 315.3MB. 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 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int max_loop ; [L26] int num ; [L27] int i ; [L28] int e ; [L29] int timer ; [L30] char data_0 ; [L31] char data_1 ; [L74] int P_1_pc; [L75] int P_1_st ; [L76] int P_1_i ; [L77] int P_1_ev ; [L132] int C_1_pc ; [L133] int C_1_st ; [L134] int C_1_i ; [L135] int C_1_ev ; [L136] int C_1_pr ; [L500] int count ; [L501] int __retres2 ; [L505] num = 0 [L506] i = 0 [L507] max_loop = 2 [L509] timer = 0 [L510] P_1_pc = 0 [L511] C_1_pc = 0 [L513] count = 0 [L514] CALL init_model() [L493] P_1_i = 1 [L494] C_1_i = 1 [L514] RET init_model() [L515] CALL start_simulation() [L431] int kernel_st ; [L432] int tmp ; [L433] int tmp___0 ; [L437] kernel_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, timer=0] [L438] FCALL update_channels() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, timer=0] [L439] CALL init_threads() [L236] COND TRUE (int )P_1_i == 1 [L237] P_1_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L241] COND TRUE (int )C_1_i == 1 [L242] C_1_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L439] RET init_threads() [L440] FCALL fire_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, timer=0] [L441] CALL activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L117] COND FALSE !((int )P_1_pc == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L127] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, __retres1=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L129] return (__retres1); [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND FALSE !(\read(tmp)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0, tmp=0] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L199] COND FALSE !((int )C_1_pc == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L219] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, __retres1=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L221] return (__retres1); [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0, tmp=0, tmp___1=0] [L441] RET activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, timer=0] [L442] FCALL reset_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, timer=0] [L445] COND TRUE 1 [L448] kernel_st = 1 [L449] CALL eval() [L272] int tmp ; [L273] int tmp___0 ; [L274] int tmp___1 ; [L275] int tmp___2 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L279] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L251] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, __retres1=1, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L268] return (__retres1); [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0, tmp___2=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND FALSE !(\read(tmp)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0, tmp=0, tmp___2=1] [L304] COND TRUE (int )C_1_st == 0 [L306] tmp___1 = __VERIFIER_nondet_int() [L308] COND TRUE \read(tmp___1) [L310] C_1_st = 1 [L311] CALL C_1() [L138] char c ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L141] COND TRUE (int )C_1_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L156] COND TRUE i < max_loop VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L158] COND TRUE num == 0 [L159] timer = 1 [L160] i += 1 [L161] C_1_pc = 1 [L162] C_1_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L311] RET C_1() [L279] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1, tmp=0, tmp___1=1, tmp___2=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L251] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, __retres1=1, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L268] return (__retres1); [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1, tmp=0, tmp___1=1, tmp___2=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1, tmp=0, tmp___1=1, tmp___2=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND TRUE \read(tmp) [L295] P_1_st = 1 [L296] CALL P_1() [L82] COND TRUE (int )P_1_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L93] COND TRUE i < max_loop [L96] CALL write_data(num, 'A') [L59] COND TRUE i___0 == 0 [L60] data_0 = c VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, \old(c)=65, \old(i___0)=0, c=65, data_0=65, data_1=0, e=0, i=1, i___0=0, max_loop=2, num=0, timer=1] [L96] RET write_data(num, 'A') [L97] num += 1 [L98] P_1_pc = 1 [L99] P_1_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L296] RET P_1() [L304] COND FALSE !((int )C_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1, tmp=1, tmp___1=1, tmp___2=1] [L279] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1, tmp=1, tmp___1=1, tmp___2=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L251] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L254] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, __retres1=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L268] return (__retres1); [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1, tmp=1, tmp___1=1, tmp___2=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND FALSE !(\read(tmp___2)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1, tmp=1, tmp___1=1, tmp___2=0] [L449] RET eval() [L452] kernel_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=2, max_loop=2, num=1, timer=1] [L453] FCALL update_channels() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=2, max_loop=2, num=1, timer=1] [L456] kernel_st = 3 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=3, max_loop=2, num=1, timer=1] [L457] FCALL fire_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=3, max_loop=2, num=1, timer=1] [L458] CALL activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L118] COND FALSE !((int )P_1_ev == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L127] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L129] return (__retres1); [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND FALSE !(\read(tmp)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1, tmp=0] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L200] COND FALSE !((int )e == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L219] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L221] return (__retres1); [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1, tmp=0, tmp___1=0] [L458] RET activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=3, max_loop=2, num=1, timer=1] [L459] FCALL reset_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=3, max_loop=2, num=1, timer=1] [L462] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L251] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L254] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, __retres1=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L268] return (__retres1); [L462] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=3, max_loop=2, num=1, timer=1] [L462] tmp = exists_runnable_thread() [L464] COND TRUE tmp == 0 [L466] kernel_st = 4 [L467] CALL fire_time_events() [L346] C_1_ev = 1 [L348] P_1_ev = 1 [L467] RET fire_time_events() [L468] CALL activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L118] COND TRUE (int )P_1_ev == 1 [L119] __retres1 = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L129] return (__retres1); [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND TRUE \read(tmp) [L384] P_1_st = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1, tmp=1] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L200] COND FALSE !((int )e == 1) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L219] __retres1 = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L221] return (__retres1); [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1, tmp=1, tmp___1=0] [L468] RET activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, kernel_st=4, max_loop=2, num=1, timer=1, tmp=0] [L469] CALL reset_time_events() [L360] COND TRUE (int )P_1_ev == 1 [L361] P_1_ev = 2 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L365] COND TRUE (int )C_1_ev == 1 [L366] C_1_ev = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L469] RET reset_time_events() [L475] CALL, EXPR stop_simulation() [L412] int tmp ; [L413] int __retres2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L417] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, __retres1=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L268] return (__retres1); [L417] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L417] tmp = exists_runnable_thread() [L419] COND TRUE \read(tmp) [L420] __retres2 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, __retres2=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1, tmp=1] [L427] return (__retres2); [L475] RET, EXPR stop_simulation() [L475] tmp___0 = stop_simulation() [L477] COND FALSE !(\read(tmp___0)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, kernel_st=4, max_loop=2, num=1, timer=1, tmp=0, tmp___0=0] [L445] COND TRUE 1 [L448] kernel_st = 1 [L449] CALL eval() [L272] int tmp ; [L273] int tmp___0 ; [L274] int tmp___1 ; [L275] int tmp___2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L279] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, __retres1=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L268] return (__retres1); [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1, tmp___2=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND TRUE \read(tmp) [L295] P_1_st = 1 [L296] CALL P_1() [L82] COND FALSE !((int )P_1_pc == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L85] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L93] COND TRUE i < max_loop [L96] CALL write_data(num, 'A') [L59] COND FALSE !(i___0 == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, \old(c)=65, \old(i___0)=1, c=65, data_0=65, data_1=0, e=0, i=1, i___0=1, max_loop=2, num=1, timer=1] [L62] COND TRUE i___0 == 1 [L63] data_1 = c VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, \old(c)=65, \old(i___0)=1, c=65, data_0=65, data_1=65, e=0, i=1, i___0=1, max_loop=2, num=1, timer=1] [L96] RET write_data(num, 'A') [L97] num += 1 [L98] P_1_pc = 1 [L99] P_1_st = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L296] RET P_1() [L304] COND FALSE !((int )C_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1, tmp=1, tmp___2=1] [L279] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1, tmp=1, tmp___2=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L254] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, __retres1=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L268] return (__retres1); [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1, tmp=1, tmp___2=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND FALSE !(\read(tmp___2)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1, tmp=1, tmp___2=0] [L449] RET eval() [L452] kernel_st = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=2, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L453] FCALL update_channels() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=2, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L456] kernel_st = 3 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=3, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L457] FCALL fire_delta_events() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=3, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L458] CALL activate_threads() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L118] COND FALSE !((int )P_1_ev == 1) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L127] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L129] return (__retres1); [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND FALSE !(\read(tmp)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1, tmp=0] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L200] COND FALSE !((int )e == 1) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L219] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L221] return (__retres1); [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1, tmp=0, tmp___1=0] [L458] RET activate_threads() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=3, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L459] FCALL reset_delta_events() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=3, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L462] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L254] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, __retres1=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L268] return (__retres1); [L462] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=3, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L462] tmp = exists_runnable_thread() [L464] COND TRUE tmp == 0 [L466] kernel_st = 4 [L467] CALL fire_time_events() [L346] C_1_ev = 1 [L348] P_1_ev = 1 [L467] RET fire_time_events() [L468] CALL activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L118] COND TRUE (int )P_1_ev == 1 [L119] __retres1 = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L129] return (__retres1); [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND TRUE \read(tmp) [L384] P_1_st = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1, tmp=1] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L200] COND FALSE !((int )e == 1) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L219] __retres1 = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L221] return (__retres1); [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1, tmp=1, tmp___1=0] [L468] RET activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, kernel_st=4, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L469] CALL reset_time_events() [L360] COND TRUE (int )P_1_ev == 1 [L361] P_1_ev = 2 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L365] COND TRUE (int )C_1_ev == 1 [L366] C_1_ev = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L469] RET reset_time_events() [L475] CALL, EXPR stop_simulation() [L412] int tmp ; [L413] int __retres2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L417] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, __retres1=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L268] return (__retres1); [L417] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L417] tmp = exists_runnable_thread() [L419] COND TRUE \read(tmp) [L420] __retres2 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, __retres2=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1, tmp=1] [L427] return (__retres2); [L475] RET, EXPR stop_simulation() [L475] tmp___0 = stop_simulation() [L477] COND FALSE !(\read(tmp___0)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, kernel_st=4, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L445] COND TRUE 1 [L448] kernel_st = 1 [L449] CALL eval() [L272] int tmp ; [L273] int tmp___0 ; [L274] int tmp___1 ; [L275] int tmp___2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L279] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, __retres1=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L268] return (__retres1); [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1, tmp___2=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND TRUE \read(tmp) [L295] P_1_st = 1 [L296] CALL P_1() [L82] COND FALSE !((int )P_1_pc == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L85] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L93] COND TRUE i < max_loop [L96] CALL write_data(num, 'A') [L59] COND FALSE !(i___0 == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, \old(c)=65, \old(i___0)=2, c=65, data_0=65, data_1=65, e=0, i=1, i___0=2, max_loop=2, num=2, timer=1] [L62] COND FALSE !(i___0 == 1) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, \old(c)=65, \old(i___0)=2, c=65, data_0=65, data_1=65, e=0, i=1, i___0=2, max_loop=2, num=2, timer=1] [L66] CALL error() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L19] reach_error() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.7s, OverallIterations: 26, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3964 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3854 mSDsluCounter, 9528 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5671 mSDsCounter, 551 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3019 IncrementalHoareTripleChecker+Invalid, 3570 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 551 mSolverCounterUnsat, 3857 mSDtfsCounter, 3019 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2594 GetRequests, 2452 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7810occurred in iteration=15, InterpolantAutomatonStates: 143, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 2658 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 4581 NumberOfCodeBlocks, 4581 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 4451 ConstructedInterpolants, 0 QuantifiedInterpolants, 7548 SizeOfPredicates, 3 NumberOfNonLiveVariables, 5071 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 38 InterpolantComputations, 24 PerfectInterpolantSequences, 3667/3909 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 RESULT: Ultimate proved your program to be incorrect! [2023-12-16 05:55:22,318 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...