/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-39.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 20:53:36,934 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 20:53:36,999 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 20:53:37,004 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 20:53:37,004 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 20:53:37,019 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 20:53:37,019 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 20:53:37,020 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 20:53:37,020 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 20:53:37,023 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 20:53:37,023 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 20:53:37,024 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 20:53:37,024 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 20:53:37,025 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 20:53:37,025 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 20:53:37,025 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 20:53:37,025 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 20:53:37,025 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 20:53:37,026 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 20:53:37,026 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 20:53:37,027 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 20:53:37,027 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 20:53:37,027 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 20:53:37,027 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 20:53:37,027 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 20:53:37,027 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 20:53:37,028 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 20:53:37,028 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 20:53:37,028 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 20:53:37,028 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 20:53:37,029 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 20:53:37,029 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 20:53:37,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:53:37,029 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 20:53:37,029 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 20:53:37,029 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 20:53:37,030 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 20:53:37,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 20:53:37,030 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 20:53:37,030 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 20:53:37,030 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 20:53:37,030 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 20:53:37,030 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 20:53:37,030 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 20:53:37,234 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 20:53:37,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 20:53:37,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 20:53:37,254 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 20:53:37,254 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 20:53:37,255 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-39.i [2023-12-15 20:53:38,264 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 20:53:38,417 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 20:53:38,418 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-39.i [2023-12-15 20:53:38,425 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92e691787/f926ee3eb65a4029bfa4bcf7c01e5561/FLAG5f6d14ac2 [2023-12-15 20:53:38,440 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92e691787/f926ee3eb65a4029bfa4bcf7c01e5561 [2023-12-15 20:53:38,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 20:53:38,443 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 20:53:38,444 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 20:53:38,444 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 20:53:38,448 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 20:53:38,448 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:53:38" (1/1) ... [2023-12-15 20:53:38,449 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cb7dbb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:53:38, skipping insertion in model container [2023-12-15 20:53:38,449 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:53:38" (1/1) ... [2023-12-15 20:53:38,475 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 20:53:38,575 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-39.i[915,928] [2023-12-15 20:53:38,611 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:53:38,618 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 20:53:38,627 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-39.i[915,928] [2023-12-15 20:53:38,641 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:53:38,660 INFO L206 MainTranslator]: Completed translation [2023-12-15 20:53:38,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:53:38 WrapperNode [2023-12-15 20:53:38,661 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 20:53:38,662 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 20:53:38,662 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 20:53:38,662 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 20:53:38,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:53:38" (1/1) ... [2023-12-15 20:53:38,675 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:53:38" (1/1) ... [2023-12-15 20:53:38,702 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2023-12-15 20:53:38,703 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 20:53:38,703 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 20:53:38,703 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 20:53:38,704 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 20:53:38,714 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:53:38" (1/1) ... [2023-12-15 20:53:38,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:53:38" (1/1) ... [2023-12-15 20:53:38,716 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:53:38" (1/1) ... [2023-12-15 20:53:38,726 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-15 20:53:38,727 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:53:38" (1/1) ... [2023-12-15 20:53:38,727 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:53:38" (1/1) ... [2023-12-15 20:53:38,732 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:53:38" (1/1) ... [2023-12-15 20:53:38,734 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:53:38" (1/1) ... [2023-12-15 20:53:38,735 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:53:38" (1/1) ... [2023-12-15 20:53:38,736 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:53:38" (1/1) ... [2023-12-15 20:53:38,738 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 20:53:38,738 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 20:53:38,738 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 20:53:38,738 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 20:53:38,739 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:53:38" (1/1) ... [2023-12-15 20:53:38,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:53:38,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:53:38,820 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-15 20:53:38,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-15 20:53:38,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 20:53:38,847 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 20:53:38,847 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 20:53:38,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 20:53:38,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 20:53:38,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 20:53:38,903 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 20:53:38,905 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 20:53:39,063 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 20:53:39,089 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 20:53:39,089 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 20:53:39,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:53:39 BoogieIcfgContainer [2023-12-15 20:53:39,090 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 20:53:39,091 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 20:53:39,091 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 20:53:39,093 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 20:53:39,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 08:53:38" (1/3) ... [2023-12-15 20:53:39,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bc1555a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:53:39, skipping insertion in model container [2023-12-15 20:53:39,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:53:38" (2/3) ... [2023-12-15 20:53:39,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bc1555a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:53:39, skipping insertion in model container [2023-12-15 20:53:39,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:53:39" (3/3) ... [2023-12-15 20:53:39,095 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-39.i [2023-12-15 20:53:39,107 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 20:53:39,107 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 20:53:39,139 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 20:53:39,143 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;@3d7d8841, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 20:53:39,143 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 20:53:39,145 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-15 20:53:39,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-12-15 20:53:39,153 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:53:39,153 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:53:39,154 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:53:39,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:53:39,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1223872176, now seen corresponding path program 1 times [2023-12-15 20:53:39,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:53:39,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30046286] [2023-12-15 20:53:39,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:53:39,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:53:39,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:39,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:53:39,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:39,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:53:39,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:39,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:53:39,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:39,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-15 20:53:39,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:39,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-15 20:53:39,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:40,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-15 20:53:40,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:40,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:53:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:40,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 20:53:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:40,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:53:40,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:40,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:53:40,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:40,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-15 20:53:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:40,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 20:53:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:40,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-15 20:53:40,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:40,078 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-15 20:53:40,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:53:40,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30046286] [2023-12-15 20:53:40,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30046286] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:53:40,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:53:40,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 20:53:40,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314053685] [2023-12-15 20:53:40,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:53:40,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 20:53:40,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:53:40,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 20:53:40,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 20:53:40,111 INFO L87 Difference]: Start difference. First operand has 41 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-15 20:53:40,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:53:40,353 INFO L93 Difference]: Finished difference Result 152 states and 267 transitions. [2023-12-15 20:53:40,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 20:53:40,355 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 83 [2023-12-15 20:53:40,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:53:40,365 INFO L225 Difference]: With dead ends: 152 [2023-12-15 20:53:40,365 INFO L226 Difference]: Without dead ends: 106 [2023-12-15 20:53:40,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 20:53:40,371 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 60 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 20:53:40,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 159 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 20:53:40,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-12-15 20:53:40,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 75. [2023-12-15 20:53:40,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-15 20:53:40,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 109 transitions. [2023-12-15 20:53:40,436 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 109 transitions. Word has length 83 [2023-12-15 20:53:40,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:53:40,438 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 109 transitions. [2023-12-15 20:53:40,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-15 20:53:40,438 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 109 transitions. [2023-12-15 20:53:40,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-15 20:53:40,441 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:53:40,442 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:53:40,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 20:53:40,442 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:53:40,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:53:40,443 INFO L85 PathProgramCache]: Analyzing trace with hash 310777802, now seen corresponding path program 1 times [2023-12-15 20:53:40,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:53:40,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306497731] [2023-12-15 20:53:40,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:53:40,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:53:40,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:40,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:53:40,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:40,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:53:40,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:40,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:53:40,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:40,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-15 20:53:40,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:40,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-15 20:53:40,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:40,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-15 20:53:40,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:40,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:53:40,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:40,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 20:53:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:40,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:53:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:40,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:53:40,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:40,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-15 20:53:40,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:40,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 20:53:40,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:40,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-15 20:53:40,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:40,613 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-15 20:53:40,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:53:40,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306497731] [2023-12-15 20:53:40,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306497731] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:53:40,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:53:40,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 20:53:40,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991768214] [2023-12-15 20:53:40,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:53:40,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 20:53:40,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:53:40,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 20:53:40,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 20:53:40,615 INFO L87 Difference]: Start difference. First operand 75 states and 109 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-15 20:53:40,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:53:40,683 INFO L93 Difference]: Finished difference Result 192 states and 275 transitions. [2023-12-15 20:53:40,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 20:53:40,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 84 [2023-12-15 20:53:40,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:53:40,685 INFO L225 Difference]: With dead ends: 192 [2023-12-15 20:53:40,685 INFO L226 Difference]: Without dead ends: 118 [2023-12-15 20:53:40,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 20:53:40,687 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 40 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:53:40,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 155 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:53:40,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-12-15 20:53:40,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 110. [2023-12-15 20:53:40,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 67 states have (on average 1.208955223880597) internal successors, (81), 67 states have internal predecessors, (81), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2023-12-15 20:53:40,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 159 transitions. [2023-12-15 20:53:40,705 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 159 transitions. Word has length 84 [2023-12-15 20:53:40,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:53:40,706 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 159 transitions. [2023-12-15 20:53:40,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-15 20:53:40,706 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 159 transitions. [2023-12-15 20:53:40,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-15 20:53:40,707 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:53:40,707 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:53:40,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 20:53:40,707 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:53:40,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:53:40,707 INFO L85 PathProgramCache]: Analyzing trace with hash 570179731, now seen corresponding path program 1 times [2023-12-15 20:53:40,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:53:40,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246718721] [2023-12-15 20:53:40,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:53:40,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:53:40,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:41,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:53:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:41,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:53:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:41,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:53:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:41,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-15 20:53:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:41,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-15 20:53:41,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:41,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-15 20:53:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:41,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:53:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:41,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 20:53:41,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:41,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:53:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:41,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:53:41,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:41,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-15 20:53:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:41,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 20:53:41,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:41,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-15 20:53:41,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:41,591 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-15 20:53:41,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:53:41,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246718721] [2023-12-15 20:53:41,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246718721] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:53:41,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:53:41,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 20:53:41,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533844814] [2023-12-15 20:53:41,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:53:41,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 20:53:41,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:53:41,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 20:53:41,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-15 20:53:41,593 INFO L87 Difference]: Start difference. First operand 110 states and 159 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-15 20:53:41,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:53:41,847 INFO L93 Difference]: Finished difference Result 141 states and 197 transitions. [2023-12-15 20:53:41,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 20:53:41,848 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 84 [2023-12-15 20:53:41,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:53:41,850 INFO L225 Difference]: With dead ends: 141 [2023-12-15 20:53:41,850 INFO L226 Difference]: Without dead ends: 139 [2023-12-15 20:53:41,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2023-12-15 20:53:41,853 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 22 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:53:41,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 164 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:53:41,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-12-15 20:53:41,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 124. [2023-12-15 20:53:41,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 81 states have (on average 1.2345679012345678) internal successors, (100), 81 states have internal predecessors, (100), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2023-12-15 20:53:41,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 178 transitions. [2023-12-15 20:53:41,884 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 178 transitions. Word has length 84 [2023-12-15 20:53:41,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:53:41,885 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 178 transitions. [2023-12-15 20:53:41,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-15 20:53:41,885 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 178 transitions. [2023-12-15 20:53:41,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-15 20:53:41,886 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:53:41,887 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:53:41,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 20:53:41,887 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:53:41,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:53:41,888 INFO L85 PathProgramCache]: Analyzing trace with hash 570239313, now seen corresponding path program 1 times [2023-12-15 20:53:41,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:53:41,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587299331] [2023-12-15 20:53:41,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:53:41,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:53:41,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:42,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:53:42,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:42,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:53:42,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:42,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:53:42,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:42,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-15 20:53:42,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:42,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-15 20:53:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:42,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-15 20:53:42,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:42,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:53:42,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:42,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 20:53:42,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:42,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:53:42,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:42,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:53:42,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:42,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-15 20:53:42,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:42,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 20:53:42,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:42,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-15 20:53:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:42,686 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-15 20:53:42,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:53:42,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587299331] [2023-12-15 20:53:42,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587299331] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:53:42,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:53:42,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 20:53:42,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100293679] [2023-12-15 20:53:42,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:53:42,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 20:53:42,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:53:42,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 20:53:42,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-12-15 20:53:42,694 INFO L87 Difference]: Start difference. First operand 124 states and 178 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-15 20:53:42,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:53:42,927 INFO L93 Difference]: Finished difference Result 135 states and 190 transitions. [2023-12-15 20:53:42,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 20:53:42,927 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 84 [2023-12-15 20:53:42,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:53:42,928 INFO L225 Difference]: With dead ends: 135 [2023-12-15 20:53:42,928 INFO L226 Difference]: Without dead ends: 133 [2023-12-15 20:53:42,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2023-12-15 20:53:42,929 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 4 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:53:42,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 222 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:53:42,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-12-15 20:53:42,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 124. [2023-12-15 20:53:42,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 81 states have (on average 1.2222222222222223) internal successors, (99), 81 states have internal predecessors, (99), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2023-12-15 20:53:42,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 177 transitions. [2023-12-15 20:53:42,945 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 177 transitions. Word has length 84 [2023-12-15 20:53:42,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:53:42,945 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 177 transitions. [2023-12-15 20:53:42,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-15 20:53:42,946 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 177 transitions. [2023-12-15 20:53:42,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-12-15 20:53:42,949 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:53:42,950 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:53:42,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 20:53:42,950 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:53:42,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:53:42,950 INFO L85 PathProgramCache]: Analyzing trace with hash 2073291393, now seen corresponding path program 1 times [2023-12-15 20:53:42,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:53:42,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326883967] [2023-12-15 20:53:42,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:53:42,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:53:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:43,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:53:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:43,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:53:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:43,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:53:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:43,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-15 20:53:43,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:43,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-15 20:53:43,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:43,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-15 20:53:43,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:43,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:53:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:43,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 20:53:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:43,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:53:43,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:43,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:53:43,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:43,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-15 20:53:43,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:43,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 20:53:43,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:43,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-15 20:53:43,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:43,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-15 20:53:43,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:43,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:53:43,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:43,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-15 20:53:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:43,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-15 20:53:43,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:43,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-15 20:53:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:43,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-12-15 20:53:43,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:43,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-15 20:53:43,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:43,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-15 20:53:43,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:43,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-15 20:53:43,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:43,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-12-15 20:53:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:43,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-15 20:53:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:43,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-12-15 20:53:43,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:43,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-15 20:53:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:43,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2023-12-15 20:53:43,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:53:43,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326883967] [2023-12-15 20:53:43,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326883967] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 20:53:43,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002669817] [2023-12-15 20:53:43,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:53:43,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:53:43,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:53:43,052 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 20:53:43,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-15 20:53:43,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:53:43,143 INFO L262 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-15 20:53:43,153 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:53:43,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 706 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2023-12-15 20:53:43,234 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 20:53:43,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002669817] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:53:43,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 20:53:43,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-12-15 20:53:43,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668460956] [2023-12-15 20:53:43,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:53:43,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 20:53:43,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:53:43,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 20:53:43,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 20:53:43,237 INFO L87 Difference]: Start difference. First operand 124 states and 177 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2023-12-15 20:53:43,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:53:43,272 INFO L93 Difference]: Finished difference Result 164 states and 231 transitions. [2023-12-15 20:53:43,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 20:53:43,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 168 [2023-12-15 20:53:43,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:53:43,273 INFO L225 Difference]: With dead ends: 164 [2023-12-15 20:53:43,274 INFO L226 Difference]: Without dead ends: 0 [2023-12-15 20:53:43,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 20:53:43,276 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 2 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:53:43,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 79 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:53:43,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-15 20:53:43,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-15 20:53:43,277 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-15 20:53:43,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-15 20:53:43,279 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 168 [2023-12-15 20:53:43,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:53:43,280 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-15 20:53:43,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2023-12-15 20:53:43,281 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-15 20:53:43,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-15 20:53:43,282 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 20:53:43,294 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-15 20:53:43,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:53:43,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-15 20:53:44,042 INFO L899 garLoopResultBuilder]: For program point L56(lines 56 58) no Hoare annotation was computed. [2023-12-15 20:53:44,042 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-15 20:53:44,042 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-15 20:53:44,042 INFO L899 garLoopResultBuilder]: For program point L81(lines 60 82) no Hoare annotation was computed. [2023-12-15 20:53:44,042 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-15 20:53:44,042 INFO L895 garLoopResultBuilder]: At program point L77(line 77) the Hoare annotation is: (let ((.cse0 (div ~var_1_14~0 256))) (and (= ~var_1_10~0 0) (= ~last_1_var_1_10~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_14~0 10) (<= 0 .cse0) (<= 10 (div (+ (* ~var_1_14~0 65535) 16 (* (- 16776960) .cse0)) 65536)))) [2023-12-15 20:53:44,043 INFO L895 garLoopResultBuilder]: At program point L77-1(line 77) the Hoare annotation is: (let ((.cse0 (div ~var_1_14~0 256))) (and (= ~var_1_10~0 0) (= ~last_1_var_1_10~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_14~0 10) (<= 0 .cse0) (<= 10 (div (+ (* ~var_1_14~0 65535) 16 (* (- 16776960) .cse0)) 65536)))) [2023-12-15 20:53:44,043 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 44) no Hoare annotation was computed. [2023-12-15 20:53:44,043 INFO L899 garLoopResultBuilder]: For program point L40-1(lines 40 44) no Hoare annotation was computed. [2023-12-15 20:53:44,043 INFO L895 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: (let ((.cse0 (div ~var_1_14~0 256))) (and (= ~var_1_10~0 0) (= ~last_1_var_1_10~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_14~0 10) (<= 0 .cse0) (<= 10 (div (+ (* ~var_1_14~0 65535) 16 (* (- 16776960) .cse0)) 65536)))) [2023-12-15 20:53:44,043 INFO L899 garLoopResultBuilder]: For program point L69-1(line 69) no Hoare annotation was computed. [2023-12-15 20:53:44,043 INFO L895 garLoopResultBuilder]: At program point L65(line 65) the Hoare annotation is: (let ((.cse0 (div ~var_1_14~0 256))) (and (= ~var_1_10~0 0) (= ~last_1_var_1_10~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_14~0 10) (<= 0 .cse0) (<= 10 (div (+ (* ~var_1_14~0 65535) 16 (* (- 16776960) .cse0)) 65536)))) [2023-12-15 20:53:44,043 INFO L899 garLoopResultBuilder]: For program point L65-1(line 65) no Hoare annotation was computed. [2023-12-15 20:53:44,043 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-15 20:53:44,043 INFO L899 garLoopResultBuilder]: For program point L78(line 78) no Hoare annotation was computed. [2023-12-15 20:53:44,043 INFO L895 garLoopResultBuilder]: At program point L74(line 74) the Hoare annotation is: (let ((.cse0 (div ~var_1_14~0 256))) (and (= ~var_1_10~0 0) (= ~last_1_var_1_10~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_14~0 10) (<= 0 .cse0) (<= 10 (div (+ (* ~var_1_14~0 65535) 16 (* (- 16776960) .cse0)) 65536)))) [2023-12-15 20:53:44,043 INFO L895 garLoopResultBuilder]: At program point L74-1(line 74) the Hoare annotation is: (let ((.cse0 (div ~var_1_14~0 256))) (and (= ~var_1_10~0 0) (= ~last_1_var_1_10~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_14~0 10) (<= 0 .cse0) (<= 10 (div (+ (* ~var_1_14~0 65535) 16 (* (- 16776960) .cse0)) 65536)))) [2023-12-15 20:53:44,043 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 43) no Hoare annotation was computed. [2023-12-15 20:53:44,044 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-15 20:53:44,044 INFO L895 garLoopResultBuilder]: At program point L62(line 62) the Hoare annotation is: (let ((.cse0 (div ~var_1_14~0 256))) (and (= ~var_1_10~0 0) (= ~last_1_var_1_10~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_14~0 10) (<= 0 .cse0) (<= 10 (div (+ (* ~var_1_14~0 65535) 16 (* (- 16776960) .cse0)) 65536)))) [2023-12-15 20:53:44,044 INFO L895 garLoopResultBuilder]: At program point L62-1(line 62) the Hoare annotation is: (let ((.cse0 (div ~var_1_14~0 256))) (and (= ~var_1_10~0 0) (= ~last_1_var_1_10~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_14~0 10) (<= 0 .cse0) (<= 10 (div (+ (* ~var_1_14~0 65535) 16 (* (- 16776960) .cse0)) 65536)))) [2023-12-15 20:53:44,044 INFO L895 garLoopResultBuilder]: At program point L95-3(lines 95 101) the Hoare annotation is: (let ((.cse3 (div ~var_1_14~0 256))) (let ((.cse0 (<= ~var_1_14~0 10)) (.cse1 (<= 0 .cse3)) (.cse2 (<= 10 (div (+ (* ~var_1_14~0 65535) 16 (* (- 16776960) .cse3)) 65536)))) (or (and (<= 1 |ULTIMATE.start_main_~k_loop~0#1|) .cse0 .cse1 .cse2) (and (= ~var_1_10~0 0) (= ~last_1_var_1_10~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) .cse0 .cse1 .cse2)))) [2023-12-15 20:53:44,044 INFO L899 garLoopResultBuilder]: For program point L95-4(lines 95 101) no Hoare annotation was computed. [2023-12-15 20:53:44,044 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 54) no Hoare annotation was computed. [2023-12-15 20:53:44,044 INFO L899 garLoopResultBuilder]: For program point L46-1(lines 46 54) no Hoare annotation was computed. [2023-12-15 20:53:44,044 INFO L899 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2023-12-15 20:53:44,044 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-15 20:53:44,044 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (let ((.cse0 (div ~var_1_14~0 256))) (and (= ~var_1_10~0 0) (= ~last_1_var_1_10~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_14~0 10) (<= 0 .cse0) (<= 10 (div (+ (* ~var_1_14~0 65535) 16 (* (- 16776960) .cse0)) 65536)))) [2023-12-15 20:53:44,044 INFO L895 garLoopResultBuilder]: At program point L71-1(line 71) the Hoare annotation is: (let ((.cse0 (div ~var_1_14~0 256))) (and (= ~var_1_10~0 0) (= ~last_1_var_1_10~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_14~0 10) (<= 0 .cse0) (<= 10 (div (+ (* ~var_1_14~0 65535) 16 (* (- 16776960) .cse0)) 65536)))) [2023-12-15 20:53:44,044 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 59) no Hoare annotation was computed. [2023-12-15 20:53:44,044 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (let ((.cse0 (div ~var_1_14~0 256))) (and (= ~var_1_10~0 0) (= ~last_1_var_1_10~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_14~0 10) (<= 0 .cse0) (<= 10 (div (+ (* ~var_1_14~0 65535) 16 (* (- 16776960) .cse0)) 65536)))) [2023-12-15 20:53:44,045 INFO L899 garLoopResultBuilder]: For program point L67-1(line 67) no Hoare annotation was computed. [2023-12-15 20:53:44,045 INFO L899 garLoopResultBuilder]: For program point L63(line 63) no Hoare annotation was computed. [2023-12-15 20:53:44,045 INFO L895 garLoopResultBuilder]: At program point L80(line 80) the Hoare annotation is: (let ((.cse0 (div ~var_1_14~0 256))) (and (= ~var_1_10~0 0) (= ~last_1_var_1_10~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_14~0 10) (<= 0 .cse0) (<= 10 (div (+ (* ~var_1_14~0 65535) 16 (* (- 16776960) .cse0)) 65536)))) [2023-12-15 20:53:44,045 INFO L895 garLoopResultBuilder]: At program point L80-1(line 80) the Hoare annotation is: (let ((.cse0 (div ~var_1_14~0 256))) (and (= ~var_1_10~0 0) (= ~last_1_var_1_10~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_14~0 10) (<= 0 .cse0) (<= 10 (div (+ (* ~var_1_14~0 65535) 16 (* (- 16776960) .cse0)) 65536)))) [2023-12-15 20:53:44,045 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 51) no Hoare annotation was computed. [2023-12-15 20:53:44,045 INFO L899 garLoopResultBuilder]: For program point L72(line 72) no Hoare annotation was computed. [2023-12-15 20:53:44,045 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-15 20:53:44,045 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-15 20:53:44,045 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-15 20:53:44,045 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-15 20:53:44,047 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-15 20:53:44,049 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 20:53:44,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 08:53:44 BoogieIcfgContainer [2023-12-15 20:53:44,057 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 20:53:44,057 INFO L158 Benchmark]: Toolchain (without parser) took 5613.83ms. Allocated memory was 273.7MB in the beginning and 329.3MB in the end (delta: 55.6MB). Free memory was 221.8MB in the beginning and 283.1MB in the end (delta: -61.3MB). Peak memory consumption was 174.1MB. Max. memory is 8.0GB. [2023-12-15 20:53:44,057 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 178.3MB. Free memory is still 130.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 20:53:44,057 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.03ms. Allocated memory is still 273.7MB. Free memory was 221.5MB in the beginning and 208.8MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-15 20:53:44,057 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.25ms. Allocated memory is still 273.7MB. Free memory was 208.8MB in the beginning and 205.7MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 20:53:44,058 INFO L158 Benchmark]: Boogie Preprocessor took 34.39ms. Allocated memory is still 273.7MB. Free memory was 205.7MB in the beginning and 201.9MB in the end (delta: 3.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 20:53:44,058 INFO L158 Benchmark]: RCFGBuilder took 351.38ms. Allocated memory is still 273.7MB. Free memory was 201.9MB in the beginning and 184.8MB in the end (delta: 17.1MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-15 20:53:44,058 INFO L158 Benchmark]: TraceAbstraction took 4965.47ms. Allocated memory was 273.7MB in the beginning and 329.3MB in the end (delta: 55.6MB). Free memory was 184.1MB in the beginning and 283.1MB in the end (delta: -99.1MB). Peak memory consumption was 136.3MB. Max. memory is 8.0GB. [2023-12-15 20:53:44,059 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.11ms. Allocated memory is still 178.3MB. Free memory is still 130.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 217.03ms. Allocated memory is still 273.7MB. Free memory was 221.5MB in the beginning and 208.8MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.25ms. Allocated memory is still 273.7MB. Free memory was 208.8MB in the beginning and 205.7MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.39ms. Allocated memory is still 273.7MB. Free memory was 205.7MB in the beginning and 201.9MB in the end (delta: 3.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 351.38ms. Allocated memory is still 273.7MB. Free memory was 201.9MB in the beginning and 184.8MB in the end (delta: 17.1MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 4965.47ms. Allocated memory was 273.7MB in the beginning and 329.3MB in the end (delta: 55.6MB). Free memory was 184.1MB in the beginning and 283.1MB in the end (delta: -99.1MB). Peak memory consumption was 136.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.9s, OverallIterations: 5, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 128 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 128 mSDsluCounter, 779 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 496 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 308 IncrementalHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 283 mSDtfsCounter, 308 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 358 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=3, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 63 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 105 PreInvPairs, 121 NumberOfFragments, 476 HoareAnnotationTreeSize, 105 FormulaSimplifications, 1303 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 15 FormulaSimplificationsInter, 3365 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 671 NumberOfCodeBlocks, 671 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 665 ConstructedInterpolants, 0 QuantifiedInterpolants, 3288 SizeOfPredicates, 0 NumberOfNonLiveVariables, 377 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 3907/3908 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: 95]: Loop Invariant Derived loop invariant: (((((1 <= k_loop) && (var_1_14 <= 10)) && (0 <= (var_1_14 / 256))) && (10 <= ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) || ((((((var_1_10 == 0) && (last_1_var_1_10 == 0)) && (0 <= k_loop)) && (var_1_14 <= 10)) && (0 <= (var_1_14 / 256))) && (10 <= ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536)))) RESULT: Ultimate proved your program to be correct! [2023-12-15 20:53:44,073 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...