/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/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 04:33:51,850 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 04:33:51,905 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 04:33:51,909 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 04:33:51,909 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 04:33:51,927 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 04:33:51,928 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 04:33:51,928 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 04:33:51,928 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 04:33:51,929 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 04:33:51,929 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 04:33:51,929 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 04:33:51,930 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 04:33:51,930 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 04:33:51,930 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 04:33:51,931 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 04:33:51,931 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 04:33:51,931 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 04:33:51,932 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 04:33:51,932 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 04:33:51,932 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 04:33:51,935 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 04:33:51,936 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 04:33:51,936 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 04:33:51,936 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 04:33:51,936 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 04:33:51,937 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 04:33:51,937 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 04:33:51,937 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 04:33:51,937 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 04:33:51,938 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 04:33:51,938 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 04:33:51,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:33:51,939 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 04:33:51,939 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 04:33:51,939 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 04:33:51,939 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 04:33:51,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 04:33:51,940 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 04:33:51,940 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 04:33:51,940 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 04:33:51,944 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 04:33:51,944 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 04:33:51,944 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 04:33:52,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 04:33:52,162 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 04:33:52,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 04:33:52,166 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 04:33:52,167 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 04:33:52,168 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.i [2023-12-16 04:33:53,360 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 04:33:53,557 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 04:33:53,557 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.i [2023-12-16 04:33:53,573 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bb71e030/d19057c52f154e319bb0cbce7d6de943/FLAG2a3bd7650 [2023-12-16 04:33:53,586 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bb71e030/d19057c52f154e319bb0cbce7d6de943 [2023-12-16 04:33:53,588 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 04:33:53,590 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 04:33:53,590 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 04:33:53,591 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 04:33:53,598 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 04:33:53,599 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:33:53" (1/1) ... [2023-12-16 04:33:53,600 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d98801a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:33:53, skipping insertion in model container [2023-12-16 04:33:53,600 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:33:53" (1/1) ... [2023-12-16 04:33:53,633 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 04:33:53,744 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.i[917,930] [2023-12-16 04:33:53,794 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:33:53,805 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 04:33:53,814 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.i[917,930] [2023-12-16 04:33:53,850 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:33:53,873 INFO L206 MainTranslator]: Completed translation [2023-12-16 04:33:53,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:33:53 WrapperNode [2023-12-16 04:33:53,874 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 04:33:53,875 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 04:33:53,875 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 04:33:53,875 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 04:33:53,881 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:33:53" (1/1) ... [2023-12-16 04:33:53,891 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:33:53" (1/1) ... [2023-12-16 04:33:53,933 INFO L138 Inliner]: procedures = 29, calls = 156, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 512 [2023-12-16 04:33:53,933 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 04:33:53,934 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 04:33:53,934 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 04:33:53,934 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 04:33:53,944 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:33:53" (1/1) ... [2023-12-16 04:33:53,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:33:53" (1/1) ... [2023-12-16 04:33:53,949 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:33:53" (1/1) ... [2023-12-16 04:33:53,969 INFO L175 MemorySlicer]: Split 132 memory accesses to 2 slices as follows [2, 130]. 98 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 14]. The 16 writes are split as follows [0, 16]. [2023-12-16 04:33:53,970 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:33:53" (1/1) ... [2023-12-16 04:33:53,970 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:33:53" (1/1) ... [2023-12-16 04:33:53,985 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:33:53" (1/1) ... [2023-12-16 04:33:53,989 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:33:53" (1/1) ... [2023-12-16 04:33:53,992 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:33:53" (1/1) ... [2023-12-16 04:33:53,994 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:33:53" (1/1) ... [2023-12-16 04:33:54,018 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 04:33:54,019 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 04:33:54,019 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 04:33:54,019 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 04:33:54,020 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:33:53" (1/1) ... [2023-12-16 04:33:54,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:33:54,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:33:54,071 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 04:33:54,094 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 04:33:54,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 04:33:54,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-16 04:33:54,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-16 04:33:54,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-16 04:33:54,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-16 04:33:54,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-16 04:33:54,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-16 04:33:54,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-16 04:33:54,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-16 04:33:54,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-16 04:33:54,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-16 04:33:54,109 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 04:33:54,109 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 04:33:54,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 04:33:54,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 04:33:54,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 04:33:54,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 04:33:54,222 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 04:33:54,224 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 04:33:54,743 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 04:33:54,785 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 04:33:54,786 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 04:33:54,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:33:54 BoogieIcfgContainer [2023-12-16 04:33:54,786 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 04:33:54,789 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 04:33:54,789 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 04:33:54,792 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 04:33:54,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:33:53" (1/3) ... [2023-12-16 04:33:54,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f30f53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:33:54, skipping insertion in model container [2023-12-16 04:33:54,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:33:53" (2/3) ... [2023-12-16 04:33:54,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f30f53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:33:54, skipping insertion in model container [2023-12-16 04:33:54,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:33:54" (3/3) ... [2023-12-16 04:33:54,796 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-70.i [2023-12-16 04:33:54,812 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 04:33:54,812 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 04:33:54,862 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 04:33:54,869 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;@4811d9df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 04:33:54,870 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 04:33:54,879 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 79 states have (on average 1.481012658227848) internal successors, (117), 80 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 04:33:54,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-16 04:33:54,889 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:33:54,890 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:33:54,890 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:33:54,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:33:54,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1648714533, now seen corresponding path program 1 times [2023-12-16 04:33:54,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:33:54,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957875904] [2023-12-16 04:33:54,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:33:54,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:33:55,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:55,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:33:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:55,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:33:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:55,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:33:55,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:55,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:33:55,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:55,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:33:55,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:55,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:33:55,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:55,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:33:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:55,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:33:55,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:55,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:33:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:55,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:33:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:55,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:33:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:55,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:33:55,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:55,293 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:33:55,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:33:55,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957875904] [2023-12-16 04:33:55,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957875904] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:33:55,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:33:55,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 04:33:55,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296866084] [2023-12-16 04:33:55,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:33:55,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 04:33:55,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:33:55,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 04:33:55,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 04:33:55,331 INFO L87 Difference]: Start difference. First operand has 94 states, 79 states have (on average 1.481012658227848) internal successors, (117), 80 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:33:55,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:33:55,389 INFO L93 Difference]: Finished difference Result 185 states and 292 transitions. [2023-12-16 04:33:55,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 04:33:55,392 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2023-12-16 04:33:55,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:33:55,399 INFO L225 Difference]: With dead ends: 185 [2023-12-16 04:33:55,400 INFO L226 Difference]: Without dead ends: 92 [2023-12-16 04:33:55,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 04:33:55,407 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:33:55,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:33:55,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-12-16 04:33:55,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-12-16 04:33:55,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 78 states have (on average 1.435897435897436) internal successors, (112), 78 states have internal predecessors, (112), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 04:33:55,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 136 transitions. [2023-12-16 04:33:55,438 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 136 transitions. Word has length 110 [2023-12-16 04:33:55,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:33:55,439 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 136 transitions. [2023-12-16 04:33:55,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:33:55,439 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 136 transitions. [2023-12-16 04:33:55,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-16 04:33:55,443 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:33:55,443 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:33:55,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 04:33:55,444 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:33:55,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:33:55,444 INFO L85 PathProgramCache]: Analyzing trace with hash 463453259, now seen corresponding path program 1 times [2023-12-16 04:33:55,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:33:55,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569048282] [2023-12-16 04:33:55,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:33:55,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:33:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:55,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:33:55,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:55,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:33:55,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:55,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:33:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:55,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:33:55,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:55,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:33:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:55,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:33:55,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:55,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:33:55,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:55,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:33:55,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:55,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:33:55,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:55,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:33:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:55,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:33:55,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:55,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:33:55,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:55,765 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:33:55,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:33:55,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569048282] [2023-12-16 04:33:55,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569048282] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:33:55,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:33:55,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:33:55,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663419387] [2023-12-16 04:33:55,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:33:55,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:33:55,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:33:55,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:33:55,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:33:55,776 INFO L87 Difference]: Start difference. First operand 92 states and 136 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:33:55,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:33:55,853 INFO L93 Difference]: Finished difference Result 189 states and 280 transitions. [2023-12-16 04:33:55,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:33:55,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2023-12-16 04:33:55,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:33:55,857 INFO L225 Difference]: With dead ends: 189 [2023-12-16 04:33:55,857 INFO L226 Difference]: Without dead ends: 98 [2023-12-16 04:33:55,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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 04:33:55,859 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 10 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:33:55,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 388 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:33:55,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-16 04:33:55,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2023-12-16 04:33:55,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 80 states have (on average 1.425) internal successors, (114), 80 states have internal predecessors, (114), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 04:33:55,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 138 transitions. [2023-12-16 04:33:55,871 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 138 transitions. Word has length 110 [2023-12-16 04:33:55,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:33:55,871 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 138 transitions. [2023-12-16 04:33:55,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:33:55,872 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 138 transitions. [2023-12-16 04:33:55,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-16 04:33:55,874 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:33:55,875 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:33:55,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 04:33:55,875 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:33:55,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:33:55,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1195420685, now seen corresponding path program 1 times [2023-12-16 04:33:55,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:33:55,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464550878] [2023-12-16 04:33:55,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:33:55,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:33:55,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:56,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:33:56,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:56,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:33:56,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:56,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:33:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:56,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:33:56,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:56,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:33:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:56,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:33:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:56,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:33:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:56,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:33:56,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:56,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:33:56,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:56,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:33:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:56,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:33:56,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:56,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:33:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:56,198 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:33:56,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:33:56,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464550878] [2023-12-16 04:33:56,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464550878] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:33:56,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:33:56,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:33:56,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410152897] [2023-12-16 04:33:56,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:33:56,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:33:56,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:33:56,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:33:56,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:33:56,205 INFO L87 Difference]: Start difference. First operand 94 states and 138 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:33:56,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:33:56,276 INFO L93 Difference]: Finished difference Result 208 states and 307 transitions. [2023-12-16 04:33:56,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:33:56,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2023-12-16 04:33:56,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:33:56,281 INFO L225 Difference]: With dead ends: 208 [2023-12-16 04:33:56,282 INFO L226 Difference]: Without dead ends: 115 [2023-12-16 04:33:56,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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 04:33:56,290 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 39 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:33:56,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 425 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:33:56,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-12-16 04:33:56,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 96. [2023-12-16 04:33:56,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.4146341463414633) internal successors, (116), 82 states have internal predecessors, (116), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 04:33:56,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 140 transitions. [2023-12-16 04:33:56,306 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 140 transitions. Word has length 110 [2023-12-16 04:33:56,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:33:56,307 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 140 transitions. [2023-12-16 04:33:56,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:33:56,307 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 140 transitions. [2023-12-16 04:33:56,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-16 04:33:56,309 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:33:56,309 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:33:56,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 04:33:56,309 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:33:56,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:33:56,310 INFO L85 PathProgramCache]: Analyzing trace with hash 760131474, now seen corresponding path program 1 times [2023-12-16 04:33:56,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:33:56,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98689580] [2023-12-16 04:33:56,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:33:56,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:33:56,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:56,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:33:56,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:56,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:33:56,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:56,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:33:56,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:56,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:33:56,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:56,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:33:56,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:56,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:33:56,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:56,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:33:56,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:56,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:33:56,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:56,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:33:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:56,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:33:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:56,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:33:56,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:56,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:33:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:56,492 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:33:56,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:33:56,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98689580] [2023-12-16 04:33:56,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98689580] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:33:56,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:33:56,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:33:56,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693902663] [2023-12-16 04:33:56,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:33:56,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:33:56,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:33:56,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:33:56,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:33:56,503 INFO L87 Difference]: Start difference. First operand 96 states and 140 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:33:56,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:33:56,545 INFO L93 Difference]: Finished difference Result 199 states and 290 transitions. [2023-12-16 04:33:56,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:33:56,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2023-12-16 04:33:56,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:33:56,549 INFO L225 Difference]: With dead ends: 199 [2023-12-16 04:33:56,549 INFO L226 Difference]: Without dead ends: 104 [2023-12-16 04:33:56,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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 04:33:56,555 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 12 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:33:56,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 384 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:33:56,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-12-16 04:33:56,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2023-12-16 04:33:56,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.4047619047619047) internal successors, (118), 84 states have internal predecessors, (118), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 04:33:56,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 142 transitions. [2023-12-16 04:33:56,571 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 142 transitions. Word has length 112 [2023-12-16 04:33:56,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:33:56,571 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 142 transitions. [2023-12-16 04:33:56,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:33:56,572 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 142 transitions. [2023-12-16 04:33:56,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-16 04:33:56,573 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:33:56,573 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:33:56,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 04:33:56,574 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:33:56,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:33:56,574 INFO L85 PathProgramCache]: Analyzing trace with hash 817389776, now seen corresponding path program 1 times [2023-12-16 04:33:56,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:33:56,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176720585] [2023-12-16 04:33:56,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:33:56,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:33:56,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:56,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:33:56,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:56,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:33:56,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:56,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:33:56,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:56,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:33:56,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:56,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:33:56,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:56,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:33:56,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:56,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:33:56,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:56,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:33:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:56,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:33:56,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:56,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:33:56,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:56,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:33:56,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:56,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:33:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:56,732 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:33:56,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:33:56,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176720585] [2023-12-16 04:33:56,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176720585] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:33:56,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:33:56,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:33:56,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815354551] [2023-12-16 04:33:56,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:33:56,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:33:56,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:33:56,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:33:56,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:33:56,735 INFO L87 Difference]: Start difference. First operand 98 states and 142 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:33:56,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:33:56,763 INFO L93 Difference]: Finished difference Result 199 states and 288 transitions. [2023-12-16 04:33:56,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:33:56,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2023-12-16 04:33:56,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:33:56,765 INFO L225 Difference]: With dead ends: 199 [2023-12-16 04:33:56,765 INFO L226 Difference]: Without dead ends: 102 [2023-12-16 04:33:56,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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 04:33:56,766 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 3 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:33:56,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 385 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:33:56,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-12-16 04:33:56,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2023-12-16 04:33:56,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 86 states have (on average 1.3953488372093024) internal successors, (120), 86 states have internal predecessors, (120), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 04:33:56,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 144 transitions. [2023-12-16 04:33:56,782 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 144 transitions. Word has length 112 [2023-12-16 04:33:56,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:33:56,784 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 144 transitions. [2023-12-16 04:33:56,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:33:56,784 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 144 transitions. [2023-12-16 04:33:56,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-16 04:33:56,790 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:33:56,790 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:33:56,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 04:33:56,791 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:33:56,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:33:56,791 INFO L85 PathProgramCache]: Analyzing trace with hash 817449358, now seen corresponding path program 1 times [2023-12-16 04:33:56,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:33:56,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087901717] [2023-12-16 04:33:56,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:33:56,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:33:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:57,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:33:57,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:57,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:33:57,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:57,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:33:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:57,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:33:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:57,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:33:57,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:57,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:33:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:57,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:33:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:57,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:33:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:57,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:33:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:57,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:33:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:57,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:33:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:57,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:33:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:57,970 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:33:57,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:33:57,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087901717] [2023-12-16 04:33:57,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087901717] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:33:57,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:33:57,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-16 04:33:57,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821424674] [2023-12-16 04:33:57,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:33:57,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 04:33:57,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:33:57,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 04:33:57,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:33:57,973 INFO L87 Difference]: Start difference. First operand 100 states and 144 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:33:58,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:33:58,520 INFO L93 Difference]: Finished difference Result 264 states and 379 transitions. [2023-12-16 04:33:58,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:33:58,520 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 112 [2023-12-16 04:33:58,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:33:58,522 INFO L225 Difference]: With dead ends: 264 [2023-12-16 04:33:58,522 INFO L226 Difference]: Without dead ends: 165 [2023-12-16 04:33:58,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-12-16 04:33:58,523 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 312 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 04:33:58,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 384 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 04:33:58,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-12-16 04:33:58,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 112. [2023-12-16 04:33:58,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 98 states have (on average 1.4081632653061225) internal successors, (138), 98 states have internal predecessors, (138), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 04:33:58,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 162 transitions. [2023-12-16 04:33:58,532 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 162 transitions. Word has length 112 [2023-12-16 04:33:58,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:33:58,533 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 162 transitions. [2023-12-16 04:33:58,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:33:58,533 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 162 transitions. [2023-12-16 04:33:58,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-16 04:33:58,534 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:33:58,534 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:33:58,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 04:33:58,534 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:33:58,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:33:58,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1859313861, now seen corresponding path program 1 times [2023-12-16 04:33:58,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:33:58,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568089100] [2023-12-16 04:33:58,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:33:58,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:33:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:58,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:33:58,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:58,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:33:58,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:58,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:33:58,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:58,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:33:58,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:58,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:33:58,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:58,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:33:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:58,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:33:58,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:58,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:33:58,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:58,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:33:58,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:58,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:33:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:58,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:33:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:58,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:33:58,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:58,796 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:33:58,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:33:58,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568089100] [2023-12-16 04:33:58,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568089100] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:33:58,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:33:58,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:33:58,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442364951] [2023-12-16 04:33:58,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:33:58,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:33:58,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:33:58,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:33:58,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:33:58,798 INFO L87 Difference]: Start difference. First operand 112 states and 162 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:33:58,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:33:58,968 INFO L93 Difference]: Finished difference Result 273 states and 392 transitions. [2023-12-16 04:33:58,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:33:58,968 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2023-12-16 04:33:58,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:33:58,969 INFO L225 Difference]: With dead ends: 273 [2023-12-16 04:33:58,969 INFO L226 Difference]: Without dead ends: 162 [2023-12-16 04:33:58,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:33:58,971 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 146 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:33:58,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 392 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:33:58,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-12-16 04:33:58,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 114. [2023-12-16 04:33:58,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 100 states have (on average 1.4) internal successors, (140), 100 states have internal predecessors, (140), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 04:33:58,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 164 transitions. [2023-12-16 04:33:58,981 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 164 transitions. Word has length 113 [2023-12-16 04:33:58,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:33:58,981 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 164 transitions. [2023-12-16 04:33:58,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:33:58,982 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 164 transitions. [2023-12-16 04:33:58,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-16 04:33:58,983 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:33:58,983 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:33:58,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 04:33:58,983 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:33:58,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:33:58,984 INFO L85 PathProgramCache]: Analyzing trace with hash 837730171, now seen corresponding path program 1 times [2023-12-16 04:33:58,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:33:58,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278542719] [2023-12-16 04:33:58,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:33:58,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:33:59,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:59,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:33:59,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:59,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:33:59,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:59,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:33:59,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:59,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:33:59,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:59,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:33:59,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:59,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:33:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:59,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:33:59,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:59,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:33:59,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:59,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:33:59,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:59,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:33:59,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:59,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:33:59,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:59,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:33:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:59,165 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:33:59,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:33:59,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278542719] [2023-12-16 04:33:59,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278542719] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:33:59,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:33:59,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:33:59,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303466259] [2023-12-16 04:33:59,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:33:59,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:33:59,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:33:59,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:33:59,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:33:59,167 INFO L87 Difference]: Start difference. First operand 114 states and 164 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:33:59,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:33:59,215 INFO L93 Difference]: Finished difference Result 248 states and 356 transitions. [2023-12-16 04:33:59,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:33:59,215 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2023-12-16 04:33:59,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:33:59,216 INFO L225 Difference]: With dead ends: 248 [2023-12-16 04:33:59,217 INFO L226 Difference]: Without dead ends: 135 [2023-12-16 04:33:59,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:33:59,218 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 64 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:33:59,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 520 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:33:59,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-12-16 04:33:59,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 117. [2023-12-16 04:33:59,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 103 states have (on average 1.3883495145631068) internal successors, (143), 103 states have internal predecessors, (143), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 04:33:59,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 167 transitions. [2023-12-16 04:33:59,226 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 167 transitions. Word has length 113 [2023-12-16 04:33:59,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:33:59,227 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 167 transitions. [2023-12-16 04:33:59,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:33:59,227 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 167 transitions. [2023-12-16 04:33:59,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-16 04:33:59,228 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:33:59,228 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:33:59,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 04:33:59,228 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:33:59,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:33:59,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1979924589, now seen corresponding path program 1 times [2023-12-16 04:33:59,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:33:59,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709567034] [2023-12-16 04:33:59,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:33:59,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:33:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:59,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:33:59,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:59,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:33:59,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:59,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:33:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:59,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:33:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:59,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:33:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:59,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:33:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:59,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:33:59,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:59,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:33:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:59,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:33:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:59,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:33:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:59,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:33:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:59,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:33:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:59,456 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:33:59,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:33:59,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709567034] [2023-12-16 04:33:59,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709567034] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:33:59,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:33:59,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:33:59,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540909807] [2023-12-16 04:33:59,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:33:59,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 04:33:59,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:33:59,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 04:33:59,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:33:59,458 INFO L87 Difference]: Start difference. First operand 117 states and 167 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:33:59,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:33:59,479 INFO L93 Difference]: Finished difference Result 233 states and 333 transitions. [2023-12-16 04:33:59,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 04:33:59,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2023-12-16 04:33:59,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:33:59,481 INFO L225 Difference]: With dead ends: 233 [2023-12-16 04:33:59,481 INFO L226 Difference]: Without dead ends: 117 [2023-12-16 04:33:59,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:33:59,483 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:33:59,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 258 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:33:59,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-12-16 04:33:59,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2023-12-16 04:33:59,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 103 states have (on average 1.3689320388349515) internal successors, (141), 103 states have internal predecessors, (141), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 04:33:59,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 165 transitions. [2023-12-16 04:33:59,492 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 165 transitions. Word has length 114 [2023-12-16 04:33:59,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:33:59,492 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 165 transitions. [2023-12-16 04:33:59,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:33:59,492 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 165 transitions. [2023-12-16 04:33:59,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-16 04:33:59,493 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:33:59,493 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:33:59,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-16 04:33:59,494 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:33:59,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:33:59,494 INFO L85 PathProgramCache]: Analyzing trace with hash 320898001, now seen corresponding path program 1 times [2023-12-16 04:33:59,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:33:59,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728299336] [2023-12-16 04:33:59,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:33:59,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:33:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:04,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:34:04,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:04,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:34:04,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:04,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:34:04,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:04,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:34:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:04,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:34:04,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:04,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:34:04,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:04,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:34:04,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:04,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:34:04,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:04,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:34:04,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:04,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:34:04,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:04,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:34:04,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:04,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:34:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:04,359 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:34:04,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:34:04,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728299336] [2023-12-16 04:34:04,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728299336] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:34:04,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:34:04,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-12-16 04:34:04,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147438524] [2023-12-16 04:34:04,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:34:04,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-16 04:34:04,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:34:04,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-16 04:34:04,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2023-12-16 04:34:04,362 INFO L87 Difference]: Start difference. First operand 117 states and 165 transitions. Second operand has 17 states, 16 states have (on average 3.5625) internal successors, (57), 17 states have internal predecessors, (57), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-16 04:34:07,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:34:07,282 INFO L93 Difference]: Finished difference Result 359 states and 498 transitions. [2023-12-16 04:34:07,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-16 04:34:07,283 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.5625) internal successors, (57), 17 states have internal predecessors, (57), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 114 [2023-12-16 04:34:07,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:34:07,285 INFO L225 Difference]: With dead ends: 359 [2023-12-16 04:34:07,285 INFO L226 Difference]: Without dead ends: 243 [2023-12-16 04:34:07,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=209, Invalid=721, Unknown=0, NotChecked=0, Total=930 [2023-12-16 04:34:07,286 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 516 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-16 04:34:07,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 800 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-16 04:34:07,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2023-12-16 04:34:07,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 134. [2023-12-16 04:34:07,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 120 states have (on average 1.375) internal successors, (165), 120 states have internal predecessors, (165), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 04:34:07,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 189 transitions. [2023-12-16 04:34:07,299 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 189 transitions. Word has length 114 [2023-12-16 04:34:07,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:34:07,299 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 189 transitions. [2023-12-16 04:34:07,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.5625) internal successors, (57), 17 states have internal predecessors, (57), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-16 04:34:07,300 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 189 transitions. [2023-12-16 04:34:07,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-16 04:34:07,301 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:34:07,301 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:34:07,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 04:34:07,302 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:34:07,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:34:07,302 INFO L85 PathProgramCache]: Analyzing trace with hash -958965677, now seen corresponding path program 1 times [2023-12-16 04:34:07,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:34:07,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029040530] [2023-12-16 04:34:07,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:34:07,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:34:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:09,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:34:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:09,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:34:09,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:09,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:34:09,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:09,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:34:09,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:09,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:34:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:09,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:34:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:09,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:34:09,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:09,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:34:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:09,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:34:09,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:09,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:34:09,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:09,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:34:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:09,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:34:09,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:09,974 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:34:09,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:34:09,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029040530] [2023-12-16 04:34:09,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029040530] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:34:09,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:34:09,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-12-16 04:34:09,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271147777] [2023-12-16 04:34:09,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:34:09,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-16 04:34:09,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:34:09,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-16 04:34:09,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-12-16 04:34:09,977 INFO L87 Difference]: Start difference. First operand 134 states and 189 transitions. Second operand has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 16 states have internal predecessors, (57), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2023-12-16 04:34:11,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:34:11,295 INFO L93 Difference]: Finished difference Result 369 states and 513 transitions. [2023-12-16 04:34:11,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 04:34:11,297 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 16 states have internal predecessors, (57), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) Word has length 114 [2023-12-16 04:34:11,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:34:11,298 INFO L225 Difference]: With dead ends: 369 [2023-12-16 04:34:11,298 INFO L226 Difference]: Without dead ends: 236 [2023-12-16 04:34:11,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2023-12-16 04:34:11,299 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 463 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 1209 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-16 04:34:11,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 746 Invalid, 1254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1209 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-16 04:34:11,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2023-12-16 04:34:11,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 211. [2023-12-16 04:34:11,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 194 states have (on average 1.3608247422680413) internal successors, (264), 195 states have internal predecessors, (264), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-16 04:34:11,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 292 transitions. [2023-12-16 04:34:11,322 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 292 transitions. Word has length 114 [2023-12-16 04:34:11,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:34:11,322 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 292 transitions. [2023-12-16 04:34:11,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 16 states have internal predecessors, (57), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2023-12-16 04:34:11,323 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 292 transitions. [2023-12-16 04:34:11,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-16 04:34:11,324 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:34:11,324 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:34:11,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-16 04:34:11,324 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:34:11,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:34:11,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1530563285, now seen corresponding path program 1 times [2023-12-16 04:34:11,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:34:11,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094302954] [2023-12-16 04:34:11,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:34:11,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:34:11,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:11,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:34:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:11,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:34:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:11,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:34:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:11,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:34:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:11,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:34:11,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:11,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:34:11,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:11,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:34:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:11,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:34:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:11,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:34:11,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:12,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:34:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:12,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:34:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:12,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:34:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:12,013 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:34:12,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:34:12,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094302954] [2023-12-16 04:34:12,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094302954] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:34:12,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:34:12,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 04:34:12,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601728503] [2023-12-16 04:34:12,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:34:12,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 04:34:12,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:34:12,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 04:34:12,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:34:12,015 INFO L87 Difference]: Start difference. First operand 211 states and 292 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:34:12,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:34:12,440 INFO L93 Difference]: Finished difference Result 530 states and 727 transitions. [2023-12-16 04:34:12,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:34:12,441 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2023-12-16 04:34:12,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:34:12,443 INFO L225 Difference]: With dead ends: 530 [2023-12-16 04:34:12,444 INFO L226 Difference]: Without dead ends: 320 [2023-12-16 04:34:12,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-12-16 04:34:12,445 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 329 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:34:12,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 511 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:34:12,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2023-12-16 04:34:12,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 211. [2023-12-16 04:34:12,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 194 states have (on average 1.3556701030927836) internal successors, (263), 195 states have internal predecessors, (263), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-16 04:34:12,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 291 transitions. [2023-12-16 04:34:12,474 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 291 transitions. Word has length 114 [2023-12-16 04:34:12,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:34:12,474 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 291 transitions. [2023-12-16 04:34:12,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:34:12,474 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 291 transitions. [2023-12-16 04:34:12,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-16 04:34:12,475 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:34:12,475 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:34:12,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-16 04:34:12,476 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:34:12,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:34:12,476 INFO L85 PathProgramCache]: Analyzing trace with hash -2050841261, now seen corresponding path program 1 times [2023-12-16 04:34:12,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:34:12,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842835860] [2023-12-16 04:34:12,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:34:12,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:34:12,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:13,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:34:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:13,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:34:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:13,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:34:13,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:13,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:34:13,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:13,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:34:13,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:13,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:34:13,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:13,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:34:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:13,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:34:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:13,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:34:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:13,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:34:13,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:13,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:34:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:13,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:34:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:13,348 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:34:13,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:34:13,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842835860] [2023-12-16 04:34:13,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842835860] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:34:13,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:34:13,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-16 04:34:13,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426597143] [2023-12-16 04:34:13,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:34:13,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 04:34:13,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:34:13,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 04:34:13,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:34:13,351 INFO L87 Difference]: Start difference. First operand 211 states and 291 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:34:13,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:34:13,774 INFO L93 Difference]: Finished difference Result 503 states and 687 transitions. [2023-12-16 04:34:13,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:34:13,775 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2023-12-16 04:34:13,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:34:13,776 INFO L225 Difference]: With dead ends: 503 [2023-12-16 04:34:13,776 INFO L226 Difference]: Without dead ends: 292 [2023-12-16 04:34:13,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-12-16 04:34:13,778 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 295 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:34:13,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 494 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:34:13,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2023-12-16 04:34:13,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 198. [2023-12-16 04:34:13,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 181 states have (on average 1.3480662983425415) internal successors, (244), 182 states have internal predecessors, (244), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-16 04:34:13,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 272 transitions. [2023-12-16 04:34:13,798 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 272 transitions. Word has length 114 [2023-12-16 04:34:13,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:34:13,798 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 272 transitions. [2023-12-16 04:34:13,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:34:13,799 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 272 transitions. [2023-12-16 04:34:13,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-16 04:34:13,800 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:34:13,800 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:34:13,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-16 04:34:13,800 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:34:13,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:34:13,800 INFO L85 PathProgramCache]: Analyzing trace with hash 964262357, now seen corresponding path program 1 times [2023-12-16 04:34:13,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:34:13,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594196784] [2023-12-16 04:34:13,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:34:13,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:34:13,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:15,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:34:15,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:15,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:34:15,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:15,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:34:15,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:15,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:34:15,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:15,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:34:15,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:15,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:34:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:15,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:34:15,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:15,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:34:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:15,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:34:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:15,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:34:15,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:15,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:34:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:15,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:34:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:15,377 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:34:15,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:34:15,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594196784] [2023-12-16 04:34:15,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594196784] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:34:15,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:34:15,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-16 04:34:15,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873653892] [2023-12-16 04:34:15,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:34:15,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 04:34:15,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:34:15,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 04:34:15,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-12-16 04:34:15,379 INFO L87 Difference]: Start difference. First operand 198 states and 272 transitions. Second operand has 12 states, 10 states have (on average 5.7) internal successors, (57), 12 states have internal predecessors, (57), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2023-12-16 04:34:15,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:34:15,987 INFO L93 Difference]: Finished difference Result 387 states and 533 transitions. [2023-12-16 04:34:15,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 04:34:15,988 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.7) internal successors, (57), 12 states have internal predecessors, (57), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) Word has length 114 [2023-12-16 04:34:15,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:34:15,989 INFO L225 Difference]: With dead ends: 387 [2023-12-16 04:34:15,989 INFO L226 Difference]: Without dead ends: 190 [2023-12-16 04:34:15,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2023-12-16 04:34:15,990 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 111 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 04:34:15,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 408 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 04:34:15,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-12-16 04:34:16,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2023-12-16 04:34:16,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 172 states have (on average 1.3313953488372092) internal successors, (229), 173 states have internal predecessors, (229), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-16 04:34:16,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 257 transitions. [2023-12-16 04:34:16,009 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 257 transitions. Word has length 114 [2023-12-16 04:34:16,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:34:16,009 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 257 transitions. [2023-12-16 04:34:16,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.7) internal successors, (57), 12 states have internal predecessors, (57), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2023-12-16 04:34:16,010 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 257 transitions. [2023-12-16 04:34:16,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-16 04:34:16,011 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:34:16,011 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:34:16,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-16 04:34:16,011 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:34:16,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:34:16,011 INFO L85 PathProgramCache]: Analyzing trace with hash -841175977, now seen corresponding path program 1 times [2023-12-16 04:34:16,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:34:16,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531637871] [2023-12-16 04:34:16,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:34:16,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:34:16,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:26,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:34:26,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:26,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:34:26,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:26,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:34:26,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:26,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:34:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:26,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:34:26,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:26,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:34:26,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:26,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:34:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:26,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:34:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:26,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:34:26,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:26,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:34:26,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:26,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:34:26,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:26,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:34:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:26,908 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:34:26,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:34:26,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531637871] [2023-12-16 04:34:26,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531637871] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:34:26,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:34:26,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-12-16 04:34:26,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373289325] [2023-12-16 04:34:26,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:34:26,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-16 04:34:26,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:34:26,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-16 04:34:26,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2023-12-16 04:34:26,911 INFO L87 Difference]: Start difference. First operand 189 states and 257 transitions. Second operand has 18 states, 16 states have (on average 3.5625) internal successors, (57), 18 states have internal predecessors, (57), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2023-12-16 04:34:31,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result VALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-16 04:34:34,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.50s for a HTC check with result VALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-16 04:34:43,797 WARN L293 SmtUtils]: Spent 6.09s on a formula simplification. DAG size of input: 140 DAG size of output: 126 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-12-16 04:34:47,406 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 04:34:48,607 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-16 04:34:48,613 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 137 [2023-12-16 04:34:48,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 04:34:48,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=145, Invalid=557, Unknown=0, NotChecked=0, Total=702 [2023-12-16 04:34:48,615 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 146 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2023-12-16 04:34:48,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 407 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2023-12-16 04:34:48,620 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 04:34:48,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-16 04:34:48,620 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (189states) and FLOYD_HOARE automaton (currently 14 states, 18 states before enhancement),while PredicateUnifier was unifying predicates,while executing Executor. [2023-12-16 04:34:48,624 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:34:48,629 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 04:34:48,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:34:48 BoogieIcfgContainer [2023-12-16 04:34:48,631 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 04:34:48,631 INFO L158 Benchmark]: Toolchain (without parser) took 55041.86ms. Allocated memory was 191.9MB in the beginning and 769.7MB in the end (delta: 577.8MB). Free memory was 144.2MB in the beginning and 427.2MB in the end (delta: -282.9MB). Peak memory consumption was 295.5MB. Max. memory is 8.0GB. [2023-12-16 04:34:48,631 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 191.9MB. Free memory is still 147.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 04:34:48,632 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.87ms. Allocated memory is still 191.9MB. Free memory was 144.2MB in the beginning and 128.2MB in the end (delta: 16.1MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-16 04:34:48,632 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.20ms. Allocated memory is still 191.9MB. Free memory was 128.2MB in the beginning and 124.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-16 04:34:48,632 INFO L158 Benchmark]: Boogie Preprocessor took 84.14ms. Allocated memory is still 191.9MB. Free memory was 124.0MB in the beginning and 119.1MB in the end (delta: 4.9MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-16 04:34:48,632 INFO L158 Benchmark]: RCFGBuilder took 767.81ms. Allocated memory is still 191.9MB. Free memory was 119.1MB in the beginning and 140.0MB in the end (delta: -21.0MB). Peak memory consumption was 18.0MB. Max. memory is 8.0GB. [2023-12-16 04:34:48,632 INFO L158 Benchmark]: TraceAbstraction took 53842.20ms. Allocated memory was 191.9MB in the beginning and 769.7MB in the end (delta: 577.8MB). Free memory was 139.0MB in the beginning and 427.2MB in the end (delta: -288.2MB). Peak memory consumption was 289.0MB. Max. memory is 8.0GB. [2023-12-16 04:34:48,633 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.55ms. Allocated memory is still 191.9MB. Free memory is still 147.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 283.87ms. Allocated memory is still 191.9MB. Free memory was 144.2MB in the beginning and 128.2MB in the end (delta: 16.1MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.20ms. Allocated memory is still 191.9MB. Free memory was 128.2MB in the beginning and 124.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 84.14ms. Allocated memory is still 191.9MB. Free memory was 124.0MB in the beginning and 119.1MB in the end (delta: 4.9MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 767.81ms. Allocated memory is still 191.9MB. Free memory was 119.1MB in the beginning and 140.0MB in the end (delta: -21.0MB). Peak memory consumption was 18.0MB. Max. memory is 8.0GB. * TraceAbstraction took 53842.20ms. Allocated memory was 191.9MB in the beginning and 769.7MB in the end (delta: 577.8MB). Free memory was 139.0MB in the beginning and 427.2MB in the end (delta: -288.2MB). Peak memory consumption was 289.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while NwaCegarLoop was constructing difference of abstraction (189states) and FLOYD_HOARE automaton (currently 14 states, 18 states before enhancement),while PredicateUnifier was unifying predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 53.8s, OverallIterations: 15, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 28.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2454 SdHoareTripleChecker+Valid, 12.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2446 mSDsluCounter, 6634 SdHoareTripleChecker+Invalid, 12.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4874 mSDsCounter, 124 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5510 IncrementalHoareTripleChecker+Invalid, 5634 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 124 mSolverCounterUnsat, 1760 mSDtfsCounter, 5510 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 574 GetRequests, 425 SyntacticMatches, 2 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 17.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=211occurred in iteration=11, InterpolantAutomatonStates: 100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 488 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 23.5s InterpolantComputationTime, 1690 NumberOfCodeBlocks, 1690 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1675 ConstructedInterpolants, 0 QuantifiedInterpolants, 17810 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 3960/3960 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 could not prove your program: Timeout Completed graceful shutdown