/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_loopvsstraightlinecode_25-1loop_file-13.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 22:52:48,591 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 22:52:48,655 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-20 22:52:48,659 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 22:52:48,660 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 22:52:48,681 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 22:52:48,681 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 22:52:48,682 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 22:52:48,682 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 22:52:48,685 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 22:52:48,685 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 22:52:48,686 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 22:52:48,686 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 22:52:48,687 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 22:52:48,687 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 22:52:48,687 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 22:52:48,687 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 22:52:48,687 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 22:52:48,688 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 22:52:48,689 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 22:52:48,689 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 22:52:48,689 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 22:52:48,689 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 22:52:48,689 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 22:52:48,689 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 22:52:48,690 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 22:52:48,690 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 22:52:48,690 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 22:52:48,690 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 22:52:48,690 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 22:52:48,691 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 22:52:48,691 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 22:52:48,691 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 22:52:48,691 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 22:52:48,692 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 22:52:48,692 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 22:52:48,692 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 22:52:48,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 22:52:48,692 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 22:52:48,692 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 22:52:48,692 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 22:52:48,692 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 22:52:48,692 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 22:52:48,693 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-20 22:52:48,879 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 22:52:48,900 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 22:52:48,902 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 22:52:48,903 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 22:52:48,903 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 22:52:48,904 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-13.i [2023-12-20 22:52:49,864 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 22:52:50,055 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 22:52:50,055 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-13.i [2023-12-20 22:52:50,063 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86eca43f5/35c13415a0cd4ed1ad1890f09addf451/FLAG38c7ea2aa [2023-12-20 22:52:50,076 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86eca43f5/35c13415a0cd4ed1ad1890f09addf451 [2023-12-20 22:52:50,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 22:52:50,079 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 22:52:50,081 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 22:52:50,081 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 22:52:50,084 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 22:52:50,084 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 10:52:50" (1/1) ... [2023-12-20 22:52:50,085 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c2393d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:52:50, skipping insertion in model container [2023-12-20 22:52:50,085 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 10:52:50" (1/1) ... [2023-12-20 22:52:50,110 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 22:52:50,220 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-13.i[915,928] [2023-12-20 22:52:50,262 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 22:52:50,269 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 22:52:50,277 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-13.i[915,928] [2023-12-20 22:52:50,295 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 22:52:50,314 INFO L206 MainTranslator]: Completed translation [2023-12-20 22:52:50,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:52:50 WrapperNode [2023-12-20 22:52:50,314 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 22:52:50,315 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 22:52:50,316 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 22:52:50,316 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 22:52:50,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:52:50" (1/1) ... [2023-12-20 22:52:50,336 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:52:50" (1/1) ... [2023-12-20 22:52:50,383 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2023-12-20 22:52:50,384 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 22:52:50,384 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 22:52:50,384 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 22:52:50,384 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 22:52:50,392 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:52:50" (1/1) ... [2023-12-20 22:52:50,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:52:50" (1/1) ... [2023-12-20 22:52:50,394 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:52:50" (1/1) ... [2023-12-20 22:52:50,406 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-20 22:52:50,406 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:52:50" (1/1) ... [2023-12-20 22:52:50,406 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:52:50" (1/1) ... [2023-12-20 22:52:50,411 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:52:50" (1/1) ... [2023-12-20 22:52:50,414 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:52:50" (1/1) ... [2023-12-20 22:52:50,415 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:52:50" (1/1) ... [2023-12-20 22:52:50,416 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:52:50" (1/1) ... [2023-12-20 22:52:50,419 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 22:52:50,419 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 22:52:50,419 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 22:52:50,419 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 22:52:50,420 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:52:50" (1/1) ... [2023-12-20 22:52:50,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 22:52:50,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 22:52:50,473 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-20 22:52:50,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-20 22:52:50,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 22:52:50,571 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-20 22:52:50,571 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-20 22:52:50,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 22:52:50,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 22:52:50,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 22:52:50,669 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 22:52:50,670 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 22:52:50,837 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 22:52:50,874 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 22:52:50,874 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-20 22:52:50,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 10:52:50 BoogieIcfgContainer [2023-12-20 22:52:50,874 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 22:52:50,876 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 22:52:50,876 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 22:52:50,878 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 22:52:50,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 10:52:50" (1/3) ... [2023-12-20 22:52:50,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5247b273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 10:52:50, skipping insertion in model container [2023-12-20 22:52:50,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:52:50" (2/3) ... [2023-12-20 22:52:50,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5247b273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 10:52:50, skipping insertion in model container [2023-12-20 22:52:50,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 10:52:50" (3/3) ... [2023-12-20 22:52:50,880 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-13.i [2023-12-20 22:52:50,891 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 22:52:50,891 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 22:52:50,929 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 22:52:50,933 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;@5baee01e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 22:52:50,934 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 22:52:50,937 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 states have internal predecessors, (29), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-20 22:52:50,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-20 22:52:50,944 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:52:50,945 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 22:52:50,945 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:52:50,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:52:50,949 INFO L85 PathProgramCache]: Analyzing trace with hash 379498785, now seen corresponding path program 1 times [2023-12-20 22:52:50,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:52:50,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603317546] [2023-12-20 22:52:50,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:52:50,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:52:51,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:52:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:52:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:52:51,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:52:51,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:52:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 22:52:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 22:52:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 22:52:51,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 22:52:51,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 22:52:51,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 22:52:51,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 22:52:51,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 22:52:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 22:52:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 22:52:51,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 22:52:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,234 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-20 22:52:51,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:52:51,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603317546] [2023-12-20 22:52:51,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603317546] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:52:51,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:52:51,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 22:52:51,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193053747] [2023-12-20 22:52:51,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:52:51,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-20 22:52:51,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:52:51,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-20 22:52:51,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 22:52:51,261 INFO L87 Difference]: Start difference. First operand has 40 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 states have internal predecessors, (29), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-20 22:52:51,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:52:51,292 INFO L93 Difference]: Finished difference Result 79 states and 137 transitions. [2023-12-20 22:52:51,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-20 22:52:51,295 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 96 [2023-12-20 22:52:51,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:52:51,300 INFO L225 Difference]: With dead ends: 79 [2023-12-20 22:52:51,300 INFO L226 Difference]: Without dead ends: 38 [2023-12-20 22:52:51,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 22:52:51,305 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 22:52:51,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 22:52:51,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-20 22:52:51,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-12-20 22:52:51,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-20 22:52:51,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 56 transitions. [2023-12-20 22:52:51,332 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 56 transitions. Word has length 96 [2023-12-20 22:52:51,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:52:51,332 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 56 transitions. [2023-12-20 22:52:51,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-20 22:52:51,332 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 56 transitions. [2023-12-20 22:52:51,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-20 22:52:51,335 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:52:51,335 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 22:52:51,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 22:52:51,335 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:52:51,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:52:51,336 INFO L85 PathProgramCache]: Analyzing trace with hash -923545311, now seen corresponding path program 1 times [2023-12-20 22:52:51,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:52:51,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574414141] [2023-12-20 22:52:51,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:52:51,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:52:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:52:51,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:52:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:52:51,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:52:51,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:52:51,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 22:52:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 22:52:51,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 22:52:51,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 22:52:51,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 22:52:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 22:52:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 22:52:51,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 22:52:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 22:52:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 22:52:51,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 22:52:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,485 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-20 22:52:51,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:52:51,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574414141] [2023-12-20 22:52:51,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574414141] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:52:51,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:52:51,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 22:52:51,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665886488] [2023-12-20 22:52:51,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:52:51,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 22:52:51,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:52:51,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 22:52:51,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 22:52:51,488 INFO L87 Difference]: Start difference. First operand 38 states and 56 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-20 22:52:51,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:52:51,530 INFO L93 Difference]: Finished difference Result 104 states and 155 transitions. [2023-12-20 22:52:51,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 22:52:51,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 96 [2023-12-20 22:52:51,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:52:51,532 INFO L225 Difference]: With dead ends: 104 [2023-12-20 22:52:51,532 INFO L226 Difference]: Without dead ends: 67 [2023-12-20 22:52:51,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 22:52:51,533 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 51 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 22:52:51,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 133 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 22:52:51,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-12-20 22:52:51,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 38. [2023-12-20 22:52:51,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-20 22:52:51,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 54 transitions. [2023-12-20 22:52:51,551 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 54 transitions. Word has length 96 [2023-12-20 22:52:51,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:52:51,552 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 54 transitions. [2023-12-20 22:52:51,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-20 22:52:51,553 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 54 transitions. [2023-12-20 22:52:51,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-20 22:52:51,554 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:52:51,554 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 22:52:51,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 22:52:51,554 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:52:51,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:52:51,555 INFO L85 PathProgramCache]: Analyzing trace with hash -921698269, now seen corresponding path program 1 times [2023-12-20 22:52:51,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:52:51,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298306103] [2023-12-20 22:52:51,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:52:51,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:52:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:52:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:52:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:52:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:52:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:52:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 22:52:51,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 22:52:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 22:52:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 22:52:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 22:52:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 22:52:51,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 22:52:51,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 22:52:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 22:52:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 22:52:51,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 22:52:51,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:51,831 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-20 22:52:51,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:52:51,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298306103] [2023-12-20 22:52:51,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298306103] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:52:51,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:52:51,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 22:52:51,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432249166] [2023-12-20 22:52:51,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:52:51,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 22:52:51,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:52:51,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 22:52:51,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 22:52:51,839 INFO L87 Difference]: Start difference. First operand 38 states and 54 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-20 22:52:51,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:52:51,869 INFO L93 Difference]: Finished difference Result 75 states and 107 transitions. [2023-12-20 22:52:51,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 22:52:51,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 96 [2023-12-20 22:52:51,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:52:51,874 INFO L225 Difference]: With dead ends: 75 [2023-12-20 22:52:51,874 INFO L226 Difference]: Without dead ends: 38 [2023-12-20 22:52:51,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 22:52:51,879 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 22:52:51,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 48 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 22:52:51,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-20 22:52:51,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-12-20 22:52:51,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-20 22:52:51,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2023-12-20 22:52:51,889 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 96 [2023-12-20 22:52:51,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:52:51,889 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2023-12-20 22:52:51,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-20 22:52:51,889 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2023-12-20 22:52:51,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-20 22:52:51,890 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:52:51,890 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 22:52:51,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-20 22:52:51,891 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:52:51,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:52:51,891 INFO L85 PathProgramCache]: Analyzing trace with hash -921638687, now seen corresponding path program 1 times [2023-12-20 22:52:51,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:52:51,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092431605] [2023-12-20 22:52:51,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:52:51,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:52:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:55,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:52:55,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:55,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:52:55,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:55,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:52:55,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:55,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:52:55,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:55,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:52:55,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:55,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 22:52:55,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:55,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 22:52:55,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:55,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 22:52:55,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:55,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 22:52:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:55,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 22:52:55,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:55,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 22:52:55,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:55,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 22:52:55,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:55,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 22:52:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:55,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 22:52:55,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:55,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 22:52:55,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:55,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 22:52:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:52:55,047 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-20 22:52:55,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:52:55,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092431605] [2023-12-20 22:52:55,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092431605] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:52:55,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:52:55,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-20 22:52:55,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536904256] [2023-12-20 22:52:55,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:52:55,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-20 22:52:55,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:52:55,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-20 22:52:55,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-20 22:52:55,049 INFO L87 Difference]: Start difference. First operand 38 states and 53 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-20 22:52:55,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:52:55,189 INFO L93 Difference]: Finished difference Result 62 states and 85 transitions. [2023-12-20 22:52:55,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-20 22:52:55,190 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 96 [2023-12-20 22:52:55,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:52:55,192 INFO L225 Difference]: With dead ends: 62 [2023-12-20 22:52:55,192 INFO L226 Difference]: Without dead ends: 0 [2023-12-20 22:52:55,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-20 22:52:55,201 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 35 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 22:52:55,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 265 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 22:52:55,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-20 22:52:55,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-20 22:52:55,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 22:52:55,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-20 22:52:55,203 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 96 [2023-12-20 22:52:55,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:52:55,203 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-20 22:52:55,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-20 22:52:55,203 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-20 22:52:55,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-20 22:52:55,205 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-20 22:52:55,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-20 22:52:55,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-20 22:52:55,373 INFO L899 garLoopResultBuilder]: For program point L64(line 64) no Hoare annotation was computed. [2023-12-20 22:52:55,373 INFO L895 garLoopResultBuilder]: At program point L60(line 60) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-12-20 22:52:55,373 INFO L895 garLoopResultBuilder]: At program point L60-1(line 60) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-12-20 22:52:55,373 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-20 22:52:55,374 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-20 22:52:55,374 INFO L895 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-12-20 22:52:55,374 INFO L895 garLoopResultBuilder]: At program point L81-1(line 81) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-12-20 22:52:55,374 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-20 22:52:55,374 INFO L899 garLoopResultBuilder]: For program point L48-1(lines 40 57) no Hoare annotation was computed. [2023-12-20 22:52:55,374 INFO L899 garLoopResultBuilder]: For program point L73(line 73) no Hoare annotation was computed. [2023-12-20 22:52:55,374 INFO L895 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-12-20 22:52:55,375 INFO L895 garLoopResultBuilder]: At program point L69-1(line 69) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-12-20 22:52:55,375 INFO L899 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2023-12-20 22:52:55,375 INFO L895 garLoopResultBuilder]: At program point L94-3(lines 94 100) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-12-20 22:52:55,375 INFO L899 garLoopResultBuilder]: For program point L94-4(lines 94 100) no Hoare annotation was computed. [2023-12-20 22:52:55,375 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-20 22:52:55,375 INFO L899 garLoopResultBuilder]: For program point L82(lines 58 83) no Hoare annotation was computed. [2023-12-20 22:52:55,375 INFO L895 garLoopResultBuilder]: At program point L78(line 78) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-12-20 22:52:55,375 INFO L895 garLoopResultBuilder]: At program point L78-1(line 78) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-12-20 22:52:55,375 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2023-12-20 22:52:55,375 INFO L895 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-12-20 22:52:55,376 INFO L895 garLoopResultBuilder]: At program point L66-1(line 66) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-12-20 22:52:55,376 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-20 22:52:55,376 INFO L899 garLoopResultBuilder]: For program point L79(line 79) no Hoare annotation was computed. [2023-12-20 22:52:55,376 INFO L895 garLoopResultBuilder]: At program point L75(line 75) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-12-20 22:52:55,376 INFO L895 garLoopResultBuilder]: At program point L75-1(line 75) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-12-20 22:52:55,376 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-20 22:52:55,376 INFO L899 garLoopResultBuilder]: For program point L67(line 67) no Hoare annotation was computed. [2023-12-20 22:52:55,376 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-12-20 22:52:55,377 INFO L895 garLoopResultBuilder]: At program point L63-1(line 63) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-12-20 22:52:55,377 INFO L899 garLoopResultBuilder]: For program point L51-1(lines 51 53) no Hoare annotation was computed. [2023-12-20 22:52:55,377 INFO L899 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2023-12-20 22:52:55,377 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 47) no Hoare annotation was computed. [2023-12-20 22:52:55,377 INFO L899 garLoopResultBuilder]: For program point L43-2(lines 40 57) no Hoare annotation was computed. [2023-12-20 22:52:55,378 INFO L895 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-12-20 22:52:55,378 INFO L895 garLoopResultBuilder]: At program point L72-1(line 72) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-12-20 22:52:55,378 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-20 22:52:55,378 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-20 22:52:55,378 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-20 22:52:55,378 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-20 22:52:55,380 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-20 22:52:55,382 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 22:52:55,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 10:52:55 BoogieIcfgContainer [2023-12-20 22:52:55,389 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 22:52:55,390 INFO L158 Benchmark]: Toolchain (without parser) took 5310.56ms. Allocated memory was 230.7MB in the beginning and 399.5MB in the end (delta: 168.8MB). Free memory was 189.0MB in the beginning and 164.8MB in the end (delta: 24.2MB). Peak memory consumption was 194.0MB. Max. memory is 8.0GB. [2023-12-20 22:52:55,390 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 169.9MB. Free memory is still 121.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 22:52:55,390 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.08ms. Allocated memory is still 230.7MB. Free memory was 188.6MB in the beginning and 175.4MB in the end (delta: 13.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-20 22:52:55,390 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.40ms. Allocated memory is still 230.7MB. Free memory was 175.4MB in the beginning and 171.9MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-20 22:52:55,390 INFO L158 Benchmark]: Boogie Preprocessor took 34.48ms. Allocated memory is still 230.7MB. Free memory was 171.9MB in the beginning and 164.5MB in the end (delta: 7.4MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2023-12-20 22:52:55,390 INFO L158 Benchmark]: RCFGBuilder took 455.10ms. Allocated memory is still 230.7MB. Free memory was 164.5MB in the beginning and 142.9MB in the end (delta: 21.6MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-12-20 22:52:55,391 INFO L158 Benchmark]: TraceAbstraction took 4513.44ms. Allocated memory was 230.7MB in the beginning and 399.5MB in the end (delta: 168.8MB). Free memory was 142.3MB in the beginning and 164.8MB in the end (delta: -22.5MB). Peak memory consumption was 147.8MB. Max. memory is 8.0GB. [2023-12-20 22:52:55,392 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.41ms. Allocated memory is still 169.9MB. Free memory is still 121.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 234.08ms. Allocated memory is still 230.7MB. Free memory was 188.6MB in the beginning and 175.4MB in the end (delta: 13.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 68.40ms. Allocated memory is still 230.7MB. Free memory was 175.4MB in the beginning and 171.9MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.48ms. Allocated memory is still 230.7MB. Free memory was 171.9MB in the beginning and 164.5MB in the end (delta: 7.4MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * RCFGBuilder took 455.10ms. Allocated memory is still 230.7MB. Free memory was 164.5MB in the beginning and 142.9MB in the end (delta: 21.6MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 4513.44ms. Allocated memory was 230.7MB in the beginning and 399.5MB in the end (delta: 168.8MB). Free memory was 142.3MB in the beginning and 164.8MB in the end (delta: -22.5MB). Peak memory consumption was 147.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 4, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 111 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 111 mSDsluCounter, 499 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 234 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 97 IncrementalHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 265 mSDtfsCounter, 97 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=0, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 29 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 91 PreInvPairs, 119 NumberOfFragments, 154 HoareAnnotationTreeSize, 91 FormulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 18 FormulaSimplificationsInter, 627 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 384 NumberOfCodeBlocks, 384 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 380 ConstructedInterpolants, 0 QuantifiedInterpolants, 774 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 1920/1920 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: 94]: Loop Invariant Derived loop invariant: ((25 <= var_1_1) && ((var_1_1 / 65536) <= 0)) RESULT: Ultimate proved your program to be correct! [2023-12-20 22:52:55,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...