/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-97.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 03:37:02,901 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 03:37:02,993 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-16 03:37:02,997 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 03:37:02,998 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 03:37:03,026 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 03:37:03,027 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 03:37:03,027 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 03:37:03,028 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 03:37:03,031 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 03:37:03,032 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 03:37:03,032 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 03:37:03,033 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 03:37:03,034 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 03:37:03,034 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 03:37:03,034 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 03:37:03,034 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 03:37:03,035 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 03:37:03,035 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 03:37:03,036 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 03:37:03,036 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 03:37:03,037 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 03:37:03,037 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 03:37:03,037 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 03:37:03,037 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 03:37:03,037 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 03:37:03,038 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 03:37:03,038 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 03:37:03,038 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 03:37:03,039 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 03:37:03,039 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 03:37:03,040 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 03:37:03,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 03:37:03,040 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 03:37:03,040 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 03:37:03,040 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 03:37:03,041 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 03:37:03,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 03:37:03,041 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 03:37:03,041 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 03:37:03,041 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 03:37:03,042 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 03:37:03,042 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 03:37:03,042 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-16 03:37:03,273 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 03:37:03,297 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 03:37:03,299 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 03:37:03,300 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 03:37:03,300 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 03:37:03,301 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-16 03:37:04,444 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 03:37:04,642 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 03:37:04,642 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-97.i [2023-12-16 03:37:04,652 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cfdafe2e/6843b0e0bd7c49319b65ee52c375a743/FLAG4b3dff5a2 [2023-12-16 03:37:04,665 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cfdafe2e/6843b0e0bd7c49319b65ee52c375a743 [2023-12-16 03:37:04,667 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 03:37:04,668 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 03:37:04,669 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 03:37:04,669 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 03:37:04,673 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 03:37:04,674 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:37:04" (1/1) ... [2023-12-16 03:37:04,675 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68ce81bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:37:04, skipping insertion in model container [2023-12-16 03:37:04,675 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:37:04" (1/1) ... [2023-12-16 03:37:04,708 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 03:37:04,846 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-16 03:37:04,882 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 03:37:04,897 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 03:37:04,906 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-16 03:37:04,923 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 03:37:04,938 INFO L206 MainTranslator]: Completed translation [2023-12-16 03:37:04,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:37:04 WrapperNode [2023-12-16 03:37:04,938 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 03:37:04,941 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 03:37:04,941 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 03:37:04,942 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 03:37:04,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:37:04" (1/1) ... [2023-12-16 03:37:04,956 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:37:04" (1/1) ... [2023-12-16 03:37:04,986 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 133 [2023-12-16 03:37:04,988 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 03:37:04,989 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 03:37:04,989 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 03:37:04,989 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 03:37:04,998 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:37:04" (1/1) ... [2023-12-16 03:37:04,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:37:04" (1/1) ... [2023-12-16 03:37:05,001 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:37:04" (1/1) ... [2023-12-16 03:37:05,027 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-16 03:37:05,027 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:37:04" (1/1) ... [2023-12-16 03:37:05,028 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:37:04" (1/1) ... [2023-12-16 03:37:05,033 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:37:04" (1/1) ... [2023-12-16 03:37:05,035 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:37:04" (1/1) ... [2023-12-16 03:37:05,048 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:37:04" (1/1) ... [2023-12-16 03:37:05,049 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:37:04" (1/1) ... [2023-12-16 03:37:05,051 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 03:37:05,052 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 03:37:05,052 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 03:37:05,052 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 03:37:05,053 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:37:04" (1/1) ... [2023-12-16 03:37:05,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 03:37:05,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 03:37:05,085 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 03:37:05,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 03:37:05,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 03:37:05,123 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 03:37:05,123 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 03:37:05,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 03:37:05,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 03:37:05,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 03:37:05,206 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 03:37:05,207 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 03:37:05,424 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 03:37:05,451 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 03:37:05,451 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 03:37:05,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:37:05 BoogieIcfgContainer [2023-12-16 03:37:05,452 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 03:37:05,454 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 03:37:05,454 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 03:37:05,457 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 03:37:05,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 03:37:04" (1/3) ... [2023-12-16 03:37:05,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5827be43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:37:05, skipping insertion in model container [2023-12-16 03:37:05,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:37:04" (2/3) ... [2023-12-16 03:37:05,458 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5827be43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:37:05, skipping insertion in model container [2023-12-16 03:37:05,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:37:05" (3/3) ... [2023-12-16 03:37:05,459 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-97.i [2023-12-16 03:37:05,474 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 03:37:05,475 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 03:37:05,521 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 03:37:05,532 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;@122e97e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 03:37:05,533 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 03:37:05,537 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 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-16 03:37:05,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-16 03:37:05,555 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:37:05,556 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-16 03:37:05,557 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:37:05,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:37:05,562 INFO L85 PathProgramCache]: Analyzing trace with hash 656702987, now seen corresponding path program 1 times [2023-12-16 03:37:05,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:37:05,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21809803] [2023-12-16 03:37:05,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:37:05,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:37:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:05,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:37:05,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:05,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:37:05,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:05,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:37:05,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:05,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:37:05,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:05,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:37:05,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:05,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:37:05,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:05,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:37:05,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:05,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:37:05,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:05,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:37:05,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:05,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:37:05,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:05,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:37:05,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:05,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:37:05,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:05,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:37:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:05,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:37:05,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:05,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:37:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:05,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:37:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:05,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 03:37:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:05,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 03:37:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:05,915 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-16 03:37:05,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:37:05,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21809803] [2023-12-16 03:37:05,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21809803] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:37:05,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:37:05,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 03:37:05,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986622249] [2023-12-16 03:37:05,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:37:05,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 03:37:05,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:37:05,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 03:37:05,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 03:37:05,962 INFO L87 Difference]: Start difference. First operand has 51 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 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-16 03:37:06,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:37:06,007 INFO L93 Difference]: Finished difference Result 99 states and 176 transitions. [2023-12-16 03:37:06,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 03:37:06,011 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-16 03:37:06,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:37:06,019 INFO L225 Difference]: With dead ends: 99 [2023-12-16 03:37:06,019 INFO L226 Difference]: Without dead ends: 49 [2023-12-16 03:37:06,023 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-16 03:37:06,026 INFO L413 NwaCegarLoop]: 72 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, 72 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-16 03:37:06,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:37:06,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-16 03:37:06,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-12-16 03:37:06,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 29 states have internal predecessors, (39), 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-16 03:37:06,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 75 transitions. [2023-12-16 03:37:06,060 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 75 transitions. Word has length 109 [2023-12-16 03:37:06,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:37:06,060 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 75 transitions. [2023-12-16 03:37:06,061 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-16 03:37:06,061 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 75 transitions. [2023-12-16 03:37:06,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-16 03:37:06,063 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:37:06,064 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-16 03:37:06,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 03:37:06,064 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:37:06,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:37:06,065 INFO L85 PathProgramCache]: Analyzing trace with hash 282748107, now seen corresponding path program 1 times [2023-12-16 03:37:06,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:37:06,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033549631] [2023-12-16 03:37:06,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:37:06,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:37:06,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:06,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:37:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:06,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:37:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:06,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:37:06,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:06,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:37:06,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:06,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:37:06,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:06,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:37:06,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:06,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:37:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:06,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:37:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:06,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:37:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:06,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:37:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:06,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:37:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:06,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:37:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:06,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:37:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:06,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:37:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:06,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:37:06,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:06,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:37:06,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:06,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 03:37:06,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:06,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 03:37:06,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:06,568 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-16 03:37:06,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:37:06,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033549631] [2023-12-16 03:37:06,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033549631] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:37:06,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:37:06,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 03:37:06,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444669830] [2023-12-16 03:37:06,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:37:06,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 03:37:06,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:37:06,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 03:37:06,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 03:37:06,580 INFO L87 Difference]: Start difference. First operand 49 states and 75 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-16 03:37:06,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:37:06,739 INFO L93 Difference]: Finished difference Result 140 states and 213 transitions. [2023-12-16 03:37:06,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 03:37:06,740 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-16 03:37:06,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:37:06,742 INFO L225 Difference]: With dead ends: 140 [2023-12-16 03:37:06,742 INFO L226 Difference]: Without dead ends: 92 [2023-12-16 03:37:06,743 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-16 03:37:06,744 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 64 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 422 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-16 03:37:06,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 422 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 03:37:06,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-12-16 03:37:06,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 52. [2023-12-16 03:37:06,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 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-16 03:37:06,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 78 transitions. [2023-12-16 03:37:06,756 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 78 transitions. Word has length 109 [2023-12-16 03:37:06,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:37:06,758 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 78 transitions. [2023-12-16 03:37:06,758 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-16 03:37:06,758 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 78 transitions. [2023-12-16 03:37:06,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-16 03:37:06,760 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:37:06,760 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-16 03:37:06,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 03:37:06,761 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:37:06,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:37:06,761 INFO L85 PathProgramCache]: Analyzing trace with hash 478796629, now seen corresponding path program 1 times [2023-12-16 03:37:06,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:37:06,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578084430] [2023-12-16 03:37:06,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:37:06,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:37:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:07,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:37:07,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:07,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:37:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:07,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:37:07,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:07,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:37:07,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:07,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:37:07,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:07,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:37:07,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:07,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:37:07,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:07,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:37:07,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:07,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:37:07,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:07,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:37:07,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:07,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:37:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:07,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:37:07,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:07,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:37:07,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:07,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:37:07,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:07,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:37:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:07,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:37:07,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:07,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 03:37:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:07,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 03:37:07,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:07,142 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-16 03:37:07,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:37:07,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578084430] [2023-12-16 03:37:07,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578084430] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:37:07,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:37:07,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 03:37:07,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515309103] [2023-12-16 03:37:07,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:37:07,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 03:37:07,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:37:07,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 03:37:07,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 03:37:07,149 INFO L87 Difference]: Start difference. First operand 52 states and 78 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-16 03:37:07,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:37:07,437 INFO L93 Difference]: Finished difference Result 188 states and 282 transitions. [2023-12-16 03:37:07,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 03:37:07,437 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-16 03:37:07,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:37:07,439 INFO L225 Difference]: With dead ends: 188 [2023-12-16 03:37:07,439 INFO L226 Difference]: Without dead ends: 137 [2023-12-16 03:37:07,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-16 03:37:07,441 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 127 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 03:37:07,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 432 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 03:37:07,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-12-16 03:37:07,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 56. [2023-12-16 03:37:07,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 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-16 03:37:07,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 83 transitions. [2023-12-16 03:37:07,465 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 83 transitions. Word has length 110 [2023-12-16 03:37:07,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:37:07,466 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 83 transitions. [2023-12-16 03:37:07,466 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-16 03:37:07,466 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 83 transitions. [2023-12-16 03:37:07,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-16 03:37:07,472 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:37:07,472 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-16 03:37:07,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 03:37:07,473 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:37:07,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:37:07,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1146724746, now seen corresponding path program 1 times [2023-12-16 03:37:07,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:37:07,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88265278] [2023-12-16 03:37:07,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:37:07,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:37:07,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:07,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:37:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:07,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:37:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:07,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:37:07,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:07,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:37:07,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:07,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:37:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:07,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:37:07,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:07,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:37:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:07,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:37:07,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:07,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:37:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:07,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:37:07,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:07,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:37:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:07,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:37:07,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:07,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:37:07,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:07,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:37:07,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:07,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:37:07,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:07,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:37:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:07,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 03:37:07,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:07,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 03:37:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:07,814 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-16 03:37:07,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:37:07,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88265278] [2023-12-16 03:37:07,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88265278] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:37:07,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:37:07,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 03:37:07,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972322234] [2023-12-16 03:37:07,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:37:07,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 03:37:07,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:37:07,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 03:37:07,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-16 03:37:07,817 INFO L87 Difference]: Start difference. First operand 56 states and 83 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-16 03:37:08,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:37:08,151 INFO L93 Difference]: Finished difference Result 192 states and 283 transitions. [2023-12-16 03:37:08,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 03:37:08,151 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-16 03:37:08,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:37:08,159 INFO L225 Difference]: With dead ends: 192 [2023-12-16 03:37:08,159 INFO L226 Difference]: Without dead ends: 137 [2023-12-16 03:37:08,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-16 03:37:08,164 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 135 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 03:37:08,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 457 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 03:37:08,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-12-16 03:37:08,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 54. [2023-12-16 03:37:08,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 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-16 03:37:08,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 80 transitions. [2023-12-16 03:37:08,174 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 80 transitions. Word has length 111 [2023-12-16 03:37:08,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:37:08,175 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 80 transitions. [2023-12-16 03:37:08,175 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-16 03:37:08,175 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 80 transitions. [2023-12-16 03:37:08,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-16 03:37:08,176 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:37:08,176 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-16 03:37:08,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 03:37:08,177 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:37:08,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:37:08,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1201116946, now seen corresponding path program 1 times [2023-12-16 03:37:08,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:37:08,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636322840] [2023-12-16 03:37:08,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:37:08,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:37:08,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:08,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:37:08,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:08,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:37:08,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:08,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:37:08,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:08,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:37:08,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:08,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:37:08,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:08,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:37:08,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:08,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:37:08,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:08,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:37:08,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:08,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:37:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:08,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:37:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:08,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:37:08,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:08,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:37:08,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:08,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:37:08,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:08,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:37:08,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:08,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:37:08,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:08,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:37:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:08,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 03:37:08,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:08,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 03:37:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:08,648 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-16 03:37:08,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:37:08,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636322840] [2023-12-16 03:37:08,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636322840] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 03:37:08,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140031151] [2023-12-16 03:37:08,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:37:08,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 03:37:08,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 03:37:08,656 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 03:37:08,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-16 03:37:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:08,763 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-16 03:37:08,774 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 03:37:09,095 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-16 03:37:09,095 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 03:37:09,423 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-16 03:37:09,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140031151] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 03:37:09,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 03:37:09,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2023-12-16 03:37:09,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525539590] [2023-12-16 03:37:09,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 03:37:09,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-16 03:37:09,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:37:09,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-16 03:37:09,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-12-16 03:37:09,426 INFO L87 Difference]: Start difference. First operand 54 states and 80 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-16 03:37:09,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:37:09,837 INFO L93 Difference]: Finished difference Result 137 states and 199 transitions. [2023-12-16 03:37:09,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 03:37:09,837 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-16 03:37:09,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:37:09,838 INFO L225 Difference]: With dead ends: 137 [2023-12-16 03:37:09,838 INFO L226 Difference]: Without dead ends: 84 [2023-12-16 03:37:09,839 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-16 03:37:09,841 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 82 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 03:37:09,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 141 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 03:37:09,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-12-16 03:37:09,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 72. [2023-12-16 03:37:09,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 40 states have (on average 1.15) internal successors, (46), 41 states have internal predecessors, (46), 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-16 03:37:09,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 102 transitions. [2023-12-16 03:37:09,881 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 102 transitions. Word has length 111 [2023-12-16 03:37:09,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:37:09,882 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 102 transitions. [2023-12-16 03:37:09,883 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-16 03:37:09,883 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 102 transitions. [2023-12-16 03:37:09,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-16 03:37:09,885 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:37:09,885 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-16 03:37:09,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-16 03:37:10,089 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-16 03:37:10,090 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:37:10,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:37:10,090 INFO L85 PathProgramCache]: Analyzing trace with hash 232158554, now seen corresponding path program 1 times [2023-12-16 03:37:10,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:37:10,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888420939] [2023-12-16 03:37:10,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:37:10,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:37:10,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:11,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:37:11,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:11,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:37:11,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:11,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:37:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:11,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:37:11,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:11,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:37:11,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:11,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:37:11,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:11,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:37:11,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:11,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:37:11,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:11,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:37:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:11,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:37:11,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:11,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:37:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:11,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:37:11,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:11,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:37:11,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:11,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:37:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:11,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:37:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:11,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:37:11,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:11,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 03:37:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:11,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 03:37:11,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:11,514 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-16 03:37:11,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:37:11,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888420939] [2023-12-16 03:37:11,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888420939] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 03:37:11,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656790371] [2023-12-16 03:37:11,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:37:11,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 03:37:11,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 03:37:11,516 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 03:37:11,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-16 03:37:11,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:11,600 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 39 conjunts are in the unsatisfiable core [2023-12-16 03:37:11,612 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 03:37:12,568 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-16 03:37:12,568 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 03:37:13,594 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-16 03:37:13,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656790371] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 03:37:13,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 03:37:13,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 15] total 37 [2023-12-16 03:37:13,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936022245] [2023-12-16 03:37:13,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 03:37:13,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-12-16 03:37:13,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:37:13,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-12-16 03:37:13,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=1047, Unknown=0, NotChecked=0, Total=1332 [2023-12-16 03:37:13,598 INFO L87 Difference]: Start difference. First operand 72 states and 102 transitions. Second operand has 37 states, 37 states have (on average 2.1621621621621623) internal successors, (80), 37 states have internal predecessors, (80), 8 states have call successors, (43), 4 states have call predecessors, (43), 9 states have return successors, (44), 8 states have call predecessors, (44), 8 states have call successors, (44) [2023-12-16 03:37:15,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:37:15,135 INFO L93 Difference]: Finished difference Result 122 states and 159 transitions. [2023-12-16 03:37:15,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-16 03:37:15,137 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.1621621621621623) internal successors, (80), 37 states have internal predecessors, (80), 8 states have call successors, (43), 4 states have call predecessors, (43), 9 states have return successors, (44), 8 states have call predecessors, (44), 8 states have call successors, (44) Word has length 112 [2023-12-16 03:37:15,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:37:15,139 INFO L225 Difference]: With dead ends: 122 [2023-12-16 03:37:15,139 INFO L226 Difference]: Without dead ends: 120 [2023-12-16 03:37:15,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 239 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=930, Invalid=3102, Unknown=0, NotChecked=0, Total=4032 [2023-12-16 03:37:15,144 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 373 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-16 03:37:15,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 267 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-16 03:37:15,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-12-16 03:37:15,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 106. [2023-12-16 03:37:15,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 67 states have internal predecessors, (74), 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-16 03:37:15,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 142 transitions. [2023-12-16 03:37:15,174 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 142 transitions. Word has length 112 [2023-12-16 03:37:15,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:37:15,174 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 142 transitions. [2023-12-16 03:37:15,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.1621621621621623) internal successors, (80), 37 states have internal predecessors, (80), 8 states have call successors, (43), 4 states have call predecessors, (43), 9 states have return successors, (44), 8 states have call predecessors, (44), 8 states have call successors, (44) [2023-12-16 03:37:15,175 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 142 transitions. [2023-12-16 03:37:15,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-16 03:37:15,176 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:37:15,177 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-16 03:37:15,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-16 03:37:15,382 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-16 03:37:15,382 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:37:15,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:37:15,383 INFO L85 PathProgramCache]: Analyzing trace with hash 234005596, now seen corresponding path program 1 times [2023-12-16 03:37:15,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:37:15,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278111622] [2023-12-16 03:37:15,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:37:15,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:37:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:37:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:37:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:37:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:37:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:37:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:37:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:37:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:37:15,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:37:15,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:37:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:37:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:37:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:37:15,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:37:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:37:15,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:37:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 03:37:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 03:37:15,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,460 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-16 03:37:15,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:37:15,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278111622] [2023-12-16 03:37:15,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278111622] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:37:15,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:37:15,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 03:37:15,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114475478] [2023-12-16 03:37:15,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:37:15,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 03:37:15,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:37:15,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 03:37:15,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 03:37:15,462 INFO L87 Difference]: Start difference. First operand 106 states and 142 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-16 03:37:15,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:37:15,497 INFO L93 Difference]: Finished difference Result 200 states and 261 transitions. [2023-12-16 03:37:15,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 03:37:15,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 112 [2023-12-16 03:37:15,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:37:15,500 INFO L225 Difference]: With dead ends: 200 [2023-12-16 03:37:15,500 INFO L226 Difference]: Without dead ends: 110 [2023-12-16 03:37:15,501 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-16 03:37:15,502 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 9 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 124 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-16 03:37:15,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 124 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:37:15,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-12-16 03:37:15,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 103. [2023-12-16 03:37:15,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 64 states have internal predecessors, (69), 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-16 03:37:15,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 137 transitions. [2023-12-16 03:37:15,542 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 137 transitions. Word has length 112 [2023-12-16 03:37:15,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:37:15,542 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 137 transitions. [2023-12-16 03:37:15,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-16 03:37:15,542 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 137 transitions. [2023-12-16 03:37:15,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-16 03:37:15,544 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:37:15,544 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] [2023-12-16 03:37:15,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 03:37:15,544 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:37:15,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:37:15,545 INFO L85 PathProgramCache]: Analyzing trace with hash -82122599, now seen corresponding path program 1 times [2023-12-16 03:37:15,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:37:15,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57471515] [2023-12-16 03:37:15,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:37:15,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:37:15,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:37:15,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:37:15,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:37:15,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:37:15,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:37:15,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:37:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:37:15,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:37:15,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:37:15,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:37:15,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:37:15,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:37:15,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:37:15,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:37:15,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:37:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:37:15,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 03:37:15,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 03:37:15,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,612 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-16 03:37:15,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:37:15,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57471515] [2023-12-16 03:37:15,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57471515] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:37:15,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:37:15,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 03:37:15,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739985516] [2023-12-16 03:37:15,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:37:15,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 03:37:15,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:37:15,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 03:37:15,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 03:37:15,614 INFO L87 Difference]: Start difference. First operand 103 states and 137 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-16 03:37:15,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:37:15,656 INFO L93 Difference]: Finished difference Result 190 states and 248 transitions. [2023-12-16 03:37:15,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 03:37:15,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 113 [2023-12-16 03:37:15,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:37:15,658 INFO L225 Difference]: With dead ends: 190 [2023-12-16 03:37:15,658 INFO L226 Difference]: Without dead ends: 103 [2023-12-16 03:37:15,658 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-16 03:37:15,659 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 11 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 128 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-16 03:37:15,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 128 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:37:15,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-12-16 03:37:15,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2023-12-16 03:37:15,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 62 states have (on average 1.096774193548387) internal successors, (68), 64 states have internal predecessors, (68), 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-16 03:37:15,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 136 transitions. [2023-12-16 03:37:15,679 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 136 transitions. Word has length 113 [2023-12-16 03:37:15,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:37:15,679 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 136 transitions. [2023-12-16 03:37:15,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-16 03:37:15,680 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 136 transitions. [2023-12-16 03:37:15,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-16 03:37:15,680 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:37:15,681 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] [2023-12-16 03:37:15,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 03:37:15,681 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:37:15,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:37:15,681 INFO L85 PathProgramCache]: Analyzing trace with hash -80275557, now seen corresponding path program 1 times [2023-12-16 03:37:15,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:37:15,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353487058] [2023-12-16 03:37:15,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:37:15,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:37:15,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:37:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:37:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:37:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:37:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:37:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:37:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:37:15,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:37:15,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:37:15,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:37:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:37:15,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:37:15,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:37:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:37:15,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:37:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:37:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 03:37:15,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 03:37:15,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,868 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-16 03:37:15,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:37:15,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353487058] [2023-12-16 03:37:15,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353487058] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 03:37:15,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544594988] [2023-12-16 03:37:15,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:37:15,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 03:37:15,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 03:37:15,870 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 03:37:15,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-16 03:37:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:37:15,950 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 03:37:15,958 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 03:37:16,160 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-16 03:37:16,160 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 03:37:16,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-16 03:37:16,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544594988] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 03:37:16,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 03:37:16,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 17 [2023-12-16 03:37:16,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831771303] [2023-12-16 03:37:16,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 03:37:16,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-16 03:37:16,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:37:16,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-16 03:37:16,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2023-12-16 03:37:16,321 INFO L87 Difference]: Start difference. First operand 103 states and 136 transitions. Second operand has 17 states, 16 states have (on average 4.25) internal successors, (68), 17 states have internal predecessors, (68), 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-16 03:37:17,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:37:17,350 INFO L93 Difference]: Finished difference Result 466 states and 589 transitions. [2023-12-16 03:37:17,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-16 03:37:17,351 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.25) internal successors, (68), 17 states have internal predecessors, (68), 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 113 [2023-12-16 03:37:17,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:37:17,354 INFO L225 Difference]: With dead ends: 466 [2023-12-16 03:37:17,354 INFO L226 Difference]: Without dead ends: 379 [2023-12-16 03:37:17,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=370, Invalid=1036, Unknown=0, NotChecked=0, Total=1406 [2023-12-16 03:37:17,355 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 242 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-16 03:37:17,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 428 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 933 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-16 03:37:17,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2023-12-16 03:37:17,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 178. [2023-12-16 03:37:17,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 110 states have (on average 1.0909090909090908) internal successors, (120), 112 states have internal predecessors, (120), 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-16 03:37:17,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 226 transitions. [2023-12-16 03:37:17,398 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 226 transitions. Word has length 113 [2023-12-16 03:37:17,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:37:17,398 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 226 transitions. [2023-12-16 03:37:17,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.25) internal successors, (68), 17 states have internal predecessors, (68), 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-16 03:37:17,398 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 226 transitions. [2023-12-16 03:37:17,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-16 03:37:17,399 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:37:17,399 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-16 03:37:17,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-16 03:37:17,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 03:37:17,606 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:37:17,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:37:17,606 INFO L85 PathProgramCache]: Analyzing trace with hash 323278814, now seen corresponding path program 1 times [2023-12-16 03:37:17,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:37:17,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988623562] [2023-12-16 03:37:17,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:37:17,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:37:17,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 03:37:17,632 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 03:37:17,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 03:37:17,682 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 03:37:17,682 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 03:37:17,683 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 03:37:17,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 03:37:17,687 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:37:17,690 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 03:37:17,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 03:37:17 BoogieIcfgContainer [2023-12-16 03:37:17,757 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 03:37:17,758 INFO L158 Benchmark]: Toolchain (without parser) took 13090.18ms. Allocated memory was 257.9MB in the beginning and 448.8MB in the end (delta: 190.8MB). Free memory was 207.1MB in the beginning and 307.8MB in the end (delta: -100.7MB). Peak memory consumption was 90.7MB. Max. memory is 8.0GB. [2023-12-16 03:37:17,758 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 186.6MB. Free memory is still 132.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 03:37:17,758 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.83ms. Allocated memory is still 257.9MB. Free memory was 206.6MB in the beginning and 194.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 03:37:17,758 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.76ms. Allocated memory is still 257.9MB. Free memory was 194.0MB in the beginning and 191.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 03:37:17,759 INFO L158 Benchmark]: Boogie Preprocessor took 62.53ms. Allocated memory is still 257.9MB. Free memory was 191.9MB in the beginning and 189.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 03:37:17,759 INFO L158 Benchmark]: RCFGBuilder took 400.07ms. Allocated memory is still 257.9MB. Free memory was 189.3MB in the beginning and 171.4MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-16 03:37:17,759 INFO L158 Benchmark]: TraceAbstraction took 12303.65ms. Allocated memory was 257.9MB in the beginning and 448.8MB in the end (delta: 190.8MB). Free memory was 170.9MB in the beginning and 307.8MB in the end (delta: -136.8MB). Peak memory consumption was 55.1MB. Max. memory is 8.0GB. [2023-12-16 03:37:17,760 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.49ms. Allocated memory is still 186.6MB. Free memory is still 132.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 271.83ms. Allocated memory is still 257.9MB. Free memory was 206.6MB in the beginning and 194.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.76ms. Allocated memory is still 257.9MB. Free memory was 194.0MB in the beginning and 191.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 62.53ms. Allocated memory is still 257.9MB. Free memory was 191.9MB in the beginning and 189.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 400.07ms. Allocated memory is still 257.9MB. Free memory was 189.3MB in the beginning and 171.4MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 12303.65ms. Allocated memory was 257.9MB in the beginning and 448.8MB in the end (delta: 190.8MB). Free memory was 170.9MB in the beginning and 307.8MB in the end (delta: -136.8MB). Peak memory consumption was 55.1MB. 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 bitwise operation 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=-1, 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=-1, 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=-1, 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=-1, 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=-1, 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=-1, 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=-1, var_1_8=16383, 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=-1, var_1_8=16383, 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=-1, var_1_8=16383, 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=-1, var_1_8=16383, 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=-1, var_1_8=16383, 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=-1, var_1_8=16383, 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=-1, var_1_8=16383, var_1_9=0] [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=-1, var_1_8=16383, var_1_9=0] [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=-1, var_1_8=16383, var_1_9=0] [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=-1, var_1_8=16383, var_1_9=0] [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=-1, var_1_8=16383, var_1_9=0] [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=-1, var_1_8=16383, var_1_9=0] [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=63, 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=-1, var_1_8=16383, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=63, 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=-1, var_1_8=16383, var_1_9=0] [L80] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, var_1_10=100, var_1_11=63, 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=-1, var_1_8=16383, var_1_9=0] [L81] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=63, 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=-1, var_1_8=16383, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=63, 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=-1, var_1_8=16383, var_1_9=0] [L81] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, var_1_10=100, var_1_11=63, 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=-1, var_1_8=16383, var_1_9=0] [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=63, var_1_12=32, 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=-1, var_1_8=16383, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=63, var_1_12=32, 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=-1, var_1_8=16383, var_1_9=0] [L83] RET assume_abort_if_not(var_1_12 >= -31) VAL [isInitial=1, var_1_10=100, var_1_11=63, var_1_12=32, 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=-1, var_1_8=16383, var_1_9=0] [L84] CALL assume_abort_if_not(var_1_12 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=63, var_1_12=32, 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=-1, var_1_8=16383, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=63, var_1_12=32, 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=-1, var_1_8=16383, var_1_9=0] [L84] RET assume_abort_if_not(var_1_12 <= 32) VAL [isInitial=1, var_1_10=100, var_1_11=63, var_1_12=32, 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=-1, var_1_8=16383, var_1_9=0] [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=63, var_1_12=32, 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=-1, var_1_8=16383, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=63, var_1_12=32, 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=-1, var_1_8=16383, var_1_9=0] [L86] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=100, var_1_11=63, var_1_12=32, 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=-1, var_1_8=16383, var_1_9=0] [L87] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=63, var_1_12=32, 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=-1, var_1_8=16383, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=63, var_1_12=32, 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=-1, var_1_8=16383, var_1_9=0] [L87] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=100, var_1_11=63, var_1_12=32, 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=-1, var_1_8=16383, var_1_9=0] [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=63, var_1_12=32, 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=-1, var_1_8=16383, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=63, var_1_12=32, 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=-1, var_1_8=16383, var_1_9=0] [L89] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10=100, var_1_11=63, var_1_12=32, 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=-1, var_1_8=16383, var_1_9=0] [L90] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=63, var_1_12=32, 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=-1, var_1_8=16383, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=63, var_1_12=32, 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=-1, var_1_8=16383, var_1_9=0] [L90] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_10=100, var_1_11=63, var_1_12=32, 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=-1, var_1_8=16383, var_1_9=0] [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=63, var_1_12=32, 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=-1, var_1_8=16383, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=63, var_1_12=32, 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=-1, var_1_8=16383, var_1_9=0] [L92] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=100, var_1_11=63, var_1_12=32, 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=-1, var_1_8=16383, var_1_9=0] [L93] CALL assume_abort_if_not(var_1_19 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=63, var_1_12=32, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=65534, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=16383, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=63, var_1_12=32, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=65534, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=16383, var_1_9=0] [L93] RET assume_abort_if_not(var_1_19 <= 65534) VAL [isInitial=1, var_1_10=100, var_1_11=63, var_1_12=32, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=65534, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=16383, var_1_9=0] [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=63, var_1_12=32, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=65534, var_1_1=16, var_1_20=32, var_1_21=0, var_1_22=128, var_1_7=-1, var_1_8=16383, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=63, var_1_12=32, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=65534, var_1_1=16, var_1_20=32, var_1_21=0, var_1_22=128, var_1_7=-1, var_1_8=16383, var_1_9=0] [L95] RET assume_abort_if_not(var_1_21 >= -2147483648) VAL [isInitial=1, var_1_10=100, var_1_11=63, var_1_12=32, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=65534, var_1_1=16, var_1_20=32, var_1_21=0, var_1_22=128, var_1_7=-1, var_1_8=16383, var_1_9=0] [L96] CALL assume_abort_if_not(var_1_21 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=63, var_1_12=32, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=65534, var_1_1=16, var_1_20=32, var_1_21=0, var_1_22=128, var_1_7=-1, var_1_8=16383, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=63, var_1_12=32, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=65534, var_1_1=16, var_1_20=32, var_1_21=0, var_1_22=128, var_1_7=-1, var_1_8=16383, var_1_9=0] [L96] RET assume_abort_if_not(var_1_21 <= 2147483647) VAL [isInitial=1, var_1_10=100, var_1_11=63, var_1_12=32, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=65534, var_1_1=16, var_1_20=32, var_1_21=0, var_1_22=128, var_1_7=-1, var_1_8=16383, var_1_9=0] [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=63, var_1_12=32, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=32, var_1_7=-1, var_1_8=16383, var_1_9=0] [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=63, var_1_12=32, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=32, var_1_7=-1, var_1_8=16383, var_1_9=0] [L48] COND FALSE !(var_1_18 == var_1_7) [L51] EXPR (32 * -25) | var_1_22 VAL [isInitial=1, var_1_10=100, var_1_11=63, var_1_12=32, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=32, var_1_7=-1, var_1_8=16383, var_1_9=0] [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=63, var_1_12=32, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=32, var_1_7=-1, var_1_8=16383, var_1_9=0] [L58] COND TRUE var_1_10 > var_1_22 VAL [isInitial=1, var_1_10=100, var_1_11=63, var_1_12=32, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=32, var_1_7=-1, var_1_8=16383, var_1_9=0] [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=63, var_1_12=32, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=-16384, var_1_20=0, var_1_21=0, var_1_22=32, var_1_7=-1, var_1_8=16383, var_1_9=0] [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=63, var_1_12=32, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=-16384, var_1_20=0, var_1_21=0, var_1_22=32, var_1_7=-1, var_1_8=16383, var_1_9=0] [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) [L101] EXPR (32 * -25) | var_1_22 [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=63, var_1_12=32, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=-16384, var_1_20=0, var_1_21=0, var_1_22=32, var_1_7=-1, var_1_8=16383, var_1_9=0] [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=63, var_1_12=32, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=-16384, var_1_20=0, var_1_21=0, var_1_22=32, var_1_7=-1, var_1_8=16383, var_1_9=0] [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=63, var_1_12=32, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=-16384, var_1_20=0, var_1_21=0, var_1_22=32, var_1_7=-1, var_1_8=16383, var_1_9=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=100, var_1_11=63, var_1_12=32, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=-16384, var_1_20=0, var_1_21=0, var_1_22=32, var_1_7=-1, var_1_8=16383, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.2s, OverallIterations: 10, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1096 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1043 mSDsluCounter, 2471 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1658 mSDsCounter, 543 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2482 IncrementalHoareTripleChecker+Invalid, 3025 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 543 mSolverCounterUnsat, 813 mSDtfsCounter, 2482 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1140 GetRequests, 988 SyntacticMatches, 6 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1552 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178occurred in iteration=9, InterpolantAutomatonStates: 114, 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, 9 MinimizatonAttempts, 438 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 1450 NumberOfCodeBlocks, 1450 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1657 ConstructedInterpolants, 0 QuantifiedInterpolants, 6332 SizeOfPredicates, 30 NumberOfNonLiveVariables, 800 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 15 InterpolantComputations, 6 PerfectInterpolantSequences, 8901/9180 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-16 03:37:17,786 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...