/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_variablewrapping_normal_file-32.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 01:32:58,395 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 01:32:58,456 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-21 01:32:58,459 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 01:32:58,460 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 01:32:58,486 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 01:32:58,486 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 01:32:58,487 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 01:32:58,487 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 01:32:58,487 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 01:32:58,487 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 01:32:58,491 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 01:32:58,491 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 01:32:58,494 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 01:32:58,494 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 01:32:58,494 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 01:32:58,495 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 01:32:58,496 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 01:32:58,496 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 01:32:58,496 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 01:32:58,496 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 01:32:58,497 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 01:32:58,497 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 01:32:58,497 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 01:32:58,497 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 01:32:58,497 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 01:32:58,497 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 01:32:58,497 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 01:32:58,498 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 01:32:58,498 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 01:32:58,499 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 01:32:58,499 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 01:32:58,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 01:32:58,499 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 01:32:58,499 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 01:32:58,500 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 01:32:58,500 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 01:32:58,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 01:32:58,500 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 01:32:58,500 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 01:32:58,500 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 01:32:58,500 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 01:32:58,500 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 01:32:58,501 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-21 01:32:58,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 01:32:58,726 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 01:32:58,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 01:32:58,728 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 01:32:58,729 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 01:32:58,730 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_normal_file-32.i [2023-12-21 01:32:59,944 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 01:33:00,078 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 01:33:00,078 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_normal_file-32.i [2023-12-21 01:33:00,094 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbf496837/bebd5bb8b0ea4e228d8ea9112a7ce929/FLAG525fb50a0 [2023-12-21 01:33:00,488 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbf496837/bebd5bb8b0ea4e228d8ea9112a7ce929 [2023-12-21 01:33:00,493 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 01:33:00,494 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 01:33:00,496 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 01:33:00,504 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 01:33:00,508 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 01:33:00,509 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 01:33:00" (1/1) ... [2023-12-21 01:33:00,509 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19e98202 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:33:00, skipping insertion in model container [2023-12-21 01:33:00,509 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 01:33:00" (1/1) ... [2023-12-21 01:33:00,549 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 01:33:00,732 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_variablewrapping_normal_file-32.i[913,926] [2023-12-21 01:33:00,764 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 01:33:00,774 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 01:33:00,782 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_variablewrapping_normal_file-32.i[913,926] [2023-12-21 01:33:00,803 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 01:33:00,823 INFO L206 MainTranslator]: Completed translation [2023-12-21 01:33:00,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:33:00 WrapperNode [2023-12-21 01:33:00,823 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 01:33:00,824 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 01:33:00,824 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 01:33:00,824 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 01:33:00,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:33:00" (1/1) ... [2023-12-21 01:33:00,838 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:33:00" (1/1) ... [2023-12-21 01:33:00,878 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2023-12-21 01:33:00,878 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 01:33:00,879 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 01:33:00,879 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 01:33:00,879 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 01:33:00,886 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:33:00" (1/1) ... [2023-12-21 01:33:00,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:33:00" (1/1) ... [2023-12-21 01:33:00,888 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:33:00" (1/1) ... [2023-12-21 01:33:00,898 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-21 01:33:00,898 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:33:00" (1/1) ... [2023-12-21 01:33:00,898 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:33:00" (1/1) ... [2023-12-21 01:33:00,902 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:33:00" (1/1) ... [2023-12-21 01:33:00,917 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:33:00" (1/1) ... [2023-12-21 01:33:00,918 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:33:00" (1/1) ... [2023-12-21 01:33:00,919 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:33:00" (1/1) ... [2023-12-21 01:33:00,921 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 01:33:00,921 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 01:33:00,921 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 01:33:00,921 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 01:33:00,922 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:33:00" (1/1) ... [2023-12-21 01:33:00,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 01:33:00,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:33:00,952 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-21 01:33:00,973 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-21 01:33:00,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 01:33:00,987 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 01:33:00,988 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 01:33:00,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 01:33:00,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 01:33:00,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 01:33:01,048 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 01:33:01,050 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 01:33:01,226 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 01:33:01,255 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 01:33:01,255 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 01:33:01,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:33:01 BoogieIcfgContainer [2023-12-21 01:33:01,256 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 01:33:01,257 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 01:33:01,258 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 01:33:01,260 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 01:33:01,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 01:33:00" (1/3) ... [2023-12-21 01:33:01,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63a11824 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 01:33:01, skipping insertion in model container [2023-12-21 01:33:01,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:33:00" (2/3) ... [2023-12-21 01:33:01,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63a11824 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 01:33:01, skipping insertion in model container [2023-12-21 01:33:01,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:33:01" (3/3) ... [2023-12-21 01:33:01,273 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-32.i [2023-12-21 01:33:01,284 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 01:33:01,285 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 01:33:01,318 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 01:33:01,322 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;@31d2e19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 01:33:01,323 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 01:33:01,325 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-21 01:33:01,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-21 01:33:01,333 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:33:01,333 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:33:01,334 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:33:01,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:33:01,337 INFO L85 PathProgramCache]: Analyzing trace with hash 887830059, now seen corresponding path program 1 times [2023-12-21 01:33:01,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:33:01,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306480577] [2023-12-21 01:33:01,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:33:01,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:33:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:01,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:33:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:01,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 01:33:01,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:01,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-21 01:33:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:01,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-21 01:33:01,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:01,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-21 01:33:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:01,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:33:01,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:01,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:33:01,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:01,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-21 01:33:01,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:01,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-21 01:33:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:01,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-21 01:33:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:01,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-21 01:33:01,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:01,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:33:01,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:01,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:33:01,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:01,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-21 01:33:01,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:01,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-21 01:33:01,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:01,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-21 01:33:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:01,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-21 01:33:01,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:01,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 01:33:01,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:01,850 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-21 01:33:01,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:33:01,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306480577] [2023-12-21 01:33:01,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306480577] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:33:01,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:33:01,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 01:33:01,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591087898] [2023-12-21 01:33:01,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:33:01,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 01:33:01,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:33:01,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 01:33:01,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:33:01,882 INFO L87 Difference]: Start difference. First operand has 49 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-21 01:33:02,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:33:02,028 INFO L93 Difference]: Finished difference Result 95 states and 168 transitions. [2023-12-21 01:33:02,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 01:33:02,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 109 [2023-12-21 01:33:02,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:33:02,036 INFO L225 Difference]: With dead ends: 95 [2023-12-21 01:33:02,036 INFO L226 Difference]: Without dead ends: 47 [2023-12-21 01:33:02,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:33:02,041 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 54 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:33:02,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 65 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:33:02,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-21 01:33:02,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-12-21 01:33:02,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-21 01:33:02,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 70 transitions. [2023-12-21 01:33:02,089 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 70 transitions. Word has length 109 [2023-12-21 01:33:02,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:33:02,091 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 70 transitions. [2023-12-21 01:33:02,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-21 01:33:02,091 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 70 transitions. [2023-12-21 01:33:02,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-21 01:33:02,095 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:33:02,096 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:33:02,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 01:33:02,096 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:33:02,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:33:02,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1697176685, now seen corresponding path program 1 times [2023-12-21 01:33:02,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:33:02,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708046379] [2023-12-21 01:33:02,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:33:02,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:33:02,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:06,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:33:06,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:06,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 01:33:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:06,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-21 01:33:06,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:06,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-21 01:33:06,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:06,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-21 01:33:06,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:06,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:33:06,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:06,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:33:06,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:06,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-21 01:33:06,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:06,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-21 01:33:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:06,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-21 01:33:06,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:06,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-21 01:33:06,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:06,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:33:06,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:06,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:33:06,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:06,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-21 01:33:06,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:06,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-21 01:33:06,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:06,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-21 01:33:06,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:06,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-21 01:33:06,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:06,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 01:33:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:06,771 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-21 01:33:06,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:33:06,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708046379] [2023-12-21 01:33:06,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708046379] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:33:06,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:33:06,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-21 01:33:06,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688235772] [2023-12-21 01:33:06,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:33:06,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-21 01:33:06,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:33:06,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-21 01:33:06,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-12-21 01:33:06,774 INFO L87 Difference]: Start difference. First operand 47 states and 70 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2023-12-21 01:33:09,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:33:09,053 INFO L93 Difference]: Finished difference Result 151 states and 213 transitions. [2023-12-21 01:33:09,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-21 01:33:09,054 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 109 [2023-12-21 01:33:09,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:33:09,062 INFO L225 Difference]: With dead ends: 151 [2023-12-21 01:33:09,062 INFO L226 Difference]: Without dead ends: 149 [2023-12-21 01:33:09,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=271, Invalid=851, Unknown=0, NotChecked=0, Total=1122 [2023-12-21 01:33:09,071 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 203 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-21 01:33:09,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 328 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-21 01:33:09,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-12-21 01:33:09,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 73. [2023-12-21 01:33:09,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 47 states have internal predecessors, (58), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-21 01:33:09,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 106 transitions. [2023-12-21 01:33:09,102 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 106 transitions. Word has length 109 [2023-12-21 01:33:09,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:33:09,102 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 106 transitions. [2023-12-21 01:33:09,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2023-12-21 01:33:09,103 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 106 transitions. [2023-12-21 01:33:09,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-21 01:33:09,120 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:33:09,120 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:33:09,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 01:33:09,120 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:33:09,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:33:09,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1057797391, now seen corresponding path program 1 times [2023-12-21 01:33:09,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:33:09,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795229939] [2023-12-21 01:33:09,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:33:09,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:33:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:11,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:33:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:11,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 01:33:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:11,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-21 01:33:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:11,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-21 01:33:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:11,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-21 01:33:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:11,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:33:11,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:11,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:33:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:11,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-21 01:33:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:11,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-21 01:33:11,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:11,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-21 01:33:11,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:11,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-21 01:33:11,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:11,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:33:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:11,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:33:11,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:11,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-21 01:33:11,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:11,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-21 01:33:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:11,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-21 01:33:11,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:11,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-21 01:33:11,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:11,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 01:33:11,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:11,992 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-21 01:33:11,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:33:11,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795229939] [2023-12-21 01:33:11,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795229939] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:33:11,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:33:11,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-21 01:33:11,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204574453] [2023-12-21 01:33:11,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:33:11,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 01:33:11,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:33:11,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 01:33:12,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-21 01:33:12,008 INFO L87 Difference]: Start difference. First operand 73 states and 106 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-21 01:33:12,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:33:12,499 INFO L93 Difference]: Finished difference Result 92 states and 128 transitions. [2023-12-21 01:33:12,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-21 01:33:12,500 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 110 [2023-12-21 01:33:12,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:33:12,504 INFO L225 Difference]: With dead ends: 92 [2023-12-21 01:33:12,504 INFO L226 Difference]: Without dead ends: 90 [2023-12-21 01:33:12,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2023-12-21 01:33:12,505 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 47 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 01:33:12,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 255 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 01:33:12,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-12-21 01:33:12,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 74. [2023-12-21 01:33:12,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 48 states have internal predecessors, (60), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-21 01:33:12,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 108 transitions. [2023-12-21 01:33:12,536 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 108 transitions. Word has length 110 [2023-12-21 01:33:12,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:33:12,536 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 108 transitions. [2023-12-21 01:33:12,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-21 01:33:12,536 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 108 transitions. [2023-12-21 01:33:12,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-21 01:33:12,542 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:33:12,542 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:33:12,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 01:33:12,543 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:33:12,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:33:12,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1577699368, now seen corresponding path program 1 times [2023-12-21 01:33:12,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:33:12,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719345041] [2023-12-21 01:33:12,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:33:12,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:33:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:17,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:33:17,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:17,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 01:33:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:17,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-21 01:33:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:17,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-21 01:33:17,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:17,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-21 01:33:17,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:17,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:33:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:17,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:33:17,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:17,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-21 01:33:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:17,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-21 01:33:17,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:17,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-21 01:33:17,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:17,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-21 01:33:17,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:17,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:33:17,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:17,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:33:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:17,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-21 01:33:17,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:17,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-21 01:33:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:17,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-21 01:33:17,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:17,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-21 01:33:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:17,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 01:33:17,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:17,109 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-21 01:33:17,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:33:17,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719345041] [2023-12-21 01:33:17,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719345041] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:33:17,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:33:17,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-21 01:33:17,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787094124] [2023-12-21 01:33:17,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:33:17,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 01:33:17,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:33:17,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 01:33:17,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-12-21 01:33:17,112 INFO L87 Difference]: Start difference. First operand 74 states and 108 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-21 01:33:17,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:33:17,988 INFO L93 Difference]: Finished difference Result 88 states and 123 transitions. [2023-12-21 01:33:17,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-21 01:33:17,988 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 111 [2023-12-21 01:33:17,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:33:17,991 INFO L225 Difference]: With dead ends: 88 [2023-12-21 01:33:17,991 INFO L226 Difference]: Without dead ends: 86 [2023-12-21 01:33:17,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2023-12-21 01:33:17,994 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 66 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 01:33:17,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 212 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 01:33:17,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-12-21 01:33:18,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 73. [2023-12-21 01:33:18,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 47 states have internal predecessors, (59), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-21 01:33:18,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 107 transitions. [2023-12-21 01:33:18,030 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 107 transitions. Word has length 111 [2023-12-21 01:33:18,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:33:18,031 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 107 transitions. [2023-12-21 01:33:18,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-21 01:33:18,031 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 107 transitions. [2023-12-21 01:33:18,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-21 01:33:18,034 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:33:18,034 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:33:18,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-21 01:33:18,035 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:33:18,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:33:18,036 INFO L85 PathProgramCache]: Analyzing trace with hash 958873527, now seen corresponding path program 1 times [2023-12-21 01:33:18,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:33:18,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036274207] [2023-12-21 01:33:18,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:33:18,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:33:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:19,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:33:19,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:19,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 01:33:19,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:19,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-21 01:33:19,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:19,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-21 01:33:19,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:19,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-21 01:33:19,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:19,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:33:19,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:19,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:33:19,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:19,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-21 01:33:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:19,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-21 01:33:19,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:19,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-21 01:33:19,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:19,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-21 01:33:19,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:19,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:33:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:19,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:33:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:19,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-21 01:33:19,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:19,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-21 01:33:19,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:19,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-21 01:33:19,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:19,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-21 01:33:19,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:19,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 01:33:19,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:19,368 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-21 01:33:19,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:33:19,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036274207] [2023-12-21 01:33:19,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036274207] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:33:19,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:33:19,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-21 01:33:19,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762677750] [2023-12-21 01:33:19,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:33:19,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 01:33:19,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:33:19,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 01:33:19,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-12-21 01:33:19,371 INFO L87 Difference]: Start difference. First operand 73 states and 107 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-21 01:33:19,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:33:19,923 INFO L93 Difference]: Finished difference Result 166 states and 238 transitions. [2023-12-21 01:33:19,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-21 01:33:19,928 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 111 [2023-12-21 01:33:19,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:33:19,929 INFO L225 Difference]: With dead ends: 166 [2023-12-21 01:33:19,929 INFO L226 Difference]: Without dead ends: 94 [2023-12-21 01:33:19,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2023-12-21 01:33:19,930 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 70 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 01:33:19,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 195 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 01:33:19,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-12-21 01:33:19,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 75. [2023-12-21 01:33:19,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 49 states have internal predecessors, (61), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-21 01:33:19,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 109 transitions. [2023-12-21 01:33:19,944 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 109 transitions. Word has length 111 [2023-12-21 01:33:19,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:33:19,944 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 109 transitions. [2023-12-21 01:33:19,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-21 01:33:19,944 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 109 transitions. [2023-12-21 01:33:19,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-21 01:33:19,947 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:33:19,947 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:33:19,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 01:33:19,947 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:33:19,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:33:19,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1016131829, now seen corresponding path program 1 times [2023-12-21 01:33:19,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:33:19,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304086067] [2023-12-21 01:33:19,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:33:19,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:33:19,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:22,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:33:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:22,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 01:33:22,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:22,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-21 01:33:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:22,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-21 01:33:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:22,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-21 01:33:22,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:22,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:33:22,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:22,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:33:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:22,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-21 01:33:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:22,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-21 01:33:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:22,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-21 01:33:22,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:22,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-21 01:33:22,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:22,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:33:22,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:22,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:33:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:22,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-21 01:33:22,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:22,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-21 01:33:22,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:22,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-21 01:33:22,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:22,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-21 01:33:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:22,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 01:33:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:22,342 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-21 01:33:22,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:33:22,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304086067] [2023-12-21 01:33:22,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304086067] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:33:22,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:33:22,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-21 01:33:22,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784834017] [2023-12-21 01:33:22,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:33:22,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 01:33:22,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:33:22,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 01:33:22,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-21 01:33:22,343 INFO L87 Difference]: Start difference. First operand 75 states and 109 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-21 01:33:22,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:33:22,784 INFO L93 Difference]: Finished difference Result 102 states and 137 transitions. [2023-12-21 01:33:22,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-21 01:33:22,785 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 111 [2023-12-21 01:33:22,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:33:22,786 INFO L225 Difference]: With dead ends: 102 [2023-12-21 01:33:22,786 INFO L226 Difference]: Without dead ends: 100 [2023-12-21 01:33:22,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2023-12-21 01:33:22,787 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 41 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 01:33:22,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 216 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 01:33:22,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-12-21 01:33:22,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 73. [2023-12-21 01:33:22,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 47 states have internal predecessors, (58), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-21 01:33:22,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 106 transitions. [2023-12-21 01:33:22,798 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 106 transitions. Word has length 111 [2023-12-21 01:33:22,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:33:22,798 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 106 transitions. [2023-12-21 01:33:22,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-21 01:33:22,799 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 106 transitions. [2023-12-21 01:33:22,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-21 01:33:22,799 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:33:22,799 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:33:22,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-21 01:33:22,800 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:33:22,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:33:22,800 INFO L85 PathProgramCache]: Analyzing trace with hash -354764027, now seen corresponding path program 1 times [2023-12-21 01:33:22,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:33:22,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137799755] [2023-12-21 01:33:22,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:33:22,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:33:22,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:24,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:33:24,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:24,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 01:33:24,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:24,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-21 01:33:24,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:24,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-21 01:33:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:24,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-21 01:33:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:24,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:33:24,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:24,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:33:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:24,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-21 01:33:24,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:24,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-21 01:33:24,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:24,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-21 01:33:24,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:24,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-21 01:33:24,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:24,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:33:24,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:24,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:33:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:24,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-21 01:33:24,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:24,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-21 01:33:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:24,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-21 01:33:24,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:24,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-21 01:33:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:24,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 01:33:24,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:24,068 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-21 01:33:24,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:33:24,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137799755] [2023-12-21 01:33:24,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137799755] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:33:24,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:33:24,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-21 01:33:24,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816554388] [2023-12-21 01:33:24,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:33:24,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-21 01:33:24,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:33:24,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-21 01:33:24,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-12-21 01:33:24,070 INFO L87 Difference]: Start difference. First operand 73 states and 106 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-21 01:33:25,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:33:25,816 INFO L93 Difference]: Finished difference Result 90 states and 123 transitions. [2023-12-21 01:33:25,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-21 01:33:25,817 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 112 [2023-12-21 01:33:25,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:33:25,818 INFO L225 Difference]: With dead ends: 90 [2023-12-21 01:33:25,818 INFO L226 Difference]: Without dead ends: 88 [2023-12-21 01:33:25,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2023-12-21 01:33:25,821 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 67 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 01:33:25,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 383 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 01:33:25,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-12-21 01:33:25,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 73. [2023-12-21 01:33:25,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 47 states have internal predecessors, (58), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-21 01:33:25,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 106 transitions. [2023-12-21 01:33:25,837 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 106 transitions. Word has length 112 [2023-12-21 01:33:25,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:33:25,837 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 106 transitions. [2023-12-21 01:33:25,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-21 01:33:25,838 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 106 transitions. [2023-12-21 01:33:25,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-21 01:33:25,838 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:33:25,838 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:33:25,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-21 01:33:25,839 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:33:25,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:33:25,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1877596512, now seen corresponding path program 1 times [2023-12-21 01:33:25,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:33:25,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99256338] [2023-12-21 01:33:25,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:33:25,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:33:25,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:29,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:33:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:29,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 01:33:29,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:29,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-21 01:33:29,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:29,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-21 01:33:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:29,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-21 01:33:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:29,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:33:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:29,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:33:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:29,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-21 01:33:29,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:29,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-21 01:33:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:29,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-21 01:33:29,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:29,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-21 01:33:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:29,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:33:29,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:29,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:33:29,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:29,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-21 01:33:29,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:29,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-21 01:33:29,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:29,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-21 01:33:29,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:29,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-21 01:33:29,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:29,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 01:33:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:29,180 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-21 01:33:29,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:33:29,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99256338] [2023-12-21 01:33:29,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99256338] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:33:29,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:33:29,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-21 01:33:29,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215660457] [2023-12-21 01:33:29,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:33:29,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 01:33:29,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:33:29,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 01:33:29,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-12-21 01:33:29,181 INFO L87 Difference]: Start difference. First operand 73 states and 106 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-21 01:33:29,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:33:29,623 INFO L93 Difference]: Finished difference Result 88 states and 121 transitions. [2023-12-21 01:33:29,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-21 01:33:29,624 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 113 [2023-12-21 01:33:29,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:33:29,624 INFO L225 Difference]: With dead ends: 88 [2023-12-21 01:33:29,624 INFO L226 Difference]: Without dead ends: 0 [2023-12-21 01:33:29,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2023-12-21 01:33:29,625 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 28 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 01:33:29,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 214 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 01:33:29,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-21 01:33:29,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-21 01:33:29,626 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-21 01:33:29,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-21 01:33:29,626 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 113 [2023-12-21 01:33:29,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:33:29,626 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-21 01:33:29,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-21 01:33:29,626 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-21 01:33:29,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-21 01:33:29,629 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 01:33:29,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-21 01:33:29,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-21 01:38:42,654 WARN L293 SmtUtils]: Spent 5.22m on a formula simplification. DAG size of input: 251 DAG size of output: 537 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-21 01:38:45,740 INFO L895 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-12-21 01:38:45,740 INFO L895 garLoopResultBuilder]: At program point L85-1(line 85) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-12-21 01:38:45,741 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-21 01:38:45,741 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-21 01:38:45,741 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-21 01:38:45,741 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-12-21 01:38:45,741 INFO L899 garLoopResultBuilder]: For program point L86(line 86) no Hoare annotation was computed. [2023-12-21 01:38:45,741 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 63) no Hoare annotation was computed. [2023-12-21 01:38:45,741 INFO L895 garLoopResultBuilder]: At program point L70(line 70) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-12-21 01:38:45,741 INFO L895 garLoopResultBuilder]: At program point L70-1(line 70) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-12-21 01:38:45,741 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 64) no Hoare annotation was computed. [2023-12-21 01:38:45,741 INFO L899 garLoopResultBuilder]: For program point L54(lines 54 60) no Hoare annotation was computed. [2023-12-21 01:38:45,741 INFO L895 garLoopResultBuilder]: At program point L79(line 79) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-12-21 01:38:45,741 INFO L895 garLoopResultBuilder]: At program point L79-1(line 79) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-12-21 01:38:45,741 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 48) no Hoare annotation was computed. [2023-12-21 01:38:45,741 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-21 01:38:45,741 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2023-12-21 01:38:45,741 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 40) no Hoare annotation was computed. [2023-12-21 01:38:45,745 INFO L895 garLoopResultBuilder]: At program point L104-2(lines 104 110) the Hoare annotation is: (let ((.cse0 (<= 0 ~last_1_var_1_6~0))) (or (and (= ~var_1_6~0 0) .cse0) (and (let ((.cse4 (* (div ~var_1_5~0 65536) 65536))) (let ((.cse3 (+ .cse4 ~var_1_4~0 ~var_1_3~0)) (.cse1 (* (div ~var_1_4~0 65536) 65536)) (.cse2 (* (div ~var_1_3~0 65536) 65536))) (or (and (= (+ .cse1 .cse2 ~var_1_1~0) (+ ~var_1_4~0 ~var_1_3~0)) (<= (+ .cse1 .cse2 ~var_1_5~0 1) .cse3)) (and (<= .cse3 (+ .cse1 .cse2 ~var_1_5~0)) (= (+ .cse4 ~var_1_1~0) ~var_1_5~0))))) .cse0 (<= 0 ~var_1_6~0)))) [2023-12-21 01:38:45,745 INFO L899 garLoopResultBuilder]: For program point L104-3(lines 104 110) no Hoare annotation was computed. [2023-12-21 01:38:45,745 INFO L899 garLoopResultBuilder]: For program point L38-2(lines 38 40) no Hoare annotation was computed. [2023-12-21 01:38:45,745 INFO L895 garLoopResultBuilder]: At program point L88(line 88) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-12-21 01:38:45,745 INFO L895 garLoopResultBuilder]: At program point L88-1(line 88) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-12-21 01:38:45,745 INFO L899 garLoopResultBuilder]: For program point L55(lines 55 57) no Hoare annotation was computed. [2023-12-21 01:38:45,745 INFO L899 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2023-12-21 01:38:45,746 INFO L899 garLoopResultBuilder]: For program point L89(line 89) no Hoare annotation was computed. [2023-12-21 01:38:45,746 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-12-21 01:38:45,760 INFO L895 garLoopResultBuilder]: At program point L73-1(line 73) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-12-21 01:38:45,760 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-21 01:38:45,760 INFO L895 garLoopResultBuilder]: At program point L82(line 82) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-12-21 01:38:45,760 INFO L895 garLoopResultBuilder]: At program point L82-1(line 82) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-12-21 01:38:45,760 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2023-12-21 01:38:45,760 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-21 01:38:45,760 INFO L895 garLoopResultBuilder]: At program point L91(line 91) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-12-21 01:38:45,760 INFO L895 garLoopResultBuilder]: At program point L91-1(line 91) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-12-21 01:38:45,760 INFO L899 garLoopResultBuilder]: For program point L83(line 83) no Hoare annotation was computed. [2023-12-21 01:38:45,760 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 50) no Hoare annotation was computed. [2023-12-21 01:38:45,760 INFO L899 garLoopResultBuilder]: For program point L42-1(lines 42 50) no Hoare annotation was computed. [2023-12-21 01:38:45,760 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-12-21 01:38:45,761 INFO L895 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-12-21 01:38:45,761 INFO L899 garLoopResultBuilder]: For program point L92(lines 65 93) no Hoare annotation was computed. [2023-12-21 01:38:45,761 INFO L895 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-12-21 01:38:45,761 INFO L895 garLoopResultBuilder]: At program point L76-1(line 76) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-12-21 01:38:45,761 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 49) no Hoare annotation was computed. [2023-12-21 01:38:45,761 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2023-12-21 01:38:45,761 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-21 01:38:45,761 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-21 01:38:45,761 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-21 01:38:45,761 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-21 01:38:45,763 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:38:45,765 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 01:38:45,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 01:38:45 BoogieIcfgContainer [2023-12-21 01:38:45,782 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 01:38:45,783 INFO L158 Benchmark]: Toolchain (without parser) took 345288.58ms. Allocated memory was 192.9MB in the beginning and 876.6MB in the end (delta: 683.7MB). Free memory was 148.0MB in the beginning and 411.0MB in the end (delta: -262.9MB). Peak memory consumption was 508.8MB. Max. memory is 8.0GB. [2023-12-21 01:38:45,783 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 192.9MB. Free memory is still 150.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 01:38:45,783 INFO L158 Benchmark]: CACSL2BoogieTranslator took 327.31ms. Allocated memory is still 192.9MB. Free memory was 147.6MB in the beginning and 135.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-21 01:38:45,783 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.02ms. Allocated memory is still 192.9MB. Free memory was 135.0MB in the beginning and 131.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-21 01:38:45,783 INFO L158 Benchmark]: Boogie Preprocessor took 42.13ms. Allocated memory is still 192.9MB. Free memory was 131.8MB in the beginning and 127.2MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-21 01:38:45,784 INFO L158 Benchmark]: RCFGBuilder took 334.44ms. Allocated memory is still 192.9MB. Free memory was 127.2MB in the beginning and 107.7MB in the end (delta: 19.5MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-21 01:38:45,784 INFO L158 Benchmark]: TraceAbstraction took 344524.77ms. Allocated memory was 192.9MB in the beginning and 876.6MB in the end (delta: 683.7MB). Free memory was 106.7MB in the beginning and 411.0MB in the end (delta: -304.3MB). Peak memory consumption was 466.9MB. Max. memory is 8.0GB. [2023-12-21 01:38:45,785 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 192.9MB. Free memory is still 150.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 327.31ms. Allocated memory is still 192.9MB. Free memory was 147.6MB in the beginning and 135.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.02ms. Allocated memory is still 192.9MB. Free memory was 135.0MB in the beginning and 131.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.13ms. Allocated memory is still 192.9MB. Free memory was 131.8MB in the beginning and 127.2MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 334.44ms. Allocated memory is still 192.9MB. Free memory was 127.2MB in the beginning and 107.7MB in the end (delta: 19.5MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 344524.77ms. Allocated memory was 192.9MB in the beginning and 876.6MB in the end (delta: 683.7MB). Free memory was 106.7MB in the beginning and 411.0MB in the end (delta: -304.3MB). Peak memory consumption was 466.9MB. 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, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 344.5s, OverallIterations: 8, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 316.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 576 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 576 mSDsluCounter, 1868 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1382 mSDsCounter, 86 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1197 IncrementalHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 86 mSolverCounterUnsat, 486 mSDtfsCounter, 1197 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 438 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=5, InterpolantAutomatonStates: 124, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 166 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 85 PreInvPairs, 116 NumberOfFragments, 213 HoareAnnotationTreeSize, 85 FormulaSimplifications, 15892937 FormulaSimplificationTreeSizeReduction, 313.0s HoareSimplificationTime, 20 FormulaSimplificationsInter, 452452 FormulaSimplificationTreeSizeReductionInter, 3.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 20.5s InterpolantComputationTime, 886 NumberOfCodeBlocks, 886 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 878 ConstructedInterpolants, 0 QuantifiedInterpolants, 10622 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 4896/4896 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: 104]: Loop Invariant Derived loop invariant: (((var_1_6 == 0) && (0 <= last_1_var_1_6)) || (((((((((var_1_4 / 65536) * 65536) + ((var_1_3 / 65536) * 65536)) + var_1_1) == (var_1_4 + var_1_3)) && ((((((var_1_4 / 65536) * 65536) + ((var_1_3 / 65536) * 65536)) + var_1_5) + 1) <= ((((var_1_5 / 65536) * 65536) + var_1_4) + var_1_3))) || ((((((var_1_5 / 65536) * 65536) + var_1_4) + var_1_3) <= ((((var_1_4 / 65536) * 65536) + ((var_1_3 / 65536) * 65536)) + var_1_5)) && ((((var_1_5 / 65536) * 65536) + var_1_1) == var_1_5))) && (0 <= last_1_var_1_6)) && (0 <= var_1_6))) RESULT: Ultimate proved your program to be correct! [2023-12-21 01:38:45,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...