/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 true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-97.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 20:45:30,883 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 20:45:30,958 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-15 20:45:30,962 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 20:45:30,962 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 20:45:30,985 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 20:45:30,986 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 20:45:30,986 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 20:45:30,986 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 20:45:30,989 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 20:45:30,990 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 20:45:30,990 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 20:45:30,990 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 20:45:30,991 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 20:45:30,992 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 20:45:30,992 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 20:45:30,992 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 20:45:30,992 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 20:45:30,992 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 20:45:30,992 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 20:45:30,993 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 20:45:30,993 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 20:45:30,993 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 20:45:30,993 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 20:45:30,993 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 20:45:30,993 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 20:45:30,994 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 20:45:30,994 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 20:45:30,994 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 20:45:30,994 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 20:45:30,995 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 20:45:30,995 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 20:45:30,995 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:45:30,996 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 20:45:30,996 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 20:45:30,996 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 20:45:30,996 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 20:45:30,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 20:45:30,996 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 20:45:30,996 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 20:45:30,996 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 20:45:30,997 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 20:45:30,997 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 20:45:30,997 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 -> true [2023-12-15 20:45:31,193 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 20:45:31,206 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 20:45:31,208 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 20:45:31,208 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 20:45:31,209 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 20:45:31,209 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-97.i [2023-12-15 20:45:32,205 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 20:45:32,385 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 20:45:32,386 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-97.i [2023-12-15 20:45:32,394 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0290d17e9/e4a1989f24634f478cc52a9d2729c645/FLAG2d856d145 [2023-12-15 20:45:32,405 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0290d17e9/e4a1989f24634f478cc52a9d2729c645 [2023-12-15 20:45:32,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 20:45:32,407 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 20:45:32,410 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 20:45:32,410 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 20:45:32,414 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 20:45:32,415 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:45:32" (1/1) ... [2023-12-15 20:45:32,416 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12c07046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:45:32, skipping insertion in model container [2023-12-15 20:45:32,416 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:45:32" (1/1) ... [2023-12-15 20:45:32,442 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 20:45:32,544 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_floatingpointinfluence_no-floats_file-97.i[916,929] [2023-12-15 20:45:32,571 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:45:32,584 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 20:45:32,591 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_floatingpointinfluence_no-floats_file-97.i[916,929] [2023-12-15 20:45:32,603 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:45:32,618 INFO L206 MainTranslator]: Completed translation [2023-12-15 20:45:32,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:45:32 WrapperNode [2023-12-15 20:45:32,618 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 20:45:32,619 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 20:45:32,619 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 20:45:32,619 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 20:45:32,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:45:32" (1/1) ... [2023-12-15 20:45:32,639 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:45:32" (1/1) ... [2023-12-15 20:45:32,660 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 149 [2023-12-15 20:45:32,660 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 20:45:32,661 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 20:45:32,661 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 20:45:32,661 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 20:45:32,670 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:45:32" (1/1) ... [2023-12-15 20:45:32,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:45:32" (1/1) ... [2023-12-15 20:45:32,673 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:45:32" (1/1) ... [2023-12-15 20:45:32,684 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-15 20:45:32,684 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:45:32" (1/1) ... [2023-12-15 20:45:32,684 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:45:32" (1/1) ... [2023-12-15 20:45:32,688 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:45:32" (1/1) ... [2023-12-15 20:45:32,708 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:45:32" (1/1) ... [2023-12-15 20:45:32,709 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:45:32" (1/1) ... [2023-12-15 20:45:32,710 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:45:32" (1/1) ... [2023-12-15 20:45:32,712 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 20:45:32,713 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 20:45:32,713 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 20:45:32,713 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 20:45:32,722 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:45:32" (1/1) ... [2023-12-15 20:45:32,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:45:32,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:45:32,750 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-15 20:45:32,757 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-15 20:45:32,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 20:45:32,772 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 20:45:32,772 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 20:45:32,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 20:45:32,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 20:45:32,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 20:45:32,819 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 20:45:32,820 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 20:45:32,991 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 20:45:33,016 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 20:45:33,016 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 20:45:33,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:45:33 BoogieIcfgContainer [2023-12-15 20:45:33,016 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 20:45:33,018 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 20:45:33,018 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 20:45:33,020 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 20:45:33,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 08:45:32" (1/3) ... [2023-12-15 20:45:33,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65d36f2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:45:33, skipping insertion in model container [2023-12-15 20:45:33,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:45:32" (2/3) ... [2023-12-15 20:45:33,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65d36f2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:45:33, skipping insertion in model container [2023-12-15 20:45:33,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:45:33" (3/3) ... [2023-12-15 20:45:33,022 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-97.i [2023-12-15 20:45:33,034 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 20:45:33,034 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 20:45:33,068 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 20:45:33,072 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;@ff11f1f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 20:45:33,073 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 20:45:33,075 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 36 states have internal predecessors, (53), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-15 20:45:33,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-15 20:45:33,083 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:45:33,084 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:45:33,084 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:45:33,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:45:33,087 INFO L85 PathProgramCache]: Analyzing trace with hash 749005803, now seen corresponding path program 1 times [2023-12-15 20:45:33,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:45:33,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641437729] [2023-12-15 20:45:33,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:45:33,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:45:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:33,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:45:33,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:33,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:45:33,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:33,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:45:33,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:33,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:45:33,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:33,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:45:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:33,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:45:33,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:33,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:45:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:33,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:45:33,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:33,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:45:33,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:33,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:45:33,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:33,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:45:33,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:33,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:45:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:33,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:45:33,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:33,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:45:33,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:33,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:45:33,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:33,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:45:33,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:33,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:45:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:33,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 20:45:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:33,364 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-15 20:45:33,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:45:33,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641437729] [2023-12-15 20:45:33,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641437729] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:45:33,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:45:33,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 20:45:33,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386275057] [2023-12-15 20:45:33,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:45:33,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 20:45:33,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:45:33,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 20:45:33,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 20:45:33,395 INFO L87 Difference]: Start difference. First operand has 56 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 36 states have internal predecessors, (53), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-15 20:45:33,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:45:33,459 INFO L93 Difference]: Finished difference Result 109 states and 194 transitions. [2023-12-15 20:45:33,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 20:45:33,462 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 109 [2023-12-15 20:45:33,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:45:33,467 INFO L225 Difference]: With dead ends: 109 [2023-12-15 20:45:33,467 INFO L226 Difference]: Without dead ends: 54 [2023-12-15 20:45:33,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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-15 20:45:33,472 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:45:33,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:45:33,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-12-15 20:45:33,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-12-15 20:45:33,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-15 20:45:33,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 84 transitions. [2023-12-15 20:45:33,510 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 84 transitions. Word has length 109 [2023-12-15 20:45:33,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:45:33,510 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 84 transitions. [2023-12-15 20:45:33,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-15 20:45:33,511 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 84 transitions. [2023-12-15 20:45:33,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-15 20:45:33,513 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:45:33,513 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:45:33,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 20:45:33,514 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:45:33,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:45:33,514 INFO L85 PathProgramCache]: Analyzing trace with hash 375050923, now seen corresponding path program 1 times [2023-12-15 20:45:33,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:45:33,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913793239] [2023-12-15 20:45:33,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:45:33,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:45:33,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:33,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:45:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:33,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:45:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:33,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:45:33,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:33,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:45:33,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:33,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:45:33,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:33,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:45:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:33,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:45:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:33,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:45:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:33,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:45:33,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:33,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:45:33,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:33,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:45:33,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:33,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:45:33,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:33,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:45:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:33,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:45:33,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:33,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:45:33,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:33,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:45:33,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:33,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:45:33,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:33,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 20:45:33,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:33,889 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-15 20:45:33,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:45:33,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913793239] [2023-12-15 20:45:33,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913793239] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:45:33,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:45:33,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 20:45:33,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125936394] [2023-12-15 20:45:33,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:45:33,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 20:45:33,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:45:33,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 20:45:33,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 20:45:33,893 INFO L87 Difference]: Start difference. First operand 54 states and 84 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-15 20:45:34,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:45:34,031 INFO L93 Difference]: Finished difference Result 153 states and 236 transitions. [2023-12-15 20:45:34,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 20:45:34,032 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 109 [2023-12-15 20:45:34,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:45:34,036 INFO L225 Difference]: With dead ends: 153 [2023-12-15 20:45:34,036 INFO L226 Difference]: Without dead ends: 100 [2023-12-15 20:45:34,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-15 20:45:34,041 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 79 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:45:34,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 453 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:45:34,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-12-15 20:45:34,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 57. [2023-12-15 20:45:34,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 37 states have internal predecessors, (51), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-15 20:45:34,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 87 transitions. [2023-12-15 20:45:34,050 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 87 transitions. Word has length 109 [2023-12-15 20:45:34,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:45:34,052 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 87 transitions. [2023-12-15 20:45:34,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-15 20:45:34,054 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 87 transitions. [2023-12-15 20:45:34,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-15 20:45:34,060 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:45:34,061 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:45:34,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 20:45:34,062 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:45:34,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:45:34,062 INFO L85 PathProgramCache]: Analyzing trace with hash -965865600, now seen corresponding path program 1 times [2023-12-15 20:45:34,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:45:34,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779691723] [2023-12-15 20:45:34,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:45:34,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:45:34,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:34,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:45:34,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:34,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:45:34,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:34,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:45:34,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:34,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:45:34,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:34,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:45:34,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:34,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:45:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:34,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:45:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:34,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:45:34,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:34,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:45:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:34,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:45:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:34,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:45:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:34,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:45:34,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:34,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:45:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:34,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:45:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:34,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:45:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:34,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:45:34,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:34,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:45:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:34,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 20:45:34,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:34,394 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-15 20:45:34,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:45:34,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779691723] [2023-12-15 20:45:34,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779691723] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:45:34,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:45:34,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 20:45:34,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958964703] [2023-12-15 20:45:34,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:45:34,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 20:45:34,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:45:34,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 20:45:34,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-15 20:45:34,401 INFO L87 Difference]: Start difference. First operand 57 states and 87 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-15 20:45:34,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:45:34,614 INFO L93 Difference]: Finished difference Result 206 states and 314 transitions. [2023-12-15 20:45:34,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 20:45:34,614 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 110 [2023-12-15 20:45:34,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:45:34,626 INFO L225 Difference]: With dead ends: 206 [2023-12-15 20:45:34,626 INFO L226 Difference]: Without dead ends: 150 [2023-12-15 20:45:34,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-15 20:45:34,629 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 156 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:45:34,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 464 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:45:34,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-12-15 20:45:34,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 63. [2023-12-15 20:45:34,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 43 states have internal predecessors, (60), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-15 20:45:34,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 96 transitions. [2023-12-15 20:45:34,644 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 96 transitions. Word has length 110 [2023-12-15 20:45:34,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:45:34,645 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 96 transitions. [2023-12-15 20:45:34,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-15 20:45:34,645 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 96 transitions. [2023-12-15 20:45:34,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-15 20:45:34,646 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:45:34,646 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:45:34,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 20:45:34,646 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:45:34,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:45:34,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1302304182, now seen corresponding path program 1 times [2023-12-15 20:45:34,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:45:34,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150242764] [2023-12-15 20:45:34,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:45:34,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:45:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:34,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:45:34,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:34,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:45:34,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:34,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:45:34,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:34,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:45:34,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:34,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:45:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:34,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:45:34,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:34,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:45:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:34,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:45:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:34,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:45:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:34,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:45:34,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:34,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:45:34,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:34,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:45:34,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:34,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:45:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:34,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:45:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:34,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:45:34,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:34,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:45:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:34,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:45:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:34,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 20:45:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:34,910 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-15 20:45:34,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:45:34,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150242764] [2023-12-15 20:45:34,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150242764] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:45:34,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:45:34,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 20:45:34,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422158990] [2023-12-15 20:45:34,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:45:34,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 20:45:34,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:45:34,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 20:45:34,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-15 20:45:34,912 INFO L87 Difference]: Start difference. First operand 63 states and 96 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-15 20:45:35,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:45:35,178 INFO L93 Difference]: Finished difference Result 212 states and 319 transitions. [2023-12-15 20:45:35,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 20:45:35,179 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 111 [2023-12-15 20:45:35,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:45:35,182 INFO L225 Difference]: With dead ends: 212 [2023-12-15 20:45:35,182 INFO L226 Difference]: Without dead ends: 150 [2023-12-15 20:45:35,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-15 20:45:35,190 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 159 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 20:45:35,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 500 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 20:45:35,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-12-15 20:45:35,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 61. [2023-12-15 20:45:35,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 41 states have internal predecessors, (57), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-15 20:45:35,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 93 transitions. [2023-12-15 20:45:35,201 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 93 transitions. Word has length 111 [2023-12-15 20:45:35,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:45:35,201 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 93 transitions. [2023-12-15 20:45:35,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-15 20:45:35,202 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 93 transitions. [2023-12-15 20:45:35,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-15 20:45:35,202 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:45:35,202 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:45:35,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 20:45:35,203 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:45:35,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:45:35,203 INFO L85 PathProgramCache]: Analyzing trace with hash -644821422, now seen corresponding path program 1 times [2023-12-15 20:45:35,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:45:35,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660333031] [2023-12-15 20:45:35,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:45:35,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:45:35,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:35,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:45:35,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:35,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:45:35,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:35,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:45:35,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:35,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:45:35,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:35,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:45:35,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:35,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:45:35,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:35,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:45:35,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:35,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:45:35,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:35,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:45:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:35,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:45:35,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:35,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:45:35,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:35,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:45:35,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:35,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:45:35,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:35,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:45:35,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:35,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:45:35,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:35,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:45:35,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:35,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:45:35,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:35,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 20:45:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:35,527 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 63 proven. 33 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2023-12-15 20:45:35,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:45:35,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660333031] [2023-12-15 20:45:35,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660333031] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 20:45:35,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173353263] [2023-12-15 20:45:35,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:45:35,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:45:35,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:45:35,544 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 20:45:35,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-15 20:45:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:35,622 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-15 20:45:35,631 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:45:35,876 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 348 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-12-15 20:45:35,878 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 20:45:36,127 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2023-12-15 20:45:36,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173353263] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 20:45:36,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 20:45:36,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2023-12-15 20:45:36,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852967188] [2023-12-15 20:45:36,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 20:45:36,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-15 20:45:36,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:45:36,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-15 20:45:36,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-12-15 20:45:36,130 INFO L87 Difference]: Start difference. First operand 61 states and 93 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 3 states have call successors, (25), 3 states have call predecessors, (25), 7 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2023-12-15 20:45:36,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:45:36,450 INFO L93 Difference]: Finished difference Result 151 states and 225 transitions. [2023-12-15 20:45:36,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 20:45:36,451 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 3 states have call successors, (25), 3 states have call predecessors, (25), 7 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) Word has length 111 [2023-12-15 20:45:36,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:45:36,451 INFO L225 Difference]: With dead ends: 151 [2023-12-15 20:45:36,451 INFO L226 Difference]: Without dead ends: 91 [2023-12-15 20:45:36,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 248 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2023-12-15 20:45:36,452 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 180 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 20:45:36,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 146 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 20:45:36,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-12-15 20:45:36,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 77. [2023-12-15 20:45:36,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 46 states have internal predecessors, (55), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-15 20:45:36,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 111 transitions. [2023-12-15 20:45:36,476 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 111 transitions. Word has length 111 [2023-12-15 20:45:36,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:45:36,476 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 111 transitions. [2023-12-15 20:45:36,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 3 states have call successors, (25), 3 states have call predecessors, (25), 7 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2023-12-15 20:45:36,477 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 111 transitions. [2023-12-15 20:45:36,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-15 20:45:36,479 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:45:36,479 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:45:36,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-15 20:45:36,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:45:36,684 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:45:36,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:45:36,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1168438235, now seen corresponding path program 1 times [2023-12-15 20:45:36,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:45:36,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493801497] [2023-12-15 20:45:36,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:45:36,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:45:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:37,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:45:37,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:37,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:45:37,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:37,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:45:37,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:37,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:45:37,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:37,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:45:37,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:37,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:45:37,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:37,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:45:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:37,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:45:37,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:37,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:45:37,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:37,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:45:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:37,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:45:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:37,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:45:37,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:37,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:45:37,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:37,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:45:37,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:37,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:45:37,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:37,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:45:37,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:37,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:45:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:37,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 20:45:37,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:37,545 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 63 proven. 33 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2023-12-15 20:45:37,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:45:37,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493801497] [2023-12-15 20:45:37,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493801497] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 20:45:37,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046503181] [2023-12-15 20:45:37,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:45:37,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:45:37,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:45:37,547 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 20:45:37,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-15 20:45:37,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:37,655 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 39 conjunts are in the unsatisfiable core [2023-12-15 20:45:37,661 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:45:38,488 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 375 proven. 36 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2023-12-15 20:45:38,488 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 20:45:39,186 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2023-12-15 20:45:39,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046503181] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 20:45:39,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 20:45:39,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17, 15] total 33 [2023-12-15 20:45:39,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660322885] [2023-12-15 20:45:39,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 20:45:39,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-15 20:45:39,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:45:39,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-15 20:45:39,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=795, Unknown=0, NotChecked=0, Total=1056 [2023-12-15 20:45:39,189 INFO L87 Difference]: Start difference. First operand 77 states and 111 transitions. Second operand has 33 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 4 states have call successors, (25), 4 states have call predecessors, (25), 9 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2023-12-15 20:45:40,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:45:40,485 INFO L93 Difference]: Finished difference Result 130 states and 173 transitions. [2023-12-15 20:45:40,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-15 20:45:40,486 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 4 states have call successors, (25), 4 states have call predecessors, (25), 9 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) Word has length 112 [2023-12-15 20:45:40,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:45:40,487 INFO L225 Difference]: With dead ends: 130 [2023-12-15 20:45:40,487 INFO L226 Difference]: Without dead ends: 128 [2023-12-15 20:45:40,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 238 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 738 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=610, Invalid=1840, Unknown=0, NotChecked=0, Total=2450 [2023-12-15 20:45:40,488 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 201 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 1222 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-15 20:45:40,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 310 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1222 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-15 20:45:40,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-12-15 20:45:40,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 114. [2023-12-15 20:45:40,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 73 states have (on average 1.2054794520547945) internal successors, (88), 75 states have internal predecessors, (88), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-15 20:45:40,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 156 transitions. [2023-12-15 20:45:40,501 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 156 transitions. Word has length 112 [2023-12-15 20:45:40,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:45:40,501 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 156 transitions. [2023-12-15 20:45:40,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 4 states have call successors, (25), 4 states have call predecessors, (25), 9 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2023-12-15 20:45:40,501 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 156 transitions. [2023-12-15 20:45:40,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-15 20:45:40,502 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:45:40,502 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:45:40,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-15 20:45:40,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-15 20:45:40,708 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:45:40,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:45:40,708 INFO L85 PathProgramCache]: Analyzing trace with hash -492983984, now seen corresponding path program 1 times [2023-12-15 20:45:40,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:45:40,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469225512] [2023-12-15 20:45:40,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:45:40,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:45:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:40,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:45:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:40,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:45:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:40,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:45:40,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:40,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:45:40,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:40,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:45:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:40,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:45:40,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:40,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:45:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:40,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:45:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:40,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:45:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:40,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:45:40,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:40,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:45:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:40,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:45:40,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:40,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:45:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:40,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:45:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:40,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:45:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:40,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:45:40,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:40,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:45:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:40,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 20:45:40,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:40,756 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-15 20:45:40,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:45:40,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469225512] [2023-12-15 20:45:40,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469225512] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:45:40,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:45:40,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:45:40,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466839968] [2023-12-15 20:45:40,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:45:40,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:45:40,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:45:40,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:45:40,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:45:40,757 INFO L87 Difference]: Start difference. First operand 114 states and 156 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-15 20:45:40,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:45:40,784 INFO L93 Difference]: Finished difference Result 213 states and 284 transitions. [2023-12-15 20:45:40,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:45:40,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 114 [2023-12-15 20:45:40,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:45:40,786 INFO L225 Difference]: With dead ends: 213 [2023-12-15 20:45:40,786 INFO L226 Difference]: Without dead ends: 115 [2023-12-15 20:45:40,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 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-15 20:45:40,787 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 9 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:45:40,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 142 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:45:40,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-12-15 20:45:40,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 108. [2023-12-15 20:45:40,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 67 states have (on average 1.164179104477612) internal successors, (78), 69 states have internal predecessors, (78), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-15 20:45:40,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 146 transitions. [2023-12-15 20:45:40,799 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 146 transitions. Word has length 114 [2023-12-15 20:45:40,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:45:40,800 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 146 transitions. [2023-12-15 20:45:40,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-15 20:45:40,800 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 146 transitions. [2023-12-15 20:45:40,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-15 20:45:40,801 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:45:40,801 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:45:40,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 20:45:40,801 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:45:40,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:45:40,802 INFO L85 PathProgramCache]: Analyzing trace with hash 137954512, now seen corresponding path program 1 times [2023-12-15 20:45:40,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:45:40,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906160751] [2023-12-15 20:45:40,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:45:40,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:45:40,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:40,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:45:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:40,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:45:40,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:40,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:45:40,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:40,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:45:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:40,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:45:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:40,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:45:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:40,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:45:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:40,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:45:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:40,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:45:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:40,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:45:40,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:40,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:45:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:40,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:45:40,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:40,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:45:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:40,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:45:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:40,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:45:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:40,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:45:40,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:40,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:45:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:40,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 20:45:40,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:40,894 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-15 20:45:40,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:45:40,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906160751] [2023-12-15 20:45:40,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906160751] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:45:40,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:45:40,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 20:45:40,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513593013] [2023-12-15 20:45:40,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:45:40,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 20:45:40,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:45:40,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 20:45:40,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 20:45:40,895 INFO L87 Difference]: Start difference. First operand 108 states and 146 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-15 20:45:40,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:45:40,961 INFO L93 Difference]: Finished difference Result 200 states and 266 transitions. [2023-12-15 20:45:40,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:45:40,962 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 114 [2023-12-15 20:45:40,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:45:40,962 INFO L225 Difference]: With dead ends: 200 [2023-12-15 20:45:40,962 INFO L226 Difference]: Without dead ends: 108 [2023-12-15 20:45:40,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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-15 20:45:40,963 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 74 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:45:40,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 59 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:45:40,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-12-15 20:45:40,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2023-12-15 20:45:40,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 67 states have (on average 1.1343283582089552) internal successors, (76), 69 states have internal predecessors, (76), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-15 20:45:40,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 144 transitions. [2023-12-15 20:45:40,977 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 144 transitions. Word has length 114 [2023-12-15 20:45:40,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:45:40,978 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 144 transitions. [2023-12-15 20:45:40,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-15 20:45:40,978 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 144 transitions. [2023-12-15 20:45:40,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-15 20:45:40,979 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:45:40,979 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:45:40,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 20:45:40,979 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:45:40,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:45:40,979 INFO L85 PathProgramCache]: Analyzing trace with hash 927117854, now seen corresponding path program 1 times [2023-12-15 20:45:40,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:45:40,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067155597] [2023-12-15 20:45:40,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:45:40,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:45:40,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:45:41,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:45:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:45:41,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:45:41,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:45:41,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:45:41,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:45:41,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:45:41,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:45:41,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:45:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:45:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:45:41,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:45:41,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:45:41,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:45:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:45:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:45:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 20:45:41,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,024 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-15 20:45:41,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:45:41,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067155597] [2023-12-15 20:45:41,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067155597] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:45:41,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:45:41,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:45:41,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642689620] [2023-12-15 20:45:41,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:45:41,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:45:41,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:45:41,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:45:41,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:45:41,026 INFO L87 Difference]: Start difference. First operand 108 states and 144 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-15 20:45:41,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:45:41,049 INFO L93 Difference]: Finished difference Result 200 states and 262 transitions. [2023-12-15 20:45:41,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:45:41,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 115 [2023-12-15 20:45:41,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:45:41,051 INFO L225 Difference]: With dead ends: 200 [2023-12-15 20:45:41,051 INFO L226 Difference]: Without dead ends: 108 [2023-12-15 20:45:41,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 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-15 20:45:41,051 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 16 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:45:41,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 135 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:45:41,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-12-15 20:45:41,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2023-12-15 20:45:41,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 69 states have internal predecessors, (75), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-15 20:45:41,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 143 transitions. [2023-12-15 20:45:41,063 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 143 transitions. Word has length 115 [2023-12-15 20:45:41,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:45:41,064 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 143 transitions. [2023-12-15 20:45:41,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-15 20:45:41,064 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 143 transitions. [2023-12-15 20:45:41,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-15 20:45:41,065 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:45:41,065 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:45:41,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 20:45:41,065 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:45:41,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:45:41,065 INFO L85 PathProgramCache]: Analyzing trace with hash 620700137, now seen corresponding path program 1 times [2023-12-15 20:45:41,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:45:41,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93753337] [2023-12-15 20:45:41,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:45:41,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:45:41,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:45:41,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:45:41,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:45:41,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:45:41,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:45:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:45:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:45:41,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:45:41,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:45:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:45:41,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:45:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:45:41,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:45:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:45:41,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:45:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:45:41,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:45:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 20:45:41,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,109 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-15 20:45:41,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:45:41,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93753337] [2023-12-15 20:45:41,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93753337] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:45:41,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:45:41,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:45:41,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108975232] [2023-12-15 20:45:41,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:45:41,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:45:41,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:45:41,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:45:41,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:45:41,110 INFO L87 Difference]: Start difference. First operand 108 states and 143 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-15 20:45:41,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:45:41,142 INFO L93 Difference]: Finished difference Result 265 states and 341 transitions. [2023-12-15 20:45:41,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:45:41,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2023-12-15 20:45:41,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:45:41,143 INFO L225 Difference]: With dead ends: 265 [2023-12-15 20:45:41,143 INFO L226 Difference]: Without dead ends: 173 [2023-12-15 20:45:41,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 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-15 20:45:41,144 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 60 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:45:41,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 144 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:45:41,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2023-12-15 20:45:41,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 170. [2023-12-15 20:45:41,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 106 states have (on average 1.1037735849056605) internal successors, (117), 109 states have internal predecessors, (117), 52 states have call successors, (52), 11 states have call predecessors, (52), 11 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2023-12-15 20:45:41,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 221 transitions. [2023-12-15 20:45:41,163 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 221 transitions. Word has length 118 [2023-12-15 20:45:41,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:45:41,164 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 221 transitions. [2023-12-15 20:45:41,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-15 20:45:41,164 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 221 transitions. [2023-12-15 20:45:41,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-15 20:45:41,165 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:45:41,165 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:45:41,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-15 20:45:41,165 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:45:41,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:45:41,165 INFO L85 PathProgramCache]: Analyzing trace with hash 677958439, now seen corresponding path program 1 times [2023-12-15 20:45:41,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:45:41,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955078593] [2023-12-15 20:45:41,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:45:41,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:45:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:45:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:45:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:45:41,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:45:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:45:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:45:41,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:45:41,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:45:41,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:45:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:45:41,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:45:41,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:45:41,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:45:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:45:41,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:45:41,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:45:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:45:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 20:45:41,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,318 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 27 proven. 24 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-12-15 20:45:41,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:45:41,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955078593] [2023-12-15 20:45:41,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955078593] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 20:45:41,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643633859] [2023-12-15 20:45:41,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:45:41,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:45:41,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:45:41,319 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 20:45:41,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-15 20:45:41,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:41,379 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-15 20:45:41,382 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:45:41,566 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 323 proven. 24 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2023-12-15 20:45:41,567 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 20:45:41,703 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 27 proven. 24 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-12-15 20:45:41,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643633859] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 20:45:41,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 20:45:41,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 17 [2023-12-15 20:45:41,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020235533] [2023-12-15 20:45:41,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 20:45:41,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-15 20:45:41,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:45:41,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-15 20:45:41,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2023-12-15 20:45:41,706 INFO L87 Difference]: Start difference. First operand 170 states and 221 transitions. Second operand has 17 states, 16 states have (on average 4.8125) internal successors, (77), 17 states have internal predecessors, (77), 6 states have call successors, (54), 3 states have call predecessors, (54), 6 states have return successors, (54), 6 states have call predecessors, (54), 6 states have call successors, (54) [2023-12-15 20:45:42,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:45:42,475 INFO L93 Difference]: Finished difference Result 798 states and 1010 transitions. [2023-12-15 20:45:42,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-15 20:45:42,476 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.8125) internal successors, (77), 17 states have internal predecessors, (77), 6 states have call successors, (54), 3 states have call predecessors, (54), 6 states have return successors, (54), 6 states have call predecessors, (54), 6 states have call successors, (54) Word has length 118 [2023-12-15 20:45:42,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:45:42,481 INFO L225 Difference]: With dead ends: 798 [2023-12-15 20:45:42,481 INFO L226 Difference]: Without dead ends: 644 [2023-12-15 20:45:42,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=370, Invalid=1036, Unknown=0, NotChecked=0, Total=1406 [2023-12-15 20:45:42,482 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 224 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-15 20:45:42,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 558 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1064 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-15 20:45:42,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2023-12-15 20:45:42,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 207. [2023-12-15 20:45:42,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 139 states have (on average 1.1223021582733812) internal successors, (156), 141 states have internal predecessors, (156), 53 states have call successors, (53), 14 states have call predecessors, (53), 14 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2023-12-15 20:45:42,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 262 transitions. [2023-12-15 20:45:42,519 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 262 transitions. Word has length 118 [2023-12-15 20:45:42,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:45:42,519 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 262 transitions. [2023-12-15 20:45:42,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.8125) internal successors, (77), 17 states have internal predecessors, (77), 6 states have call successors, (54), 3 states have call predecessors, (54), 6 states have return successors, (54), 6 states have call predecessors, (54), 6 states have call successors, (54) [2023-12-15 20:45:42,520 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 262 transitions. [2023-12-15 20:45:42,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-15 20:45:42,520 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:45:42,521 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:45:42,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-15 20:45:42,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:45:42,726 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:45:42,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:45:42,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1615878890, now seen corresponding path program 1 times [2023-12-15 20:45:42,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:45:42,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280100529] [2023-12-15 20:45:42,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:45:42,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:45:42,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:43,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:45:43,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:43,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:45:43,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:43,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:45:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:43,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:45:43,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:43,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:45:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:43,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:45:43,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:43,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:45:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:43,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:45:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:43,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:45:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:43,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:45:43,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:43,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:45:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:43,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:45:43,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:43,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:45:43,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:43,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:45:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:43,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:45:43,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:43,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:45:43,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:43,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:45:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:43,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 20:45:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:43,483 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 102 proven. 33 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2023-12-15 20:45:43,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:45:43,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280100529] [2023-12-15 20:45:43,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280100529] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 20:45:43,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57712332] [2023-12-15 20:45:43,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:45:43,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:45:43,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:45:43,501 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 20:45:43,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-15 20:45:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:45:43,583 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-15 20:45:43,589 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:45:44,127 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 348 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-12-15 20:45:44,127 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 20:45:45,062 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2023-12-15 20:45:45,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57712332] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 20:45:45,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 20:45:45,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 30 [2023-12-15 20:45:45,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108343886] [2023-12-15 20:45:45,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 20:45:45,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-15 20:45:45,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:45:45,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-15 20:45:45,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=640, Unknown=0, NotChecked=0, Total=870 [2023-12-15 20:45:45,065 INFO L87 Difference]: Start difference. First operand 207 states and 262 transitions. Second operand has 30 states, 30 states have (on average 2.8666666666666667) internal successors, (86), 30 states have internal predecessors, (86), 4 states have call successors, (27), 3 states have call predecessors, (27), 7 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2023-12-15 20:45:46,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:45:46,128 INFO L93 Difference]: Finished difference Result 353 states and 447 transitions. [2023-12-15 20:45:46,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-15 20:45:46,130 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.8666666666666667) internal successors, (86), 30 states have internal predecessors, (86), 4 states have call successors, (27), 3 states have call predecessors, (27), 7 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 119 [2023-12-15 20:45:46,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:45:46,131 INFO L225 Difference]: With dead ends: 353 [2023-12-15 20:45:46,131 INFO L226 Difference]: Without dead ends: 251 [2023-12-15 20:45:46,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 256 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=650, Invalid=1900, Unknown=0, NotChecked=0, Total=2550 [2023-12-15 20:45:46,133 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 190 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-15 20:45:46,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 357 Invalid, 1220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-15 20:45:46,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2023-12-15 20:45:46,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 225. [2023-12-15 20:45:46,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 157 states have (on average 1.1146496815286624) internal successors, (175), 159 states have internal predecessors, (175), 53 states have call successors, (53), 14 states have call predecessors, (53), 14 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2023-12-15 20:45:46,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 281 transitions. [2023-12-15 20:45:46,158 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 281 transitions. Word has length 119 [2023-12-15 20:45:46,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:45:46,159 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 281 transitions. [2023-12-15 20:45:46,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.8666666666666667) internal successors, (86), 30 states have internal predecessors, (86), 4 states have call successors, (27), 3 states have call predecessors, (27), 7 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2023-12-15 20:45:46,159 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 281 transitions. [2023-12-15 20:45:46,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-15 20:45:46,160 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:45:46,160 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:45:46,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-15 20:45:46,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:45:46,366 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:45:46,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:45:46,367 INFO L85 PathProgramCache]: Analyzing trace with hash 7820483, now seen corresponding path program 1 times [2023-12-15 20:45:46,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:45:46,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244979714] [2023-12-15 20:45:46,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:45:46,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:45:46,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 20:45:46,389 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 20:45:46,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 20:45:46,436 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 20:45:46,436 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 20:45:46,437 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 20:45:46,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-15 20:45:46,440 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:45:46,443 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 20:45:46,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 08:45:46 BoogieIcfgContainer [2023-12-15 20:45:46,519 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 20:45:46,520 INFO L158 Benchmark]: Toolchain (without parser) took 14112.35ms. Allocated memory was 205.5MB in the beginning and 508.6MB in the end (delta: 303.0MB). Free memory was 160.3MB in the beginning and 304.7MB in the end (delta: -144.4MB). Peak memory consumption was 159.7MB. Max. memory is 8.0GB. [2023-12-15 20:45:46,520 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 205.5MB. Free memory is still 163.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 20:45:46,520 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.06ms. Allocated memory is still 205.5MB. Free memory was 160.3MB in the beginning and 147.6MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-15 20:45:46,520 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.12ms. Allocated memory is still 205.5MB. Free memory was 147.6MB in the beginning and 145.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 20:45:46,520 INFO L158 Benchmark]: Boogie Preprocessor took 51.56ms. Allocated memory is still 205.5MB. Free memory was 145.1MB in the beginning and 142.5MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 20:45:46,521 INFO L158 Benchmark]: RCFGBuilder took 303.57ms. Allocated memory is still 205.5MB. Free memory was 142.5MB in the beginning and 124.2MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-15 20:45:46,521 INFO L158 Benchmark]: TraceAbstraction took 13501.46ms. Allocated memory was 205.5MB in the beginning and 508.6MB in the end (delta: 303.0MB). Free memory was 123.6MB in the beginning and 304.7MB in the end (delta: -181.1MB). Peak memory consumption was 123.0MB. Max. memory is 8.0GB. [2023-12-15 20:45:46,523 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.10ms. Allocated memory is still 205.5MB. Free memory is still 163.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 209.06ms. Allocated memory is still 205.5MB. Free memory was 160.3MB in the beginning and 147.6MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.12ms. Allocated memory is still 205.5MB. Free memory was 147.6MB in the beginning and 145.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.56ms. Allocated memory is still 205.5MB. Free memory was 145.1MB in the beginning and 142.5MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 303.57ms. Allocated memory is still 205.5MB. Free memory was 142.5MB in the beginning and 124.2MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 13501.46ms. Allocated memory was 205.5MB in the beginning and 508.6MB in the end (delta: 303.0MB). Free memory was 123.6MB in the beginning and 304.7MB in the end (delta: -181.1MB). Peak memory consumption was 123.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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of bitwiseOr at line 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed short int var_1_7 = 32; [L24] signed short int var_1_8 = 20113; [L25] signed short int var_1_9 = 100; [L26] signed char var_1_10 = 100; [L27] signed char var_1_11 = -1; [L28] signed char var_1_12 = 16; [L29] unsigned char var_1_13 = 1; [L30] unsigned char var_1_15 = 0; [L31] unsigned char var_1_16 = 1; [L32] unsigned short int var_1_18 = 10; [L33] unsigned short int var_1_19 = 256; [L34] signed long int var_1_20 = 32; [L35] signed long int var_1_21 = 127; [L36] signed short int var_1_22 = 128; [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] FCALL updateLastVariables() [L109] CALL updateVariables() [L70] var_1_7 = __VERIFIER_nondet_short() [L71] CALL assume_abort_if_not(var_1_7 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=20113, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=20113, var_1_9=100] [L71] RET assume_abort_if_not(var_1_7 >= -1) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=20113, var_1_9=100] [L72] CALL assume_abort_if_not(var_1_7 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=20113, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=20113, var_1_9=100] [L72] RET assume_abort_if_not(var_1_7 <= 32766) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=20113, var_1_9=100] [L73] var_1_8 = __VERIFIER_nondet_short() [L74] CALL assume_abort_if_not(var_1_8 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=100] [L74] RET assume_abort_if_not(var_1_8 >= 16383) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=100] [L75] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=100] [L75] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=100] [L76] var_1_9 = __VERIFIER_nondet_short() [L77] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L77] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L78] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L78] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L79] var_1_11 = __VERIFIER_nondet_char() [L80] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L80] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L81] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L81] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L82] var_1_12 = __VERIFIER_nondet_char() [L83] CALL assume_abort_if_not(var_1_12 >= -31) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-2, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-2, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L83] RET assume_abort_if_not(var_1_12 >= -31) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-2, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L84] CALL assume_abort_if_not(var_1_12 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-2, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-2, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L84] RET assume_abort_if_not(var_1_12 <= 32) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-2, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L85] var_1_15 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-2, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-2, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L86] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-2, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L87] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-2, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-2, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L87] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-2, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L88] var_1_16 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-2, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-2, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L89] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-2, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L90] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-2, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-2, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L90] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-2, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L91] var_1_19 = __VERIFIER_nondet_ushort() [L92] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-2, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-2, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L92] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-2, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L93] CALL assume_abort_if_not(var_1_19 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-2, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=0, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-2, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=0, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L93] RET assume_abort_if_not(var_1_19 <= 65534) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-2, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=0, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L94] var_1_21 = __VERIFIER_nondet_long() [L95] CALL assume_abort_if_not(var_1_21 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-2, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=0, var_1_1=16, var_1_20=32, var_1_21=0, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-2, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=0, var_1_1=16, var_1_20=32, var_1_21=0, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L95] RET assume_abort_if_not(var_1_21 >= -2147483648) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-2, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=0, var_1_1=16, var_1_20=32, var_1_21=0, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L96] CALL assume_abort_if_not(var_1_21 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-2, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=0, var_1_1=16, var_1_20=32, var_1_21=0, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-2, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=0, var_1_1=16, var_1_20=32, var_1_21=0, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L96] RET assume_abort_if_not(var_1_21 <= 2147483647) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-2, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=0, var_1_1=16, var_1_20=32, var_1_21=0, var_1_22=128, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L109] RET updateVariables() [L110] CALL step() [L40] var_1_18 = var_1_19 [L41] var_1_20 = var_1_21 [L42] var_1_22 = var_1_12 VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-2, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-2, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L43] COND FALSE !(127.5f > var_1_20) [L46] var_1_13 = ((var_1_20 >= var_1_20) || var_1_15) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-2, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-2, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L48] COND FALSE !(var_1_18 == var_1_7) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-2, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-2, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L51] EXPR (32 * -25) | var_1_22 VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-2, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-2, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L51] COND FALSE !(((32 * -25) | var_1_22) >= var_1_11) [L57] COND TRUE \read(var_1_13) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-2, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-2, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L58] COND TRUE var_1_10 > var_1_22 VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-2, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-2, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L59] COND TRUE \read(var_1_13) [L60] var_1_1 = (var_1_7 - (var_1_8 - var_1_9)) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-2, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=16383, var_1_20=0, var_1_21=0, var_1_22=-2, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR (var_1_13 ? ((var_1_10 > var_1_22) ? (var_1_13 ? (var_1_1 == ((signed short int) (var_1_7 - (var_1_8 - var_1_9)))) : (var_1_1 == ((signed short int) var_1_18))) : (var_1_1 == ((signed short int) 8))) : 1) && ((var_1_18 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : ((((32 * -25) | var_1_22) >= var_1_11) ? (var_1_13 ? (var_1_10 == ((signed char) var_1_12)) : 1) : 1)) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-2, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=16383, var_1_20=0, var_1_21=0, var_1_22=-2, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L101] EXPR (var_1_18 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : ((((32 * -25) | var_1_22) >= var_1_11) ? (var_1_13 ? (var_1_10 == ((signed char) var_1_12)) : 1) : 1) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-2, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=16383, var_1_20=0, var_1_21=0, var_1_22=-2, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L101] EXPR (32 * -25) | var_1_22 VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-2, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=16383, var_1_20=0, var_1_21=0, var_1_22=-2, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L101] EXPR (var_1_18 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : ((((32 * -25) | var_1_22) >= var_1_11) ? (var_1_13 ? (var_1_10 == ((signed char) var_1_12)) : 1) : 1) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-2, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=16383, var_1_20=0, var_1_21=0, var_1_22=-2, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L101] EXPR (var_1_13 ? ((var_1_10 > var_1_22) ? (var_1_13 ? (var_1_1 == ((signed short int) (var_1_7 - (var_1_8 - var_1_9)))) : (var_1_1 == ((signed short int) var_1_18))) : (var_1_1 == ((signed short int) 8))) : 1) && ((var_1_18 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : ((((32 * -25) | var_1_22) >= var_1_11) ? (var_1_13 ? (var_1_10 == ((signed char) var_1_12)) : 1) : 1)) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-2, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=16383, var_1_20=0, var_1_21=0, var_1_22=-2, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L101-L102] return (((((var_1_13 ? ((var_1_10 > var_1_22) ? (var_1_13 ? (var_1_1 == ((signed short int) (var_1_7 - (var_1_8 - var_1_9)))) : (var_1_1 == ((signed short int) var_1_18))) : (var_1_1 == ((signed short int) 8))) : 1) && ((var_1_18 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : ((((32 * -25) | var_1_22) >= var_1_11) ? (var_1_13 ? (var_1_10 == ((signed char) var_1_12)) : 1) : 1))) && ((127.5f > var_1_20) ? (var_1_13 == ((unsigned char) (var_1_15 && var_1_16))) : (var_1_13 == ((unsigned char) ((var_1_20 >= var_1_20) || var_1_15))))) && (var_1_18 == ((unsigned short int) var_1_19))) && (var_1_20 == ((signed long int) var_1_21))) && (var_1_22 == ((signed short int) var_1_12)) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-2, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=16383, var_1_20=0, var_1_21=0, var_1_22=-2, var_1_7=32766, var_1_8=32766, var_1_9=16383] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-2, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=16383, var_1_20=0, var_1_21=0, var_1_22=-2, var_1_7=32766, var_1_8=32766, var_1_9=16383] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.4s, OverallIterations: 13, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1440 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1348 mSDsluCounter, 3349 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2245 mSDsCounter, 542 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4012 IncrementalHoareTripleChecker+Invalid, 4554 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 542 mSolverCounterUnsat, 1104 mSDtfsCounter, 4012 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1528 GetRequests, 1330 SyntacticMatches, 13 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1885 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=225occurred in iteration=12, InterpolantAutomatonStates: 148, 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, 12 MinimizatonAttempts, 720 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 1939 NumberOfCodeBlocks, 1939 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2260 ConstructedInterpolants, 0 QuantifiedInterpolants, 10342 SizeOfPredicates, 53 NumberOfNonLiveVariables, 1087 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 20 InterpolantComputations, 8 PerfectInterpolantSequences, 11859/12240 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: unable to determine feasibility of some traces [2023-12-15 20:45:46,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...