/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-34.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 11:40:23,819 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 11:40:23,884 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-19 11:40:23,887 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 11:40:23,888 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 11:40:23,913 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 11:40:23,913 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 11:40:23,914 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 11:40:23,914 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 11:40:23,917 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 11:40:23,917 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 11:40:23,918 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 11:40:23,918 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 11:40:23,919 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 11:40:23,919 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 11:40:23,919 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 11:40:23,919 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 11:40:23,920 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 11:40:23,920 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 11:40:23,921 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 11:40:23,921 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 11:40:23,921 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 11:40:23,921 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 11:40:23,921 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 11:40:23,922 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 11:40:23,922 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 11:40:23,922 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 11:40:23,922 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 11:40:23,923 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 11:40:23,923 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 11:40:23,923 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 11:40:23,924 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 11:40:23,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 11:40:23,924 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 11:40:23,924 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 11:40:23,924 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 11:40:23,924 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 11:40:23,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 11:40:23,924 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 11:40:23,925 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 11:40:23,925 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 11:40:23,925 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 11:40:23,925 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 11:40:23,925 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-19 11:40:24,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 11:40:24,117 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 11:40:24,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 11:40:24,119 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 11:40:24,120 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 11:40:24,120 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-34.i [2023-12-19 11:40:25,085 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 11:40:25,218 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 11:40:25,219 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-34.i [2023-12-19 11:40:25,224 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb89b8546/6fdfc3588f0b4424b89c5804625e8ed4/FLAG1f1a8a5b8 [2023-12-19 11:40:25,234 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb89b8546/6fdfc3588f0b4424b89c5804625e8ed4 [2023-12-19 11:40:25,235 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 11:40:25,236 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 11:40:25,237 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 11:40:25,237 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 11:40:25,242 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 11:40:25,243 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 11:40:25" (1/1) ... [2023-12-19 11:40:25,243 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54984c2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:40:25, skipping insertion in model container [2023-12-19 11:40:25,243 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 11:40:25" (1/1) ... [2023-12-19 11:40:25,264 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 11:40:25,350 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_loopvsstraightlinecode_25-1loop_file-34.i[915,928] [2023-12-19 11:40:25,376 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 11:40:25,385 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 11:40:25,394 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_loopvsstraightlinecode_25-1loop_file-34.i[915,928] [2023-12-19 11:40:25,413 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 11:40:25,425 INFO L206 MainTranslator]: Completed translation [2023-12-19 11:40:25,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:40:25 WrapperNode [2023-12-19 11:40:25,425 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 11:40:25,426 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 11:40:25,426 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 11:40:25,426 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 11:40:25,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:40:25" (1/1) ... [2023-12-19 11:40:25,435 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:40:25" (1/1) ... [2023-12-19 11:40:25,453 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 93 [2023-12-19 11:40:25,453 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 11:40:25,453 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 11:40:25,453 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 11:40:25,454 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 11:40:25,460 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:40:25" (1/1) ... [2023-12-19 11:40:25,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:40:25" (1/1) ... [2023-12-19 11:40:25,462 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:40:25" (1/1) ... [2023-12-19 11:40:25,469 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-19 11:40:25,469 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:40:25" (1/1) ... [2023-12-19 11:40:25,469 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:40:25" (1/1) ... [2023-12-19 11:40:25,473 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:40:25" (1/1) ... [2023-12-19 11:40:25,475 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:40:25" (1/1) ... [2023-12-19 11:40:25,476 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:40:25" (1/1) ... [2023-12-19 11:40:25,477 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:40:25" (1/1) ... [2023-12-19 11:40:25,478 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 11:40:25,479 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 11:40:25,479 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 11:40:25,479 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 11:40:25,479 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:40:25" (1/1) ... [2023-12-19 11:40:25,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 11:40:25,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 11:40:25,555 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-19 11:40:25,575 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-19 11:40:25,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 11:40:25,580 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 11:40:25,580 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 11:40:25,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 11:40:25,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 11:40:25,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 11:40:25,633 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 11:40:25,635 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 11:40:25,785 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 11:40:25,814 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 11:40:25,814 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 11:40:25,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 11:40:25 BoogieIcfgContainer [2023-12-19 11:40:25,814 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 11:40:25,816 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 11:40:25,816 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 11:40:25,818 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 11:40:25,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 11:40:25" (1/3) ... [2023-12-19 11:40:25,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f6bde61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 11:40:25, skipping insertion in model container [2023-12-19 11:40:25,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:40:25" (2/3) ... [2023-12-19 11:40:25,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f6bde61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 11:40:25, skipping insertion in model container [2023-12-19 11:40:25,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 11:40:25" (3/3) ... [2023-12-19 11:40:25,819 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-34.i [2023-12-19 11:40:25,832 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 11:40:25,832 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 11:40:25,858 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 11:40:25,862 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;@4ad1490, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 11:40:25,862 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 11:40:25,867 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-19 11:40:25,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-19 11:40:25,873 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:40:25,873 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:40:25,873 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:40:25,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:40:25,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1387386125, now seen corresponding path program 1 times [2023-12-19 11:40:25,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:40:25,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331976095] [2023-12-19 11:40:25,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:40:25,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:40:25,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:26,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:40:26,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:26,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 11:40:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:26,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:40:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:26,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 11:40:26,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:26,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 11:40:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:26,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 11:40:26,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:26,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 11:40:26,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:26,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 11:40:26,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:26,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 11:40:26,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:26,105 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 11:40:26,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:40:26,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331976095] [2023-12-19 11:40:26,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331976095] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:40:26,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:40:26,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 11:40:26,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608152702] [2023-12-19 11:40:26,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:40:26,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 11:40:26,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:40:26,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 11:40:26,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 11:40:26,133 INFO L87 Difference]: Start difference. First operand has 33 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-19 11:40:26,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:40:26,160 INFO L93 Difference]: Finished difference Result 65 states and 106 transitions. [2023-12-19 11:40:26,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 11:40:26,162 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 59 [2023-12-19 11:40:26,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:40:26,166 INFO L225 Difference]: With dead ends: 65 [2023-12-19 11:40:26,166 INFO L226 Difference]: Without dead ends: 31 [2023-12-19 11:40:26,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 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-19 11:40:26,171 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 11:40:26,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 11:40:26,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-19 11:40:26,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-12-19 11:40:26,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-19 11:40:26,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2023-12-19 11:40:26,206 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 44 transitions. Word has length 59 [2023-12-19 11:40:26,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:40:26,207 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 44 transitions. [2023-12-19 11:40:26,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-19 11:40:26,207 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 44 transitions. [2023-12-19 11:40:26,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-19 11:40:26,210 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:40:26,210 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:40:26,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 11:40:26,211 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:40:26,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:40:26,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1345174155, now seen corresponding path program 1 times [2023-12-19 11:40:26,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:40:26,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428974565] [2023-12-19 11:40:26,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:40:26,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:40:26,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:27,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:40:27,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:27,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 11:40:27,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:27,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:40:27,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:27,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 11:40:27,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:27,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 11:40:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:27,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 11:40:27,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:27,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 11:40:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:27,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 11:40:27,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:27,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 11:40:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:27,958 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 11:40:27,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:40:27,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428974565] [2023-12-19 11:40:27,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428974565] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:40:27,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:40:27,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 11:40:27,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680546480] [2023-12-19 11:40:27,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:40:27,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 11:40:27,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:40:27,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 11:40:27,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-12-19 11:40:27,965 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 11:40:28,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:40:28,275 INFO L93 Difference]: Finished difference Result 85 states and 115 transitions. [2023-12-19 11:40:28,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-19 11:40:28,275 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 59 [2023-12-19 11:40:28,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:40:28,279 INFO L225 Difference]: With dead ends: 85 [2023-12-19 11:40:28,279 INFO L226 Difference]: Without dead ends: 83 [2023-12-19 11:40:28,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2023-12-19 11:40:28,280 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 68 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 11:40:28,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 139 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 11:40:28,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-12-19 11:40:28,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 64. [2023-12-19 11:40:28,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 43 states have internal predecessors, (57), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-19 11:40:28,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 93 transitions. [2023-12-19 11:40:28,291 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 93 transitions. Word has length 59 [2023-12-19 11:40:28,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:40:28,292 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 93 transitions. [2023-12-19 11:40:28,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 11:40:28,292 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 93 transitions. [2023-12-19 11:40:28,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-19 11:40:28,293 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:40:28,293 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:40:28,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 11:40:28,293 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:40:28,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:40:28,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1345114573, now seen corresponding path program 1 times [2023-12-19 11:40:28,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:40:28,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356776529] [2023-12-19 11:40:28,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:40:28,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:40:28,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:29,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:40:29,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:29,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 11:40:29,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:29,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:40:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:29,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 11:40:29,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:29,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 11:40:29,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:29,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 11:40:29,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:29,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 11:40:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:29,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 11:40:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:29,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 11:40:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:29,170 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 11:40:29,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:40:29,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356776529] [2023-12-19 11:40:29,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356776529] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:40:29,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:40:29,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 11:40:29,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435450848] [2023-12-19 11:40:29,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:40:29,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 11:40:29,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:40:29,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 11:40:29,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-19 11:40:29,175 INFO L87 Difference]: Start difference. First operand 64 states and 93 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 11:40:29,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:40:29,512 INFO L93 Difference]: Finished difference Result 215 states and 296 transitions. [2023-12-19 11:40:29,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 11:40:29,513 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 59 [2023-12-19 11:40:29,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:40:29,517 INFO L225 Difference]: With dead ends: 215 [2023-12-19 11:40:29,517 INFO L226 Difference]: Without dead ends: 152 [2023-12-19 11:40:29,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2023-12-19 11:40:29,522 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 61 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 11:40:29,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 230 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 11:40:29,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-12-19 11:40:29,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 129. [2023-12-19 11:40:29,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 36 states have call successors, (36), 8 states have call predecessors, (36), 8 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-19 11:40:29,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 172 transitions. [2023-12-19 11:40:29,557 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 172 transitions. Word has length 59 [2023-12-19 11:40:29,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:40:29,558 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 172 transitions. [2023-12-19 11:40:29,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 11:40:29,558 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 172 transitions. [2023-12-19 11:40:29,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-19 11:40:29,563 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:40:29,563 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:40:29,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 11:40:29,564 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:40:29,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:40:29,564 INFO L85 PathProgramCache]: Analyzing trace with hash -2046131806, now seen corresponding path program 1 times [2023-12-19 11:40:29,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:40:29,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518231556] [2023-12-19 11:40:29,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:40:29,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:40:29,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:29,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:40:29,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:29,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 11:40:29,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:29,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:40:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:29,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 11:40:29,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:29,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 11:40:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:29,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 11:40:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:29,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 11:40:29,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:29,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 11:40:29,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:29,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 11:40:29,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:29,660 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 11:40:29,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:40:29,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518231556] [2023-12-19 11:40:29,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518231556] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:40:29,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:40:29,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 11:40:29,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305711041] [2023-12-19 11:40:29,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:40:29,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 11:40:29,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:40:29,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 11:40:29,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 11:40:29,661 INFO L87 Difference]: Start difference. First operand 129 states and 172 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 11:40:29,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:40:29,718 INFO L93 Difference]: Finished difference Result 302 states and 405 transitions. [2023-12-19 11:40:29,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 11:40:29,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 60 [2023-12-19 11:40:29,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:40:29,720 INFO L225 Difference]: With dead ends: 302 [2023-12-19 11:40:29,720 INFO L226 Difference]: Without dead ends: 174 [2023-12-19 11:40:29,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 11:40:29,728 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 29 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 11:40:29,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 114 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 11:40:29,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-12-19 11:40:29,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 150. [2023-12-19 11:40:29,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 95 states have (on average 1.1789473684210525) internal successors, (112), 95 states have internal predecessors, (112), 45 states have call successors, (45), 9 states have call predecessors, (45), 9 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2023-12-19 11:40:29,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 202 transitions. [2023-12-19 11:40:29,763 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 202 transitions. Word has length 60 [2023-12-19 11:40:29,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:40:29,763 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 202 transitions. [2023-12-19 11:40:29,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 11:40:29,763 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 202 transitions. [2023-12-19 11:40:29,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-19 11:40:29,764 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:40:29,764 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:40:29,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 11:40:29,764 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:40:29,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:40:29,764 INFO L85 PathProgramCache]: Analyzing trace with hash -271124444, now seen corresponding path program 1 times [2023-12-19 11:40:29,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:40:29,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147252249] [2023-12-19 11:40:29,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:40:29,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:40:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:29,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:40:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:29,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 11:40:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:29,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:40:29,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:29,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 11:40:29,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:29,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 11:40:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:29,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 11:40:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:29,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 11:40:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:29,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 11:40:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:29,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 11:40:29,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:29,850 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 11:40:29,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:40:29,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147252249] [2023-12-19 11:40:29,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147252249] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:40:29,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:40:29,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 11:40:29,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386469274] [2023-12-19 11:40:29,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:40:29,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 11:40:29,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:40:29,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 11:40:29,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 11:40:29,852 INFO L87 Difference]: Start difference. First operand 150 states and 202 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 11:40:29,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:40:29,912 INFO L93 Difference]: Finished difference Result 366 states and 490 transitions. [2023-12-19 11:40:29,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 11:40:29,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 60 [2023-12-19 11:40:29,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:40:29,914 INFO L225 Difference]: With dead ends: 366 [2023-12-19 11:40:29,914 INFO L226 Difference]: Without dead ends: 237 [2023-12-19 11:40:29,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 11:40:29,915 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 42 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 11:40:29,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 121 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 11:40:29,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2023-12-19 11:40:29,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 171. [2023-12-19 11:40:29,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 106 states have (on average 1.169811320754717) internal successors, (124), 108 states have internal predecessors, (124), 54 states have call successors, (54), 10 states have call predecessors, (54), 10 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-19 11:40:29,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 232 transitions. [2023-12-19 11:40:29,942 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 232 transitions. Word has length 60 [2023-12-19 11:40:29,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:40:29,942 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 232 transitions. [2023-12-19 11:40:29,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 11:40:29,942 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 232 transitions. [2023-12-19 11:40:29,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-19 11:40:29,943 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:40:29,943 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:40:29,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 11:40:29,943 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:40:29,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:40:29,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1010277305, now seen corresponding path program 1 times [2023-12-19 11:40:29,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:40:29,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201733483] [2023-12-19 11:40:29,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:40:29,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:40:29,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:31,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:40:31,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:31,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 11:40:31,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:31,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:40:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:31,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 11:40:31,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:31,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 11:40:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:31,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 11:40:31,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:31,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 11:40:31,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:31,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 11:40:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:31,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 11:40:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:31,269 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 11:40:31,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:40:31,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201733483] [2023-12-19 11:40:31,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201733483] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:40:31,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:40:31,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 11:40:31,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796181449] [2023-12-19 11:40:31,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:40:31,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 11:40:31,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:40:31,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 11:40:31,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-19 11:40:31,271 INFO L87 Difference]: Start difference. First operand 171 states and 232 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 11:40:31,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:40:31,567 INFO L93 Difference]: Finished difference Result 292 states and 392 transitions. [2023-12-19 11:40:31,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-19 11:40:31,568 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 60 [2023-12-19 11:40:31,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:40:31,570 INFO L225 Difference]: With dead ends: 292 [2023-12-19 11:40:31,570 INFO L226 Difference]: Without dead ends: 207 [2023-12-19 11:40:31,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2023-12-19 11:40:31,571 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 37 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 11:40:31,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 119 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 11:40:31,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2023-12-19 11:40:31,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 176. [2023-12-19 11:40:31,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 111 states have (on average 1.1801801801801801) internal successors, (131), 113 states have internal predecessors, (131), 54 states have call successors, (54), 10 states have call predecessors, (54), 10 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-19 11:40:31,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 239 transitions. [2023-12-19 11:40:31,588 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 239 transitions. Word has length 60 [2023-12-19 11:40:31,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:40:31,588 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 239 transitions. [2023-12-19 11:40:31,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 11:40:31,588 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 239 transitions. [2023-12-19 11:40:31,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-19 11:40:31,589 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:40:31,589 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:40:31,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 11:40:31,589 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:40:31,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:40:31,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1012124347, now seen corresponding path program 1 times [2023-12-19 11:40:31,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:40:31,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362683687] [2023-12-19 11:40:31,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:40:31,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:40:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:31,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:40:31,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:31,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 11:40:31,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:31,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:40:31,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:31,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 11:40:31,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:31,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 11:40:31,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:31,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 11:40:31,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:31,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 11:40:31,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:31,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 11:40:31,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:31,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 11:40:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:31,692 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-12-19 11:40:31,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:40:31,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362683687] [2023-12-19 11:40:31,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362683687] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 11:40:31,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315748546] [2023-12-19 11:40:31,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:40:31,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 11:40:31,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 11:40:31,695 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-19 11:40:31,725 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-19 11:40:31,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:31,756 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-19 11:40:31,760 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 11:40:31,834 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 12 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-12-19 11:40:31,835 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 11:40:31,937 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-12-19 11:40:31,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315748546] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 11:40:31,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 11:40:31,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2023-12-19 11:40:31,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634356685] [2023-12-19 11:40:31,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 11:40:31,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 11:40:31,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:40:31,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 11:40:31,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-19 11:40:31,939 INFO L87 Difference]: Start difference. First operand 176 states and 239 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-19 11:40:32,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:40:32,062 INFO L93 Difference]: Finished difference Result 286 states and 375 transitions. [2023-12-19 11:40:32,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 11:40:32,062 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 60 [2023-12-19 11:40:32,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:40:32,063 INFO L225 Difference]: With dead ends: 286 [2023-12-19 11:40:32,063 INFO L226 Difference]: Without dead ends: 111 [2023-12-19 11:40:32,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 133 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2023-12-19 11:40:32,064 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 62 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 11:40:32,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 53 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 11:40:32,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-12-19 11:40:32,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 99. [2023-12-19 11:40:32,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 63 states have (on average 1.0952380952380953) internal successors, (69), 64 states have internal predecessors, (69), 27 states have call successors, (27), 8 states have call predecessors, (27), 8 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-19 11:40:32,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 123 transitions. [2023-12-19 11:40:32,080 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 123 transitions. Word has length 60 [2023-12-19 11:40:32,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:40:32,080 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 123 transitions. [2023-12-19 11:40:32,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-19 11:40:32,080 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 123 transitions. [2023-12-19 11:40:32,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-19 11:40:32,081 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:40:32,081 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 11:40:32,089 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-19 11:40:32,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 11:40:32,290 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:40:32,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:40:32,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1935994354, now seen corresponding path program 1 times [2023-12-19 11:40:32,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:40:32,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925939747] [2023-12-19 11:40:32,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:40:32,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:40:32,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:32,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:40:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:32,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 11:40:32,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:32,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:40:32,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:32,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 11:40:32,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:32,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 11:40:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:32,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 11:40:32,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:32,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 11:40:32,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:32,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 11:40:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:32,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 11:40:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:32,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-19 11:40:32,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:32,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-19 11:40:32,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:32,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 11:40:32,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:32,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 11:40:32,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:32,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-19 11:40:32,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:32,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-19 11:40:32,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:32,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-19 11:40:32,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:32,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-12-19 11:40:32,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:32,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 11:40:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:32,387 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-19 11:40:32,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:40:32,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925939747] [2023-12-19 11:40:32,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925939747] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 11:40:32,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137177292] [2023-12-19 11:40:32,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:40:32,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 11:40:32,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 11:40:32,388 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-19 11:40:32,416 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-19 11:40:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:40:32,463 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-19 11:40:32,468 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 11:40:32,498 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2023-12-19 11:40:32,498 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 11:40:32,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137177292] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:40:32,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 11:40:32,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-12-19 11:40:32,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212568365] [2023-12-19 11:40:32,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:40:32,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 11:40:32,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:40:32,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 11:40:32,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 11:40:32,501 INFO L87 Difference]: Start difference. First operand 99 states and 123 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-19 11:40:32,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:40:32,525 INFO L93 Difference]: Finished difference Result 134 states and 166 transitions. [2023-12-19 11:40:32,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 11:40:32,525 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 118 [2023-12-19 11:40:32,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:40:32,526 INFO L225 Difference]: With dead ends: 134 [2023-12-19 11:40:32,526 INFO L226 Difference]: Without dead ends: 0 [2023-12-19 11:40:32,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 11:40:32,526 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 11:40:32,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 55 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 11:40:32,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-19 11:40:32,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-19 11:40:32,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 11:40:32,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-19 11:40:32,527 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 118 [2023-12-19 11:40:32,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:40:32,527 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-19 11:40:32,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-19 11:40:32,528 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-19 11:40:32,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-19 11:40:32,529 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 11:40:32,538 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-19 11:40:32,740 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,SelfDestructingSolverStorable7 [2023-12-19 11:40:32,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-19 11:40:33,423 INFO L899 garLoopResultBuilder]: For program point L64(line 64) no Hoare annotation was computed. [2023-12-19 11:40:33,423 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-19 11:40:33,423 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-19 11:40:33,423 INFO L899 garLoopResultBuilder]: For program point L48(lines 48 52) no Hoare annotation was computed. [2023-12-19 11:40:33,423 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-19 11:40:33,423 INFO L899 garLoopResultBuilder]: For program point L48-1(lines 38 58) no Hoare annotation was computed. [2023-12-19 11:40:33,423 INFO L899 garLoopResultBuilder]: For program point L73(lines 59 74) no Hoare annotation was computed. [2023-12-19 11:40:33,423 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 42) no Hoare annotation was computed. [2023-12-19 11:40:33,424 INFO L895 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: (let ((.cse0 (div ~last_1_var_1_5~0 256))) (and (= (* (div ~var_1_11~0 256) 256) ~var_1_11~0) (= ~var_1_5~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_17~0 (* 256 (div ~var_1_17~0 256))) (<= ~last_1_var_1_5~0 (* .cse0 256)) (= ~var_1_8~0 0) (<= 0 .cse0))) [2023-12-19 11:40:33,424 INFO L895 garLoopResultBuilder]: At program point L69-1(line 69) the Hoare annotation is: (let ((.cse0 (div ~last_1_var_1_5~0 256))) (and (= (* (div ~var_1_11~0 256) 256) ~var_1_11~0) (= ~var_1_5~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_17~0 (* 256 (div ~var_1_17~0 256))) (<= ~last_1_var_1_5~0 (* .cse0 256)) (= ~var_1_8~0 0) (<= 0 .cse0))) [2023-12-19 11:40:33,424 INFO L895 garLoopResultBuilder]: At program point L61(line 61) the Hoare annotation is: (let ((.cse0 (div ~last_1_var_1_5~0 256))) (and (= (* (div ~var_1_11~0 256) 256) ~var_1_11~0) (= ~var_1_5~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_17~0 (* 256 (div ~var_1_17~0 256))) (<= ~last_1_var_1_5~0 (* .cse0 256)) (= ~var_1_8~0 0) (<= 0 .cse0))) [2023-12-19 11:40:33,424 INFO L899 garLoopResultBuilder]: For program point L61-1(line 61) no Hoare annotation was computed. [2023-12-19 11:40:33,424 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-19 11:40:33,424 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 51) no Hoare annotation was computed. [2023-12-19 11:40:33,424 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2023-12-19 11:40:33,424 INFO L895 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: (let ((.cse0 (div ~last_1_var_1_5~0 256))) (and (= ~var_1_5~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_17~0 (* 256 (div ~var_1_17~0 256))) (<= ~last_1_var_1_5~0 (* .cse0 256)) (= ~var_1_8~0 0) (<= 0 .cse0))) [2023-12-19 11:40:33,424 INFO L895 garLoopResultBuilder]: At program point L66-1(line 66) the Hoare annotation is: (let ((.cse0 (div ~last_1_var_1_5~0 256))) (and (= ~var_1_5~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_17~0 (* 256 (div ~var_1_17~0 256))) (<= ~last_1_var_1_5~0 (* .cse0 256)) (= ~var_1_8~0 0) (<= 0 .cse0))) [2023-12-19 11:40:33,424 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-19 11:40:33,424 INFO L895 garLoopResultBuilder]: At program point L87-3(lines 87 93) the Hoare annotation is: (let ((.cse0 (= (* (div ~var_1_11~0 256) 256) ~var_1_11~0)) (.cse1 (<= ~var_1_17~0 (* 256 (div ~var_1_17~0 256)))) (.cse2 (= ~var_1_8~0 0))) (or (and .cse0 (<= 1 |ULTIMATE.start_main_~k_loop~0#1|) .cse1 .cse2) (and .cse0 (= ~var_1_5~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) .cse1 .cse2))) [2023-12-19 11:40:33,425 INFO L899 garLoopResultBuilder]: For program point L87-4(lines 87 93) no Hoare annotation was computed. [2023-12-19 11:40:33,425 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-19 11:40:33,425 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 58) no Hoare annotation was computed. [2023-12-19 11:40:33,425 INFO L899 garLoopResultBuilder]: For program point L67(line 67) no Hoare annotation was computed. [2023-12-19 11:40:33,425 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (let ((.cse0 (div ~last_1_var_1_5~0 256))) (and (= (* (div ~var_1_11~0 256) 256) ~var_1_11~0) (= ~var_1_5~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_17~0 (* 256 (div ~var_1_17~0 256))) (<= ~last_1_var_1_5~0 (* .cse0 256)) (= ~var_1_8~0 0) (<= 0 .cse0))) [2023-12-19 11:40:33,425 INFO L895 garLoopResultBuilder]: At program point L63-1(line 63) the Hoare annotation is: (let ((.cse0 (div ~last_1_var_1_5~0 256))) (and (= (* (div ~var_1_11~0 256) 256) ~var_1_11~0) (= ~var_1_5~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_17~0 (* 256 (div ~var_1_17~0 256))) (<= ~last_1_var_1_5~0 (* .cse0 256)) (= ~var_1_8~0 0) (<= 0 .cse0))) [2023-12-19 11:40:33,425 INFO L895 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: (let ((.cse0 (div ~last_1_var_1_5~0 256))) (and (= (* (div ~var_1_11~0 256) 256) ~var_1_11~0) (= ~var_1_5~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_17~0 (* 256 (div ~var_1_17~0 256))) (<= ~last_1_var_1_5~0 (* .cse0 256)) (= ~var_1_8~0 0) (<= 0 .cse0))) [2023-12-19 11:40:33,425 INFO L895 garLoopResultBuilder]: At program point L72-1(line 72) the Hoare annotation is: (let ((.cse0 (div ~last_1_var_1_5~0 256))) (and (= (* (div ~var_1_11~0 256) 256) ~var_1_11~0) (= ~var_1_5~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_17~0 (* 256 (div ~var_1_17~0 256))) (<= ~last_1_var_1_5~0 (* .cse0 256)) (= ~var_1_8~0 0) (<= 0 .cse0))) [2023-12-19 11:40:33,425 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 43) no Hoare annotation was computed. [2023-12-19 11:40:33,425 INFO L899 garLoopResultBuilder]: For program point L39-1(lines 39 43) no Hoare annotation was computed. [2023-12-19 11:40:33,425 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-19 11:40:33,425 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-19 11:40:33,425 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-19 11:40:33,425 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-19 11:40:33,427 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 11:40:33,429 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 11:40:33,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 11:40:33 BoogieIcfgContainer [2023-12-19 11:40:33,435 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 11:40:33,436 INFO L158 Benchmark]: Toolchain (without parser) took 8199.66ms. Allocated memory was 199.2MB in the beginning and 415.2MB in the end (delta: 216.0MB). Free memory was 155.7MB in the beginning and 298.7MB in the end (delta: -143.0MB). Peak memory consumption was 233.3MB. Max. memory is 8.0GB. [2023-12-19 11:40:33,436 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 199.2MB. Free memory is still 151.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 11:40:33,436 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.62ms. Allocated memory is still 199.2MB. Free memory was 155.3MB in the beginning and 143.1MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-19 11:40:33,436 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.98ms. Allocated memory is still 199.2MB. Free memory was 143.1MB in the beginning and 141.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-19 11:40:33,436 INFO L158 Benchmark]: Boogie Preprocessor took 24.74ms. Allocated memory is still 199.2MB. Free memory was 141.0MB in the beginning and 138.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-19 11:40:33,437 INFO L158 Benchmark]: RCFGBuilder took 335.66ms. Allocated memory is still 199.2MB. Free memory was 138.5MB in the beginning and 123.2MB in the end (delta: 15.4MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-19 11:40:33,437 INFO L158 Benchmark]: TraceAbstraction took 7619.84ms. Allocated memory was 199.2MB in the beginning and 415.2MB in the end (delta: 216.0MB). Free memory was 122.5MB in the beginning and 298.7MB in the end (delta: -176.2MB). Peak memory consumption was 200.8MB. Max. memory is 8.0GB. [2023-12-19 11:40:33,437 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.41ms. Allocated memory is still 199.2MB. Free memory is still 151.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 188.62ms. Allocated memory is still 199.2MB. Free memory was 155.3MB in the beginning and 143.1MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.98ms. Allocated memory is still 199.2MB. Free memory was 143.1MB in the beginning and 141.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.74ms. Allocated memory is still 199.2MB. Free memory was 141.0MB in the beginning and 138.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 335.66ms. Allocated memory is still 199.2MB. Free memory was 138.5MB in the beginning and 123.2MB in the end (delta: 15.4MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 7619.84ms. Allocated memory was 199.2MB in the beginning and 415.2MB in the end (delta: 216.0MB). Free memory was 122.5MB in the beginning and 298.7MB in the end (delta: -176.2MB). Peak memory consumption was 200.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.6s, OverallIterations: 8, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 302 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 300 mSDsluCounter, 872 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 559 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 432 IncrementalHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 313 mSDtfsCounter, 432 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 476 GetRequests, 422 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=176occurred in iteration=6, InterpolantAutomatonStates: 58, 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, 8 MinimizatonAttempts, 175 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 226 PreInvPairs, 238 NumberOfFragments, 357 HoareAnnotationTreeSize, 226 FormulaSimplifications, 47741 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 11 FormulaSimplificationsInter, 1228 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 713 NumberOfCodeBlocks, 713 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 762 ConstructedInterpolants, 0 QuantifiedInterpolants, 2654 SizeOfPredicates, 4 NumberOfNonLiveVariables, 470 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 2525/2562 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: (((((((var_1_11 / 256) * 256) == var_1_11) && (1 <= k_loop)) && (var_1_17 <= (256 * (var_1_17 / 256)))) && (var_1_8 == 0)) || (((((((var_1_11 / 256) * 256) == var_1_11) && (var_1_5 == 0)) && (0 <= k_loop)) && (var_1_17 <= (256 * (var_1_17 / 256)))) && (var_1_8 == 0))) RESULT: Ultimate proved your program to be correct! [2023-12-19 11:40:33,458 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...