/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-76.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 22:24:44,886 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 22:24:44,931 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-20 22:24:44,934 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 22:24:44,934 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 22:24:44,949 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 22:24:44,949 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 22:24:44,950 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 22:24:44,950 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 22:24:44,950 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 22:24:44,951 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 22:24:44,951 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 22:24:44,952 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 22:24:44,952 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 22:24:44,952 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 22:24:44,952 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 22:24:44,953 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 22:24:44,953 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 22:24:44,953 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 22:24:44,954 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 22:24:44,954 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 22:24:44,960 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 22:24:44,960 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 22:24:44,960 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 22:24:44,961 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 22:24:44,961 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 22:24:44,961 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 22:24:44,961 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 22:24:44,962 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 22:24:44,962 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 22:24:44,962 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 22:24:44,962 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 22:24:44,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 22:24:44,963 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 22:24:44,963 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 22:24:44,963 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 22:24:44,964 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 22:24:44,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 22:24:44,966 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 22:24:44,966 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 22:24:44,967 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 22:24:44,967 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 22:24:44,967 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 22:24:44,967 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-20 22:24:45,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 22:24:45,164 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 22:24:45,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 22:24:45,167 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 22:24:45,167 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 22:24:45,168 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-76.i [2023-12-20 22:24:46,135 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 22:24:46,286 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 22:24:46,287 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-76.i [2023-12-20 22:24:46,292 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2822d362/d13e6327f5dd4a9e997378e3170b6a81/FLAGa683d3aca [2023-12-20 22:24:46,301 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2822d362/d13e6327f5dd4a9e997378e3170b6a81 [2023-12-20 22:24:46,303 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 22:24:46,303 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 22:24:46,304 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 22:24:46,304 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 22:24:46,307 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 22:24:46,308 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 10:24:46" (1/1) ... [2023-12-20 22:24:46,308 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53b0f7a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:24:46, skipping insertion in model container [2023-12-20 22:24:46,308 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 10:24:46" (1/1) ... [2023-12-20 22:24:46,331 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 22:24:46,416 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-76.i[916,929] [2023-12-20 22:24:46,441 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 22:24:46,449 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 22:24:46,456 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-76.i[916,929] [2023-12-20 22:24:46,470 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 22:24:46,484 INFO L206 MainTranslator]: Completed translation [2023-12-20 22:24:46,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:24:46 WrapperNode [2023-12-20 22:24:46,486 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 22:24:46,488 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 22:24:46,488 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 22:24:46,488 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 22:24:46,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:24:46" (1/1) ... [2023-12-20 22:24:46,508 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:24:46" (1/1) ... [2023-12-20 22:24:46,528 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 112 [2023-12-20 22:24:46,528 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 22:24:46,529 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 22:24:46,529 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 22:24:46,529 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 22:24:46,536 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:24:46" (1/1) ... [2023-12-20 22:24:46,536 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:24:46" (1/1) ... [2023-12-20 22:24:46,537 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:24:46" (1/1) ... [2023-12-20 22:24:46,546 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-20 22:24:46,546 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:24:46" (1/1) ... [2023-12-20 22:24:46,547 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:24:46" (1/1) ... [2023-12-20 22:24:46,550 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:24:46" (1/1) ... [2023-12-20 22:24:46,552 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:24:46" (1/1) ... [2023-12-20 22:24:46,552 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:24:46" (1/1) ... [2023-12-20 22:24:46,553 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:24:46" (1/1) ... [2023-12-20 22:24:46,555 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 22:24:46,555 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 22:24:46,555 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 22:24:46,555 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 22:24:46,556 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:24:46" (1/1) ... [2023-12-20 22:24:46,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 22:24:46,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 22:24:46,601 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-20 22:24:46,620 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-20 22:24:46,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 22:24:46,625 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-20 22:24:46,625 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-20 22:24:46,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 22:24:46,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 22:24:46,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 22:24:46,674 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 22:24:46,676 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 22:24:46,848 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 22:24:46,895 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 22:24:46,895 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-20 22:24:46,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 10:24:46 BoogieIcfgContainer [2023-12-20 22:24:46,896 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 22:24:46,897 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 22:24:46,897 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 22:24:46,899 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 22:24:46,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 10:24:46" (1/3) ... [2023-12-20 22:24:46,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73613072 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 10:24:46, skipping insertion in model container [2023-12-20 22:24:46,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:24:46" (2/3) ... [2023-12-20 22:24:46,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73613072 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 10:24:46, skipping insertion in model container [2023-12-20 22:24:46,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 10:24:46" (3/3) ... [2023-12-20 22:24:46,901 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-76.i [2023-12-20 22:24:46,919 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 22:24:46,920 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 22:24:46,959 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 22:24:46,964 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;@23359019, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 22:24:46,965 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 22:24:46,968 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 28 states have internal predecessors, (40), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-20 22:24:46,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-20 22:24:46,985 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:24:46,985 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 22:24:46,986 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:24:46,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:24:46,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1050963903, now seen corresponding path program 1 times [2023-12-20 22:24:46,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:24:46,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379838611] [2023-12-20 22:24:46,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:24:46,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:24:47,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:24:47,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:24:47,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:24:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:24:47,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:24:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 22:24:47,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 22:24:47,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 22:24:47,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 22:24:47,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 22:24:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 22:24:47,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 22:24:47,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 22:24:47,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 22:24:47,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 22:24:47,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 22:24:47,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,275 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-20 22:24:47,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:24:47,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379838611] [2023-12-20 22:24:47,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379838611] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:24:47,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:24:47,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 22:24:47,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416067428] [2023-12-20 22:24:47,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:24:47,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-20 22:24:47,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:24:47,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-20 22:24:47,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 22:24:47,315 INFO L87 Difference]: Start difference. First operand has 46 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 28 states have internal predecessors, (40), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-20 22:24:47,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:24:47,358 INFO L93 Difference]: Finished difference Result 89 states and 158 transitions. [2023-12-20 22:24:47,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-20 22:24:47,363 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 98 [2023-12-20 22:24:47,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:24:47,368 INFO L225 Difference]: With dead ends: 89 [2023-12-20 22:24:47,369 INFO L226 Difference]: Without dead ends: 44 [2023-12-20 22:24:47,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 22:24:47,374 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 22:24:47,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 22:24:47,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-20 22:24:47,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-12-20 22:24:47,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-20 22:24:47,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 66 transitions. [2023-12-20 22:24:47,405 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 66 transitions. Word has length 98 [2023-12-20 22:24:47,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:24:47,405 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 66 transitions. [2023-12-20 22:24:47,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-20 22:24:47,405 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 66 transitions. [2023-12-20 22:24:47,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-20 22:24:47,408 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:24:47,408 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 22:24:47,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 22:24:47,408 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:24:47,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:24:47,409 INFO L85 PathProgramCache]: Analyzing trace with hash 172728307, now seen corresponding path program 1 times [2023-12-20 22:24:47,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:24:47,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814961475] [2023-12-20 22:24:47,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:24:47,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:24:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:24:47,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:24:47,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:24:47,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:24:47,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:24:47,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 22:24:47,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 22:24:47,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 22:24:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 22:24:47,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 22:24:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 22:24:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 22:24:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 22:24:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 22:24:47,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 22:24:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 22:24:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,580 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-20 22:24:47,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:24:47,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814961475] [2023-12-20 22:24:47,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814961475] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:24:47,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:24:47,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 22:24:47,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922865152] [2023-12-20 22:24:47,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:24:47,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 22:24:47,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:24:47,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 22:24:47,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 22:24:47,582 INFO L87 Difference]: Start difference. First operand 44 states and 66 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-20 22:24:47,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:24:47,596 INFO L93 Difference]: Finished difference Result 87 states and 131 transitions. [2023-12-20 22:24:47,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 22:24:47,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 99 [2023-12-20 22:24:47,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:24:47,597 INFO L225 Difference]: With dead ends: 87 [2023-12-20 22:24:47,598 INFO L226 Difference]: Without dead ends: 44 [2023-12-20 22:24:47,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 22:24:47,599 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 15 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 22:24:47,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 107 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 22:24:47,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-20 22:24:47,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-12-20 22:24:47,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-20 22:24:47,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2023-12-20 22:24:47,605 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 65 transitions. Word has length 99 [2023-12-20 22:24:47,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:24:47,606 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 65 transitions. [2023-12-20 22:24:47,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-20 22:24:47,606 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2023-12-20 22:24:47,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-20 22:24:47,607 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:24:47,607 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 22:24:47,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 22:24:47,607 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:24:47,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:24:47,608 INFO L85 PathProgramCache]: Analyzing trace with hash 852786677, now seen corresponding path program 1 times [2023-12-20 22:24:47,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:24:47,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994486804] [2023-12-20 22:24:47,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:24:47,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:24:47,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:24:47,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:24:47,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:24:47,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:24:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:24:47,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 22:24:47,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 22:24:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 22:24:47,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 22:24:47,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 22:24:47,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 22:24:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 22:24:47,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 22:24:47,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 22:24:47,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 22:24:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 22:24:47,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,693 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-20 22:24:47,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:24:47,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994486804] [2023-12-20 22:24:47,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994486804] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:24:47,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:24:47,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 22:24:47,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144783580] [2023-12-20 22:24:47,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:24:47,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 22:24:47,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:24:47,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 22:24:47,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 22:24:47,695 INFO L87 Difference]: Start difference. First operand 44 states and 65 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-20 22:24:47,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:24:47,709 INFO L93 Difference]: Finished difference Result 87 states and 129 transitions. [2023-12-20 22:24:47,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 22:24:47,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 99 [2023-12-20 22:24:47,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:24:47,711 INFO L225 Difference]: With dead ends: 87 [2023-12-20 22:24:47,711 INFO L226 Difference]: Without dead ends: 44 [2023-12-20 22:24:47,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 22:24:47,712 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 7 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 22:24:47,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 110 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 22:24:47,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-20 22:24:47,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-12-20 22:24:47,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-20 22:24:47,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2023-12-20 22:24:47,718 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 64 transitions. Word has length 99 [2023-12-20 22:24:47,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:24:47,718 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 64 transitions. [2023-12-20 22:24:47,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-20 22:24:47,718 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2023-12-20 22:24:47,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-20 22:24:47,719 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:24:47,719 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 22:24:47,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-20 22:24:47,720 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:24:47,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:24:47,720 INFO L85 PathProgramCache]: Analyzing trace with hash 419911842, now seen corresponding path program 1 times [2023-12-20 22:24:47,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:24:47,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566091420] [2023-12-20 22:24:47,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:24:47,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:24:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:24:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:24:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:24:47,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:24:47,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:24:47,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 22:24:47,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 22:24:47,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 22:24:47,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 22:24:47,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 22:24:47,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 22:24:47,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 22:24:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 22:24:47,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 22:24:47,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 22:24:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 22:24:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:47,785 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-20 22:24:47,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:24:47,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566091420] [2023-12-20 22:24:47,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566091420] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:24:47,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:24:47,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 22:24:47,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821687171] [2023-12-20 22:24:47,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:24:47,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 22:24:47,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:24:47,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 22:24:47,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 22:24:47,787 INFO L87 Difference]: Start difference. First operand 44 states and 64 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-20 22:24:47,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:24:47,839 INFO L93 Difference]: Finished difference Result 126 states and 183 transitions. [2023-12-20 22:24:47,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 22:24:47,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 100 [2023-12-20 22:24:47,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:24:47,844 INFO L225 Difference]: With dead ends: 126 [2023-12-20 22:24:47,844 INFO L226 Difference]: Without dead ends: 83 [2023-12-20 22:24:47,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 22:24:47,848 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 54 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 22:24:47,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 118 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 22:24:47,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-12-20 22:24:47,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 48. [2023-12-20 22:24:47,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-20 22:24:47,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2023-12-20 22:24:47,854 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 100 [2023-12-20 22:24:47,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:24:47,854 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2023-12-20 22:24:47,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-20 22:24:47,854 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2023-12-20 22:24:47,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-20 22:24:47,855 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:24:47,855 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 22:24:47,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-20 22:24:47,859 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:24:47,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:24:47,859 INFO L85 PathProgramCache]: Analyzing trace with hash 421758884, now seen corresponding path program 1 times [2023-12-20 22:24:47,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:24:47,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663945599] [2023-12-20 22:24:47,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:24:47,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:24:47,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:49,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:24:49,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:49,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:24:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:49,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:24:49,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:49,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:24:49,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:49,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:24:49,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:49,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 22:24:49,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:49,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 22:24:49,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:49,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 22:24:49,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:49,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 22:24:49,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:49,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 22:24:49,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:49,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 22:24:49,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:49,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 22:24:49,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:49,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 22:24:49,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:49,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 22:24:49,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:49,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 22:24:49,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:49,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 22:24:49,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:49,075 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-20 22:24:49,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:24:49,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663945599] [2023-12-20 22:24:49,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663945599] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:24:49,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:24:49,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-20 22:24:49,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817520341] [2023-12-20 22:24:49,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:24:49,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 22:24:49,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:24:49,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 22:24:49,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-20 22:24:49,079 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-20 22:24:49,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:24:49,308 INFO L93 Difference]: Finished difference Result 129 states and 174 transitions. [2023-12-20 22:24:49,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-20 22:24:49,309 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 100 [2023-12-20 22:24:49,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:24:49,311 INFO L225 Difference]: With dead ends: 129 [2023-12-20 22:24:49,311 INFO L226 Difference]: Without dead ends: 82 [2023-12-20 22:24:49,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2023-12-20 22:24:49,317 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 65 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 22:24:49,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 188 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 22:24:49,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-12-20 22:24:49,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 70. [2023-12-20 22:24:49,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.1875) internal successors, (57), 49 states have internal predecessors, (57), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-20 22:24:49,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 93 transitions. [2023-12-20 22:24:49,337 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 93 transitions. Word has length 100 [2023-12-20 22:24:49,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:24:49,337 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 93 transitions. [2023-12-20 22:24:49,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-20 22:24:49,338 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 93 transitions. [2023-12-20 22:24:49,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-20 22:24:49,339 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:24:49,339 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 22:24:49,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-20 22:24:49,339 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:24:49,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:24:49,339 INFO L85 PathProgramCache]: Analyzing trace with hash 122889787, now seen corresponding path program 1 times [2023-12-20 22:24:49,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:24:49,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730725980] [2023-12-20 22:24:49,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:24:49,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:24:49,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:49,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:24:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:49,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:24:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:49,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:24:49,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:49,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:24:49,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:49,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:24:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:49,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 22:24:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:49,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 22:24:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:49,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 22:24:49,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:49,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 22:24:49,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:49,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 22:24:49,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:49,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 22:24:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:49,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 22:24:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:49,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 22:24:49,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:49,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 22:24:49,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:49,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 22:24:49,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:49,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 22:24:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:49,634 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-12-20 22:24:49,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:24:49,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730725980] [2023-12-20 22:24:49,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730725980] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 22:24:49,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153538107] [2023-12-20 22:24:49,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:24:49,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 22:24:49,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 22:24:49,637 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-20 22:24:49,664 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-20 22:24:49,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:49,704 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-20 22:24:49,711 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 22:24:49,834 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 225 proven. 30 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2023-12-20 22:24:49,834 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 22:24:49,961 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-12-20 22:24:49,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153538107] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 22:24:49,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 22:24:49,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2023-12-20 22:24:49,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509747454] [2023-12-20 22:24:49,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 22:24:49,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-20 22:24:49,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:24:49,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-20 22:24:49,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-20 22:24:49,964 INFO L87 Difference]: Start difference. First operand 70 states and 93 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2023-12-20 22:24:50,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:24:50,242 INFO L93 Difference]: Finished difference Result 180 states and 235 transitions. [2023-12-20 22:24:50,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-20 22:24:50,242 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 101 [2023-12-20 22:24:50,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:24:50,244 INFO L225 Difference]: With dead ends: 180 [2023-12-20 22:24:50,244 INFO L226 Difference]: Without dead ends: 111 [2023-12-20 22:24:50,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 229 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2023-12-20 22:24:50,245 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 70 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 22:24:50,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 146 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 22:24:50,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-12-20 22:24:50,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 65. [2023-12-20 22:24:50,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 43 states have internal predecessors, (44), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-20 22:24:50,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2023-12-20 22:24:50,258 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 101 [2023-12-20 22:24:50,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:24:50,258 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions. [2023-12-20 22:24:50,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2023-12-20 22:24:50,258 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2023-12-20 22:24:50,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-20 22:24:50,259 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:24:50,259 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 22:24:50,267 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-20 22:24:50,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-20 22:24:50,468 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:24:50,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:24:50,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1142419405, now seen corresponding path program 1 times [2023-12-20 22:24:50,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:24:50,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362514216] [2023-12-20 22:24:50,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:24:50,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:24:50,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:51,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:24:51,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:51,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:24:51,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:51,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:24:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:51,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:24:51,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:51,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:24:51,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:51,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 22:24:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:51,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 22:24:51,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:51,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 22:24:51,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:51,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 22:24:51,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:51,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 22:24:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:51,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 22:24:51,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:51,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 22:24:51,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:51,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 22:24:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:51,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 22:24:51,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:51,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 22:24:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:51,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 22:24:51,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:24:51,067 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-20 22:24:51,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:24:51,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362514216] [2023-12-20 22:24:51,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362514216] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:24:51,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:24:51,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-20 22:24:51,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662578010] [2023-12-20 22:24:51,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:24:51,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 22:24:51,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:24:51,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 22:24:51,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-20 22:24:51,068 INFO L87 Difference]: Start difference. First operand 65 states and 80 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-20 22:24:51,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:24:51,169 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2023-12-20 22:24:51,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-20 22:24:51,170 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 101 [2023-12-20 22:24:51,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:24:51,170 INFO L225 Difference]: With dead ends: 77 [2023-12-20 22:24:51,170 INFO L226 Difference]: Without dead ends: 0 [2023-12-20 22:24:51,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2023-12-20 22:24:51,171 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 48 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 22:24:51,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 151 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 22:24:51,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-20 22:24:51,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-20 22:24:51,172 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-20 22:24:51,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-20 22:24:51,172 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 101 [2023-12-20 22:24:51,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:24:51,172 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-20 22:24:51,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-20 22:24:51,172 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-20 22:24:51,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-20 22:24:51,174 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-20 22:24:51,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-20 22:24:51,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-20 22:24:51,536 INFO L895 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: (= ~var_1_5~0 (* (div ~var_1_5~0 256) 256)) [2023-12-20 22:24:51,537 INFO L895 garLoopResultBuilder]: At program point L85-1(line 85) the Hoare annotation is: (= ~var_1_5~0 (* (div ~var_1_5~0 256) 256)) [2023-12-20 22:24:51,537 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-20 22:24:51,537 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-20 22:24:51,537 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-20 22:24:51,537 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-12-20 22:24:51,537 INFO L895 garLoopResultBuilder]: At program point L94(line 94) the Hoare annotation is: (= ~var_1_5~0 (* (div ~var_1_5~0 256) 256)) [2023-12-20 22:24:51,537 INFO L895 garLoopResultBuilder]: At program point L94-1(line 94) the Hoare annotation is: (= ~var_1_5~0 (* (div ~var_1_5~0 256) 256)) [2023-12-20 22:24:51,537 INFO L899 garLoopResultBuilder]: For program point L86(line 86) no Hoare annotation was computed. [2023-12-20 22:24:51,537 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 70) no Hoare annotation was computed. [2023-12-20 22:24:51,537 INFO L899 garLoopResultBuilder]: For program point L95(lines 71 96) no Hoare annotation was computed. [2023-12-20 22:24:51,537 INFO L899 garLoopResultBuilder]: For program point L62(lines 62 66) no Hoare annotation was computed. [2023-12-20 22:24:51,537 INFO L902 garLoopResultBuilder]: At program point L79(line 79) the Hoare annotation is: true [2023-12-20 22:24:51,537 INFO L902 garLoopResultBuilder]: At program point L79-1(line 79) the Hoare annotation is: true [2023-12-20 22:24:51,538 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-20 22:24:51,538 INFO L895 garLoopResultBuilder]: At program point L88(line 88) the Hoare annotation is: (= ~var_1_5~0 (* (div ~var_1_5~0 256) 256)) [2023-12-20 22:24:51,538 INFO L895 garLoopResultBuilder]: At program point L88-1(line 88) the Hoare annotation is: (= ~var_1_5~0 (* (div ~var_1_5~0 256) 256)) [2023-12-20 22:24:51,538 INFO L899 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2023-12-20 22:24:51,538 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 53) no Hoare annotation was computed. [2023-12-20 22:24:51,538 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 43) no Hoare annotation was computed. [2023-12-20 22:24:51,538 INFO L899 garLoopResultBuilder]: For program point L39-2(lines 37 70) no Hoare annotation was computed. [2023-12-20 22:24:51,538 INFO L899 garLoopResultBuilder]: For program point L89(line 89) no Hoare annotation was computed. [2023-12-20 22:24:51,538 INFO L899 garLoopResultBuilder]: For program point L56(lines 56 60) no Hoare annotation was computed. [2023-12-20 22:24:51,538 INFO L899 garLoopResultBuilder]: For program point L56-1(lines 37 70) no Hoare annotation was computed. [2023-12-20 22:24:51,538 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (and (= ~var_1_5~0 (* (div ~var_1_5~0 256) 256)) (or (let ((.cse3 (+ 240 ~var_1_11~0))) (let ((.cse1 (* 256 (div .cse3 256)))) (let ((.cse2 (+ 112 ~var_1_11~0)) (.cse0 (= .cse3 (+ .cse1 ~var_1_8~0)))) (and (or .cse0 (and (= (+ .cse1 16 ~var_1_8~0) ~var_1_11~0) (<= .cse1 .cse2))) (or (< .cse2 .cse1) (not .cse0)))))) (not (= ~var_1_4~0 ~var_1_10~0)))) [2023-12-20 22:24:51,539 INFO L895 garLoopResultBuilder]: At program point L73-1(line 73) the Hoare annotation is: (and (= ~var_1_5~0 (* (div ~var_1_5~0 256) 256)) (or (let ((.cse3 (+ 240 ~var_1_11~0))) (let ((.cse1 (* 256 (div .cse3 256)))) (let ((.cse2 (+ 112 ~var_1_11~0)) (.cse0 (= .cse3 (+ .cse1 ~var_1_8~0)))) (and (or .cse0 (and (= (+ .cse1 16 ~var_1_8~0) ~var_1_11~0) (<= .cse1 .cse2))) (or (< .cse2 .cse1) (not .cse0)))))) (not (= ~var_1_4~0 ~var_1_10~0)))) [2023-12-20 22:24:51,539 INFO L899 garLoopResultBuilder]: For program point L57(lines 57 59) no Hoare annotation was computed. [2023-12-20 22:24:51,539 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-20 22:24:51,539 INFO L895 garLoopResultBuilder]: At program point L82(line 82) the Hoare annotation is: (= ~var_1_5~0 (* (div ~var_1_5~0 256) 256)) [2023-12-20 22:24:51,539 INFO L895 garLoopResultBuilder]: At program point L82-1(line 82) the Hoare annotation is: (= ~var_1_5~0 (* (div ~var_1_5~0 256) 256)) [2023-12-20 22:24:51,539 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2023-12-20 22:24:51,539 INFO L895 garLoopResultBuilder]: At program point L107-2(lines 107 113) the Hoare annotation is: (and (= ~var_1_5~0 (* (div ~var_1_5~0 256) 256)) (or (let ((.cse3 (+ 240 ~var_1_11~0))) (let ((.cse1 (* 256 (div .cse3 256)))) (let ((.cse2 (+ 112 ~var_1_11~0)) (.cse0 (= .cse3 (+ .cse1 ~var_1_8~0)))) (and (or .cse0 (and (= (+ .cse1 16 ~var_1_8~0) ~var_1_11~0) (<= .cse1 .cse2))) (or (< .cse2 .cse1) (not .cse0)))))) (not (= ~var_1_4~0 ~var_1_10~0)))) [2023-12-20 22:24:51,539 INFO L899 garLoopResultBuilder]: For program point L107-3(lines 107 113) no Hoare annotation was computed. [2023-12-20 22:24:51,539 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-20 22:24:51,539 INFO L895 garLoopResultBuilder]: At program point L91(line 91) the Hoare annotation is: (= ~var_1_5~0 (* (div ~var_1_5~0 256) 256)) [2023-12-20 22:24:51,539 INFO L895 garLoopResultBuilder]: At program point L91-1(line 91) the Hoare annotation is: (= ~var_1_5~0 (* (div ~var_1_5~0 256) 256)) [2023-12-20 22:24:51,539 INFO L899 garLoopResultBuilder]: For program point L83(line 83) no Hoare annotation was computed. [2023-12-20 22:24:51,540 INFO L899 garLoopResultBuilder]: For program point L50(lines 50 52) no Hoare annotation was computed. [2023-12-20 22:24:51,540 INFO L899 garLoopResultBuilder]: For program point L50-2(lines 44 54) no Hoare annotation was computed. [2023-12-20 22:24:51,540 INFO L899 garLoopResultBuilder]: For program point L92(line 92) no Hoare annotation was computed. [2023-12-20 22:24:51,540 INFO L895 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: (= ~var_1_5~0 (* (div ~var_1_5~0 256) 256)) [2023-12-20 22:24:51,540 INFO L895 garLoopResultBuilder]: At program point L76-1(line 76) the Hoare annotation is: (= ~var_1_5~0 (* (div ~var_1_5~0 256) 256)) [2023-12-20 22:24:51,540 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-20 22:24:51,540 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-20 22:24:51,540 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-20 22:24:51,540 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-20 22:24:51,542 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-12-20 22:24:51,544 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 22:24:51,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 10:24:51 BoogieIcfgContainer [2023-12-20 22:24:51,552 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 22:24:51,552 INFO L158 Benchmark]: Toolchain (without parser) took 5248.55ms. Allocated memory was 285.2MB in the beginning and 371.2MB in the end (delta: 86.0MB). Free memory was 244.2MB in the beginning and 127.9MB in the end (delta: 116.3MB). Peak memory consumption was 203.3MB. Max. memory is 8.0GB. [2023-12-20 22:24:51,552 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 190.8MB. Free memory is still 145.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 22:24:51,552 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.83ms. Allocated memory is still 285.2MB. Free memory was 243.7MB in the beginning and 231.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-20 22:24:51,552 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.64ms. Allocated memory is still 285.2MB. Free memory was 231.1MB in the beginning and 229.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-20 22:24:51,553 INFO L158 Benchmark]: Boogie Preprocessor took 25.99ms. Allocated memory is still 285.2MB. Free memory was 229.0MB in the beginning and 226.4MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-20 22:24:51,553 INFO L158 Benchmark]: RCFGBuilder took 340.59ms. Allocated memory is still 285.2MB. Free memory was 226.4MB in the beginning and 209.1MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-20 22:24:51,553 INFO L158 Benchmark]: TraceAbstraction took 4654.38ms. Allocated memory was 285.2MB in the beginning and 371.2MB in the end (delta: 86.0MB). Free memory was 208.5MB in the beginning and 127.9MB in the end (delta: 80.7MB). Peak memory consumption was 167.6MB. Max. memory is 8.0GB. [2023-12-20 22:24:51,554 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.09ms. Allocated memory is still 190.8MB. Free memory is still 145.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 182.83ms. Allocated memory is still 285.2MB. Free memory was 243.7MB in the beginning and 231.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.64ms. Allocated memory is still 285.2MB. Free memory was 231.1MB in the beginning and 229.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.99ms. Allocated memory is still 285.2MB. Free memory was 229.0MB in the beginning and 226.4MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 340.59ms. Allocated memory is still 285.2MB. Free memory was 226.4MB in the beginning and 209.1MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 4654.38ms. Allocated memory was 285.2MB in the beginning and 371.2MB in the end (delta: 86.0MB). Free memory was 208.5MB in the beginning and 127.9MB in the end (delta: 80.7MB). Peak memory consumption was 167.6MB. 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, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 7, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 278 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 259 mSDsluCounter, 883 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 460 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 441 IncrementalHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 423 mSDtfsCounter, 441 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 489 GetRequests, 453 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=5, InterpolantAutomatonStates: 44, 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, 7 MinimizatonAttempts, 93 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 135 PreInvPairs, 158 NumberOfFragments, 321 HoareAnnotationTreeSize, 135 FormulaSimplifications, 2305 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 18 FormulaSimplificationsInter, 3581 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 799 NumberOfCodeBlocks, 799 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 891 ConstructedInterpolants, 0 QuantifiedInterpolants, 2914 SizeOfPredicates, 4 NumberOfNonLiveVariables, 238 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 4230/4320 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: 107]: Loop Invariant Derived loop invariant: ((var_1_5 == ((var_1_5 / 256) * 256)) && (((((240 + var_1_11) == ((256 * ((240 + var_1_11) / 256)) + var_1_8)) || (((((256 * ((240 + var_1_11) / 256)) + 16) + var_1_8) == var_1_11) && ((256 * ((240 + var_1_11) / 256)) <= (112 + var_1_11)))) && (((112 + var_1_11) < (256 * ((240 + var_1_11) / 256))) || !(((240 + var_1_11) == ((256 * ((240 + var_1_11) / 256)) + var_1_8))))) || !((var_1_4 == var_1_10)))) RESULT: Ultimate proved your program to be correct! [2023-12-20 22:24:51,597 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...