/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_codestructure_steplocals_file-10.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 18:51:45,616 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 18:51:45,693 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 18:51:45,696 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 18:51:45,696 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 18:51:45,716 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 18:51:45,716 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 18:51:45,717 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 18:51:45,717 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 18:51:45,717 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 18:51:45,718 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 18:51:45,718 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 18:51:45,718 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 18:51:45,719 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 18:51:45,719 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 18:51:45,719 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 18:51:45,719 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 18:51:45,720 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 18:51:45,720 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 18:51:45,720 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 18:51:45,720 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 18:51:45,721 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 18:51:45,721 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 18:51:45,721 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 18:51:45,721 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 18:51:45,721 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 18:51:45,722 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 18:51:45,722 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 18:51:45,722 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 18:51:45,722 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 18:51:45,722 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 18:51:45,723 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 18:51:45,723 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 18:51:45,723 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 18:51:45,723 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 18:51:45,723 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 18:51:45,723 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 18:51:45,723 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 18:51:45,724 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 18:51:45,724 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 18:51:45,724 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 18:51:45,724 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 18:51:45,724 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 18:51:45,724 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 18:51:45,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 18:51:45,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 18:51:45,880 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 18:51:45,880 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 18:51:45,881 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 18:51:45,881 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_steplocals_file-10.i [2023-12-20 18:51:46,883 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 18:51:47,053 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 18:51:47,053 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_steplocals_file-10.i [2023-12-20 18:51:47,059 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45806d2b2/e5e45665febe4f718b4bc92583c7ca00/FLAGa48bead23 [2023-12-20 18:51:47,075 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45806d2b2/e5e45665febe4f718b4bc92583c7ca00 [2023-12-20 18:51:47,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 18:51:47,078 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 18:51:47,079 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 18:51:47,079 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 18:51:47,087 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 18:51:47,087 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 06:51:47" (1/1) ... [2023-12-20 18:51:47,088 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76bb96c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 06:51:47, skipping insertion in model container [2023-12-20 18:51:47,088 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 06:51:47" (1/1) ... [2023-12-20 18:51:47,129 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 18:51:47,221 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_codestructure_steplocals_file-10.i[917,930] [2023-12-20 18:51:47,282 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 18:51:47,290 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 18:51:47,298 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_codestructure_steplocals_file-10.i[917,930] [2023-12-20 18:51:47,332 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 18:51:47,343 INFO L206 MainTranslator]: Completed translation [2023-12-20 18:51:47,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 06:51:47 WrapperNode [2023-12-20 18:51:47,343 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 18:51:47,344 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 18:51:47,344 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 18:51:47,344 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 18:51:47,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 06:51:47" (1/1) ... [2023-12-20 18:51:47,369 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 06:51:47" (1/1) ... [2023-12-20 18:51:47,419 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 166 [2023-12-20 18:51:47,419 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 18:51:47,420 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 18:51:47,420 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 18:51:47,420 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 18:51:47,427 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 06:51:47" (1/1) ... [2023-12-20 18:51:47,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 06:51:47" (1/1) ... [2023-12-20 18:51:47,430 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 06:51:47" (1/1) ... [2023-12-20 18:51:47,445 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 18:51:47,445 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 06:51:47" (1/1) ... [2023-12-20 18:51:47,445 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 06:51:47" (1/1) ... [2023-12-20 18:51:47,462 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 06:51:47" (1/1) ... [2023-12-20 18:51:47,464 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 06:51:47" (1/1) ... [2023-12-20 18:51:47,467 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 06:51:47" (1/1) ... [2023-12-20 18:51:47,468 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 06:51:47" (1/1) ... [2023-12-20 18:51:47,483 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 18:51:47,484 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 18:51:47,484 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 18:51:47,484 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 18:51:47,485 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 06:51:47" (1/1) ... [2023-12-20 18:51:47,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 18:51:47,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 18:51:47,517 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 18:51:47,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 18:51:47,558 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-20 18:51:47,558 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-20 18:51:47,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 18:51:47,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 18:51:47,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 18:51:47,537 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 18:51:47,648 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 18:51:47,650 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 18:51:47,895 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 18:51:47,914 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 18:51:47,915 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-20 18:51:47,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 06:51:47 BoogieIcfgContainer [2023-12-20 18:51:47,915 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 18:51:47,917 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 18:51:47,917 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 18:51:47,919 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 18:51:47,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 06:51:47" (1/3) ... [2023-12-20 18:51:47,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c46635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 06:51:47, skipping insertion in model container [2023-12-20 18:51:47,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 06:51:47" (2/3) ... [2023-12-20 18:51:47,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c46635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 06:51:47, skipping insertion in model container [2023-12-20 18:51:47,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 06:51:47" (3/3) ... [2023-12-20 18:51:47,920 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-10.i [2023-12-20 18:51:47,932 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 18:51:47,932 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 18:51:47,966 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 18:51:47,970 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;@6a79a88b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 18:51:47,971 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 18:51:47,973 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-20 18:51:47,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-20 18:51:47,987 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 18:51:47,998 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:51:47,998 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 18:51:48,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 18:51:48,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1755363985, now seen corresponding path program 1 times [2023-12-20 18:51:48,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 18:51:48,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688239906] [2023-12-20 18:51:48,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 18:51:48,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 18:51:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:48,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 18:51:48,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:48,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 18:51:48,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:48,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 18:51:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:48,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 18:51:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:48,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 18:51:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:48,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 18:51:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:48,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 18:51:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:48,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 18:51:48,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:48,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 18:51:48,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:48,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 18:51:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:48,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 18:51:48,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:48,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 18:51:48,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:48,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 18:51:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:48,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 18:51:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:48,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 18:51:48,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:48,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 18:51:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:48,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 18:51:48,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:48,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 18:51:48,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:48,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 18:51:48,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:48,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-20 18:51:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:48,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-20 18:51:48,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:48,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-20 18:51:48,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:48,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-12-20 18:51:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:48,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-20 18:51:48,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:48,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-20 18:51:48,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 18:51:48,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688239906] [2023-12-20 18:51:48,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688239906] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 18:51:48,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 18:51:48,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 18:51:48,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918159759] [2023-12-20 18:51:48,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 18:51:48,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-20 18:51:48,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 18:51:48,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-20 18:51:48,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 18:51:48,340 INFO L87 Difference]: Start difference. First operand has 67 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2023-12-20 18:51:48,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 18:51:48,366 INFO L93 Difference]: Finished difference Result 131 states and 232 transitions. [2023-12-20 18:51:48,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-20 18:51:48,368 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 150 [2023-12-20 18:51:48,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 18:51:48,373 INFO L225 Difference]: With dead ends: 131 [2023-12-20 18:51:48,373 INFO L226 Difference]: Without dead ends: 65 [2023-12-20 18:51:48,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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 18:51:48,378 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 18:51:48,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 18:51:48,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-12-20 18:51:48,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2023-12-20 18:51:48,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-20 18:51:48,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 100 transitions. [2023-12-20 18:51:48,421 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 100 transitions. Word has length 150 [2023-12-20 18:51:48,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 18:51:48,421 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 100 transitions. [2023-12-20 18:51:48,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2023-12-20 18:51:48,422 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 100 transitions. [2023-12-20 18:51:48,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-20 18:51:48,425 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 18:51:48,425 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:51:48,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 18:51:48,425 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 18:51:48,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 18:51:48,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1163987601, now seen corresponding path program 1 times [2023-12-20 18:51:48,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 18:51:48,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511364645] [2023-12-20 18:51:48,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 18:51:48,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 18:51:48,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:54:00,023 WARN L293 SmtUtils]: Spent 10.25s on a formula simplification. DAG size of input: 222 DAG size of output: 221 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 18:55:56,283 WARN L293 SmtUtils]: Spent 5.23s on a formula simplification. DAG size of input: 256 DAG size of output: 255 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 18:58:21,115 WARN L293 SmtUtils]: Spent 26.53s on a formula simplification. DAG size of input: 275 DAG size of output: 274 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 19:00:14,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:00:14,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:00:14,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 19:00:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:00:14,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 19:00:14,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:00:14,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 19:00:14,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:00:14,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 19:00:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:00:14,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 19:00:14,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:00:14,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 19:00:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:00:14,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 19:00:14,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:00:14,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 19:00:14,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:00:14,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 19:00:14,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:00:14,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 19:00:14,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:00:14,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 19:00:14,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:00:14,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 19:00:14,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:00:14,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 19:00:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:00:14,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 19:00:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:00:14,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 19:00:14,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:00:14,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 19:00:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:00:14,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 19:00:14,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:00:14,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 19:00:14,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:00:14,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-20 19:00:14,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:00:14,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-20 19:00:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:00:14,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-20 19:00:14,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:00:14,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-12-20 19:00:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:00:14,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-20 19:00:14,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:00:14,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-20 19:00:14,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:00:14,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511364645] [2023-12-20 19:00:14,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511364645] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:00:14,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:00:14,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-20 19:00:14,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092459702] [2023-12-20 19:00:14,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:00:14,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-20 19:00:14,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:00:14,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-20 19:00:14,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-20 19:00:14,192 INFO L87 Difference]: Start difference. First operand 65 states and 100 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-20 19:00:23,043 WARN L293 SmtUtils]: Spent 7.58s on a formula simplification that was a NOOP. DAG size: 233 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 19:00:29,190 WARN L293 SmtUtils]: Spent 5.91s on a formula simplification that was a NOOP. DAG size: 267 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 19:00:33,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 19:00:35,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.47s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 19:00:41,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 19:00:49,323 WARN L293 SmtUtils]: Spent 6.52s on a formula simplification that was a NOOP. DAG size: 256 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 19:00:54,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:00:54,932 INFO L93 Difference]: Finished difference Result 170 states and 258 transitions. [2023-12-20 19:00:54,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-20 19:00:54,935 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 150 [2023-12-20 19:00:54,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:00:54,937 INFO L225 Difference]: With dead ends: 170 [2023-12-20 19:00:54,937 INFO L226 Difference]: Without dead ends: 106 [2023-12-20 19:00:54,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 68.5s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-12-20 19:00:54,939 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 179 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.6s IncrementalHoareTripleChecker+Time [2023-12-20 19:00:54,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 387 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 227 Invalid, 2 Unknown, 0 Unchecked, 15.6s Time] [2023-12-20 19:00:54,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-12-20 19:00:54,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 78. [2023-12-20 19:00:54,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 52 states have internal predecessors, (72), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-20 19:00:54,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 120 transitions. [2023-12-20 19:00:54,976 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 120 transitions. Word has length 150 [2023-12-20 19:00:54,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:00:54,978 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 120 transitions. [2023-12-20 19:00:54,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-20 19:00:54,978 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 120 transitions. [2023-12-20 19:00:54,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-20 19:00:54,980 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:00:54,980 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:00:54,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 19:00:54,981 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:00:54,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:00:54,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1264398855, now seen corresponding path program 1 times [2023-12-20 19:00:54,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:00:54,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877003132] [2023-12-20 19:00:54,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:00:54,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:00:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:03:19,144 WARN L293 SmtUtils]: Spent 10.63s on a formula simplification. DAG size of input: 222 DAG size of output: 221 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 19:05:34,270 WARN L293 SmtUtils]: Spent 15.22s on a formula simplification. DAG size of input: 256 DAG size of output: 255 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 19:05:34,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:05:34,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:05:34,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 19:05:34,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:05:34,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 19:05:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:05:34,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 19:05:34,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:05:34,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 19:05:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:05:34,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 19:05:34,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:05:34,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 19:05:34,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:05:34,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 19:05:34,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:05:34,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 19:05:34,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:05:34,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 19:05:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:05:34,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 19:05:34,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:05:34,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 19:05:34,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:05:34,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 19:05:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:05:34,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 19:05:34,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:05:34,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 19:05:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:05:34,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 19:05:34,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:05:34,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 19:05:34,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:05:34,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 19:05:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:05:34,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 19:05:34,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:05:34,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-20 19:05:34,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:05:34,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-20 19:05:34,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:05:34,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-20 19:05:34,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:05:34,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-12-20 19:05:34,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:05:34,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-20 19:05:34,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:05:34,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-20 19:05:34,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:05:34,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877003132] [2023-12-20 19:05:34,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877003132] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:05:34,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:05:34,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-20 19:05:34,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699063656] [2023-12-20 19:05:34,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:05:34,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-20 19:05:34,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:05:34,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-20 19:05:34,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-20 19:05:34,367 INFO L87 Difference]: Start difference. First operand 78 states and 120 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-20 19:05:41,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 19:05:54,718 WARN L293 SmtUtils]: Spent 13.26s on a formula simplification. DAG size of input: 302 DAG size of output: 226 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 19:06:05,526 WARN L293 SmtUtils]: Spent 10.38s on a formula simplification. DAG size of input: 336 DAG size of output: 260 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 19:06:09,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 19:06:14,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 19:06:18,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 19:06:23,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2023-12-20 19:06:24,229 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-20 19:06:25,430 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-20 19:06:25,452 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 137 [2023-12-20 19:06:25,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-20 19:06:25,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 62.2s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2023-12-20 19:06:25,454 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 147 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.6s IncrementalHoareTripleChecker+Time [2023-12-20 19:06:25,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 393 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 225 Invalid, 3 Unknown, 0 Unchecked, 19.6s Time] [2023-12-20 19:06:25,456 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-20 19:06:25,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-20 19:06:25,456 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (78states) and FLOYD_HOARE automaton (currently 9 states, 9 states before enhancement),while PredicateUnifier was unifying predicates,while executing Executor. [2023-12-20 19:06:25,459 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-20 19:06:25,465 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 19:06:25,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 07:06:25 BoogieIcfgContainer [2023-12-20 19:06:25,469 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 19:06:25,470 INFO L158 Benchmark]: Toolchain (without parser) took 878391.53ms. Allocated memory was 211.8MB in the beginning and 910.2MB in the end (delta: 698.4MB). Free memory was 144.5MB in the beginning and 810.4MB in the end (delta: -665.8MB). Peak memory consumption was 32.7MB. Max. memory is 8.0GB. [2023-12-20 19:06:25,470 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 211.8MB. Free memory is still 161.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 19:06:25,470 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.29ms. Allocated memory was 211.8MB in the beginning and 360.7MB in the end (delta: 148.9MB). Free memory was 144.3MB in the beginning and 322.6MB in the end (delta: -178.3MB). Peak memory consumption was 15.1MB. Max. memory is 8.0GB. [2023-12-20 19:06:25,471 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.09ms. Allocated memory is still 360.7MB. Free memory was 322.6MB in the beginning and 317.9MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-20 19:06:25,471 INFO L158 Benchmark]: Boogie Preprocessor took 63.28ms. Allocated memory is still 360.7MB. Free memory was 317.9MB in the beginning and 311.1MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-20 19:06:25,471 INFO L158 Benchmark]: RCFGBuilder took 431.25ms. Allocated memory is still 360.7MB. Free memory was 310.5MB in the beginning and 285.9MB in the end (delta: 24.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-12-20 19:06:25,471 INFO L158 Benchmark]: TraceAbstraction took 877553.01ms. Allocated memory was 360.7MB in the beginning and 910.2MB in the end (delta: 549.5MB). Free memory was 284.9MB in the beginning and 810.4MB in the end (delta: -525.5MB). Peak memory consumption was 24.0MB. Max. memory is 8.0GB. [2023-12-20 19:06:25,473 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 211.8MB. Free memory is still 161.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 264.29ms. Allocated memory was 211.8MB in the beginning and 360.7MB in the end (delta: 148.9MB). Free memory was 144.3MB in the beginning and 322.6MB in the end (delta: -178.3MB). Peak memory consumption was 15.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 75.09ms. Allocated memory is still 360.7MB. Free memory was 322.6MB in the beginning and 317.9MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 63.28ms. Allocated memory is still 360.7MB. Free memory was 317.9MB in the beginning and 311.1MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 431.25ms. Allocated memory is still 360.7MB. Free memory was 310.5MB in the beginning and 285.9MB in the end (delta: 24.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 877553.01ms. Allocated memory was 360.7MB in the beginning and 910.2MB in the end (delta: 549.5MB). Free memory was 284.9MB in the beginning and 810.4MB in the end (delta: -525.5MB). Peak memory consumption was 24.0MB. 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 - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while NwaCegarLoop was constructing difference of abstraction (78states) and FLOYD_HOARE automaton (currently 9 states, 9 states before enhancement),while PredicateUnifier was unifying predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 67 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 877.5s, OverallIterations: 3, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 91.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 326 SdHoareTripleChecker+Valid, 35.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 326 mSDsluCounter, 877 SdHoareTripleChecker+Invalid, 34.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 626 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 455 IncrementalHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 251 mSDtfsCounter, 455 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 208 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 130.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=2, 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.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 28 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 785.0s InterpolantComputationTime, 451 NumberOfCodeBlocks, 451 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 448 ConstructedInterpolants, 0 QuantifiedInterpolants, 34897 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 3312/3312 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown