/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/locks/test_locks_14-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 14:57:29,873 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 14:57:29,875 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 14:57:29,905 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 14:57:29,906 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 14:57:29,906 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 14:57:29,907 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 14:57:29,909 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 14:57:29,910 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 14:57:29,911 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 14:57:29,915 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 14:57:29,916 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 14:57:29,917 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 14:57:29,917 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 14:57:29,918 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 14:57:29,919 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 14:57:29,920 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 14:57:29,920 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 14:57:29,922 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 14:57:29,926 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 14:57:29,929 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 14:57:29,932 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 14:57:29,934 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 14:57:29,936 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 14:57:29,937 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 14:57:29,939 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 14:57:29,939 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 14:57:29,940 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 14:57:29,940 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 14:57:29,941 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 14:57:29,941 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 14:57:29,942 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 14:57:29,942 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 14:57:29,943 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 14:57:29,943 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 14:57:29,944 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 14:57:29,944 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 14:57:29,945 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 14:57:29,945 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 14:57:29,945 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 14:57:29,946 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 14:57:29,947 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 14:57:29,948 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 14:57:29,955 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 14:57:29,956 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 14:57:29,956 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 14:57:29,957 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 14:57:29,957 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 14:57:29,957 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 14:57:29,957 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 14:57:29,957 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 14:57:29,958 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 14:57:29,958 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 14:57:29,958 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 14:57:29,958 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 14:57:29,958 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 14:57:29,959 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 14:57:29,959 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 14:57:29,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:57:29,959 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 14:57:29,959 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 14:57:29,960 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 14:57:29,960 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 14:57:29,960 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 14:57:29,960 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 14:57:29,960 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 14:57:30,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 14:57:30,181 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 14:57:30,183 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 14:57:30,185 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 14:57:30,185 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 14:57:30,187 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_14-2.c [2022-04-08 14:57:30,253 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a06d7ef4/f8e03ad0cb2a48968cc3c687392cdbc9/FLAG78bafb927 [2022-04-08 14:57:30,645 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 14:57:30,646 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_14-2.c [2022-04-08 14:57:30,655 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a06d7ef4/f8e03ad0cb2a48968cc3c687392cdbc9/FLAG78bafb927 [2022-04-08 14:57:31,045 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a06d7ef4/f8e03ad0cb2a48968cc3c687392cdbc9 [2022-04-08 14:57:31,046 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 14:57:31,048 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 14:57:31,051 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 14:57:31,051 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 14:57:31,054 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 14:57:31,056 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:57:31" (1/1) ... [2022-04-08 14:57:31,056 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d9c5493 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:57:31, skipping insertion in model container [2022-04-08 14:57:31,057 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:57:31" (1/1) ... [2022-04-08 14:57:31,063 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 14:57:31,085 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 14:57:31,253 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_14-2.c[5305,5318] [2022-04-08 14:57:31,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:57:31,267 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 14:57:31,291 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_14-2.c[5305,5318] [2022-04-08 14:57:31,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:57:31,302 INFO L208 MainTranslator]: Completed translation [2022-04-08 14:57:31,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:57:31 WrapperNode [2022-04-08 14:57:31,303 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 14:57:31,304 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 14:57:31,304 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 14:57:31,304 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 14:57:31,313 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:57:31" (1/1) ... [2022-04-08 14:57:31,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:57:31" (1/1) ... [2022-04-08 14:57:31,331 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:57:31" (1/1) ... [2022-04-08 14:57:31,332 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:57:31" (1/1) ... [2022-04-08 14:57:31,342 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:57:31" (1/1) ... [2022-04-08 14:57:31,350 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:57:31" (1/1) ... [2022-04-08 14:57:31,352 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:57:31" (1/1) ... [2022-04-08 14:57:31,354 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 14:57:31,355 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 14:57:31,355 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 14:57:31,355 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 14:57:31,359 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:57:31" (1/1) ... [2022-04-08 14:57:31,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:57:31,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:57:31,387 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 14:57:31,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 14:57:31,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 14:57:31,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 14:57:31,416 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 14:57:31,416 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 14:57:31,416 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 14:57:31,416 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 14:57:31,416 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 14:57:31,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 14:57:31,416 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 14:57:31,416 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 14:57:31,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 14:57:31,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 14:57:31,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 14:57:31,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 14:57:31,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 14:57:31,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 14:57:31,495 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 14:57:31,497 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 14:57:31,772 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 14:57:31,779 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 14:57:31,779 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 14:57:31,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:57:31 BoogieIcfgContainer [2022-04-08 14:57:31,781 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 14:57:31,782 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 14:57:31,782 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 14:57:31,788 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 14:57:31,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 02:57:31" (1/3) ... [2022-04-08 14:57:31,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7175df57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:57:31, skipping insertion in model container [2022-04-08 14:57:31,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:57:31" (2/3) ... [2022-04-08 14:57:31,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7175df57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:57:31, skipping insertion in model container [2022-04-08 14:57:31,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:57:31" (3/3) ... [2022-04-08 14:57:31,791 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_14-2.c [2022-04-08 14:57:31,795 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 14:57:31,796 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 14:57:31,835 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 14:57:31,840 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 [2022-04-08 14:57:31,840 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 14:57:31,855 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 52 states have internal predecessors, (97), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 14:57:31,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 14:57:31,862 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:57:31,862 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:57:31,863 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:57:31,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:57:31,867 INFO L85 PathProgramCache]: Analyzing trace with hash -406525713, now seen corresponding path program 1 times [2022-04-08 14:57:31,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:31,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1755471537] [2022-04-08 14:57:31,883 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:57:31,883 INFO L85 PathProgramCache]: Analyzing trace with hash -406525713, now seen corresponding path program 2 times [2022-04-08 14:57:31,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:57:31,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481868088] [2022-04-08 14:57:31,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:57:31,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:57:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:32,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:57:32,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:32,151 INFO L290 TraceCheckUtils]: 0: Hoare triple {66#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {60#true} is VALID [2022-04-08 14:57:32,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {60#true} assume true; {60#true} is VALID [2022-04-08 14:57:32,152 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60#true} {60#true} #268#return; {60#true} is VALID [2022-04-08 14:57:32,154 INFO L272 TraceCheckUtils]: 0: Hoare triple {60#true} call ULTIMATE.init(); {66#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:57:32,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {66#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {60#true} is VALID [2022-04-08 14:57:32,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {60#true} assume true; {60#true} is VALID [2022-04-08 14:57:32,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60#true} {60#true} #268#return; {60#true} is VALID [2022-04-08 14:57:32,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {60#true} call #t~ret19 := main(); {60#true} is VALID [2022-04-08 14:57:32,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {60#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {60#true} is VALID [2022-04-08 14:57:32,156 INFO L290 TraceCheckUtils]: 6: Hoare triple {60#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {60#true} is VALID [2022-04-08 14:57:32,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {60#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {60#true} is VALID [2022-04-08 14:57:32,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {60#true} assume 0 != ~p1~0;~lk1~0 := 1; {65#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:57:32,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {65#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {65#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:57:32,159 INFO L290 TraceCheckUtils]: 10: Hoare triple {65#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {65#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:57:32,159 INFO L290 TraceCheckUtils]: 11: Hoare triple {65#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {65#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:57:32,160 INFO L290 TraceCheckUtils]: 12: Hoare triple {65#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {65#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:57:32,161 INFO L290 TraceCheckUtils]: 13: Hoare triple {65#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {65#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:57:32,162 INFO L290 TraceCheckUtils]: 14: Hoare triple {65#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {65#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:57:32,163 INFO L290 TraceCheckUtils]: 15: Hoare triple {65#(not (= main_~p1~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {65#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:57:32,164 INFO L290 TraceCheckUtils]: 16: Hoare triple {65#(not (= main_~p1~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {65#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:57:32,165 INFO L290 TraceCheckUtils]: 17: Hoare triple {65#(not (= main_~p1~0 0))} assume !(0 != ~p10~0); {65#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:57:32,165 INFO L290 TraceCheckUtils]: 18: Hoare triple {65#(not (= main_~p1~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {65#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:57:32,167 INFO L290 TraceCheckUtils]: 19: Hoare triple {65#(not (= main_~p1~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {65#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:57:32,168 INFO L290 TraceCheckUtils]: 20: Hoare triple {65#(not (= main_~p1~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {65#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:57:32,169 INFO L290 TraceCheckUtils]: 21: Hoare triple {65#(not (= main_~p1~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {65#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:57:32,169 INFO L290 TraceCheckUtils]: 22: Hoare triple {65#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {61#false} is VALID [2022-04-08 14:57:32,170 INFO L290 TraceCheckUtils]: 23: Hoare triple {61#false} assume !(0 != ~p2~0); {61#false} is VALID [2022-04-08 14:57:32,170 INFO L290 TraceCheckUtils]: 24: Hoare triple {61#false} assume !false; {61#false} is VALID [2022-04-08 14:57:32,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:57:32,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:57:32,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481868088] [2022-04-08 14:57:32,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481868088] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:32,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:32,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:32,174 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:57:32,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1755471537] [2022-04-08 14:57:32,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1755471537] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:32,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:32,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:32,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307160606] [2022-04-08 14:57:32,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:57:32,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 14:57:32,183 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:57:32,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:32,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:32,228 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:57:32,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:32,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:57:32,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:57:32,250 INFO L87 Difference]: Start difference. First operand has 57 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 52 states have internal predecessors, (97), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:32,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:32,683 INFO L93 Difference]: Finished difference Result 156 states and 288 transitions. [2022-04-08 14:57:32,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:57:32,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 14:57:32,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:57:32,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:32,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 288 transitions. [2022-04-08 14:57:32,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:32,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 288 transitions. [2022-04-08 14:57:32,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 288 transitions. [2022-04-08 14:57:32,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 288 edges. 288 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:32,990 INFO L225 Difference]: With dead ends: 156 [2022-04-08 14:57:32,990 INFO L226 Difference]: Without dead ends: 97 [2022-04-08 14:57:32,993 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:57:32,995 INFO L913 BasicCegarLoop]: 155 mSDtfsCounter, 193 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:57:32,996 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 164 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:57:33,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-08 14:57:33,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2022-04-08 14:57:33,034 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:57:33,036 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 95 states, 91 states have (on average 1.89010989010989) internal successors, (172), 91 states have internal predecessors, (172), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:33,039 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 95 states, 91 states have (on average 1.89010989010989) internal successors, (172), 91 states have internal predecessors, (172), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:33,040 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 95 states, 91 states have (on average 1.89010989010989) internal successors, (172), 91 states have internal predecessors, (172), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:33,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:33,048 INFO L93 Difference]: Finished difference Result 97 states and 176 transitions. [2022-04-08 14:57:33,049 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 176 transitions. [2022-04-08 14:57:33,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:33,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:33,050 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 91 states have (on average 1.89010989010989) internal successors, (172), 91 states have internal predecessors, (172), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 97 states. [2022-04-08 14:57:33,050 INFO L87 Difference]: Start difference. First operand has 95 states, 91 states have (on average 1.89010989010989) internal successors, (172), 91 states have internal predecessors, (172), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 97 states. [2022-04-08 14:57:33,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:33,086 INFO L93 Difference]: Finished difference Result 97 states and 176 transitions. [2022-04-08 14:57:33,086 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 176 transitions. [2022-04-08 14:57:33,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:33,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:33,090 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:57:33,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:57:33,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 91 states have (on average 1.89010989010989) internal successors, (172), 91 states have internal predecessors, (172), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:33,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 175 transitions. [2022-04-08 14:57:33,115 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 175 transitions. Word has length 25 [2022-04-08 14:57:33,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:57:33,116 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 175 transitions. [2022-04-08 14:57:33,116 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:33,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 175 transitions. [2022-04-08 14:57:33,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:33,299 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 175 transitions. [2022-04-08 14:57:33,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 14:57:33,302 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:57:33,302 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:57:33,302 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 14:57:33,302 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:57:33,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:57:33,303 INFO L85 PathProgramCache]: Analyzing trace with hash -406532905, now seen corresponding path program 1 times [2022-04-08 14:57:33,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:33,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1448619311] [2022-04-08 14:57:33,304 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:57:33,304 INFO L85 PathProgramCache]: Analyzing trace with hash -406532905, now seen corresponding path program 2 times [2022-04-08 14:57:33,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:57:33,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228940443] [2022-04-08 14:57:33,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:57:33,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:57:33,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:33,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:57:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:33,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {774#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {768#true} is VALID [2022-04-08 14:57:33,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {768#true} assume true; {768#true} is VALID [2022-04-08 14:57:33,373 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {768#true} {768#true} #268#return; {768#true} is VALID [2022-04-08 14:57:33,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {768#true} call ULTIMATE.init(); {774#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:57:33,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {774#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {768#true} is VALID [2022-04-08 14:57:33,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {768#true} assume true; {768#true} is VALID [2022-04-08 14:57:33,374 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {768#true} {768#true} #268#return; {768#true} is VALID [2022-04-08 14:57:33,374 INFO L272 TraceCheckUtils]: 4: Hoare triple {768#true} call #t~ret19 := main(); {768#true} is VALID [2022-04-08 14:57:33,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {768#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {768#true} is VALID [2022-04-08 14:57:33,375 INFO L290 TraceCheckUtils]: 6: Hoare triple {768#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {768#true} is VALID [2022-04-08 14:57:33,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {768#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {768#true} is VALID [2022-04-08 14:57:33,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {768#true} assume 0 != ~p1~0;~lk1~0 := 1; {773#(= main_~lk1~0 1)} is VALID [2022-04-08 14:57:33,376 INFO L290 TraceCheckUtils]: 9: Hoare triple {773#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {773#(= main_~lk1~0 1)} is VALID [2022-04-08 14:57:33,376 INFO L290 TraceCheckUtils]: 10: Hoare triple {773#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {773#(= main_~lk1~0 1)} is VALID [2022-04-08 14:57:33,376 INFO L290 TraceCheckUtils]: 11: Hoare triple {773#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {773#(= main_~lk1~0 1)} is VALID [2022-04-08 14:57:33,377 INFO L290 TraceCheckUtils]: 12: Hoare triple {773#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {773#(= main_~lk1~0 1)} is VALID [2022-04-08 14:57:33,377 INFO L290 TraceCheckUtils]: 13: Hoare triple {773#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {773#(= main_~lk1~0 1)} is VALID [2022-04-08 14:57:33,378 INFO L290 TraceCheckUtils]: 14: Hoare triple {773#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {773#(= main_~lk1~0 1)} is VALID [2022-04-08 14:57:33,378 INFO L290 TraceCheckUtils]: 15: Hoare triple {773#(= main_~lk1~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {773#(= main_~lk1~0 1)} is VALID [2022-04-08 14:57:33,379 INFO L290 TraceCheckUtils]: 16: Hoare triple {773#(= main_~lk1~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {773#(= main_~lk1~0 1)} is VALID [2022-04-08 14:57:33,379 INFO L290 TraceCheckUtils]: 17: Hoare triple {773#(= main_~lk1~0 1)} assume !(0 != ~p10~0); {773#(= main_~lk1~0 1)} is VALID [2022-04-08 14:57:33,379 INFO L290 TraceCheckUtils]: 18: Hoare triple {773#(= main_~lk1~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {773#(= main_~lk1~0 1)} is VALID [2022-04-08 14:57:33,380 INFO L290 TraceCheckUtils]: 19: Hoare triple {773#(= main_~lk1~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {773#(= main_~lk1~0 1)} is VALID [2022-04-08 14:57:33,380 INFO L290 TraceCheckUtils]: 20: Hoare triple {773#(= main_~lk1~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {773#(= main_~lk1~0 1)} is VALID [2022-04-08 14:57:33,381 INFO L290 TraceCheckUtils]: 21: Hoare triple {773#(= main_~lk1~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {773#(= main_~lk1~0 1)} is VALID [2022-04-08 14:57:33,381 INFO L290 TraceCheckUtils]: 22: Hoare triple {773#(= main_~lk1~0 1)} assume 0 != ~p1~0; {773#(= main_~lk1~0 1)} is VALID [2022-04-08 14:57:33,381 INFO L290 TraceCheckUtils]: 23: Hoare triple {773#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {769#false} is VALID [2022-04-08 14:57:33,382 INFO L290 TraceCheckUtils]: 24: Hoare triple {769#false} assume !false; {769#false} is VALID [2022-04-08 14:57:33,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:57:33,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:57:33,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228940443] [2022-04-08 14:57:33,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228940443] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:33,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:33,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:33,383 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:57:33,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1448619311] [2022-04-08 14:57:33,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1448619311] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:33,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:33,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:33,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100298505] [2022-04-08 14:57:33,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:57:33,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 14:57:33,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:57:33,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:33,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:33,404 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:57:33,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:33,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:57:33,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:57:33,405 INFO L87 Difference]: Start difference. First operand 95 states and 175 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:33,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:33,645 INFO L93 Difference]: Finished difference Result 98 states and 178 transitions. [2022-04-08 14:57:33,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:57:33,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 14:57:33,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:57:33,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:33,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-08 14:57:33,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:33,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-08 14:57:33,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 123 transitions. [2022-04-08 14:57:33,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:33,777 INFO L225 Difference]: With dead ends: 98 [2022-04-08 14:57:33,777 INFO L226 Difference]: Without dead ends: 96 [2022-04-08 14:57:33,778 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:57:33,781 INFO L913 BasicCegarLoop]: 92 mSDtfsCounter, 128 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:57:33,782 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 99 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:57:33,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-08 14:57:33,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-04-08 14:57:33,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:57:33,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 96 states, 92 states have (on average 1.8804347826086956) internal successors, (173), 92 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:33,796 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 96 states, 92 states have (on average 1.8804347826086956) internal successors, (173), 92 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:33,797 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 96 states, 92 states have (on average 1.8804347826086956) internal successors, (173), 92 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:33,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:33,804 INFO L93 Difference]: Finished difference Result 96 states and 176 transitions. [2022-04-08 14:57:33,804 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 176 transitions. [2022-04-08 14:57:33,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:33,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:33,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 92 states have (on average 1.8804347826086956) internal successors, (173), 92 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 96 states. [2022-04-08 14:57:33,806 INFO L87 Difference]: Start difference. First operand has 96 states, 92 states have (on average 1.8804347826086956) internal successors, (173), 92 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 96 states. [2022-04-08 14:57:33,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:33,810 INFO L93 Difference]: Finished difference Result 96 states and 176 transitions. [2022-04-08 14:57:33,810 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 176 transitions. [2022-04-08 14:57:33,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:33,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:33,813 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:57:33,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:57:33,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 92 states have (on average 1.8804347826086956) internal successors, (173), 92 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:33,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 176 transitions. [2022-04-08 14:57:33,819 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 176 transitions. Word has length 25 [2022-04-08 14:57:33,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:57:33,820 INFO L478 AbstractCegarLoop]: Abstraction has 96 states and 176 transitions. [2022-04-08 14:57:33,820 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:33,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 176 transitions. [2022-04-08 14:57:33,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:33,965 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 176 transitions. [2022-04-08 14:57:33,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 14:57:33,965 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:57:33,965 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:57:33,966 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 14:57:33,967 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:57:33,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:57:33,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1994873615, now seen corresponding path program 1 times [2022-04-08 14:57:33,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:33,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1860169973] [2022-04-08 14:57:33,974 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:57:33,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1994873615, now seen corresponding path program 2 times [2022-04-08 14:57:33,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:57:33,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960054558] [2022-04-08 14:57:33,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:57:33,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:57:34,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 14:57:34,015 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 14:57:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 14:57:34,050 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 14:57:34,051 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-08 14:57:34,051 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-08 14:57:34,053 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 14:57:34,054 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 14:57:34,057 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2] [2022-04-08 14:57:34,059 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 14:57:34,070 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 14:57:34,071 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-08 14:57:34,071 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 14:57:34,071 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 14:57:34,071 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-08 14:57:34,071 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 14:57:34,071 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 14:57:34,071 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 14:57:34,071 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 14:57:34,071 WARN L170 areAnnotationChecker]: L211 has no Hoare annotation [2022-04-08 14:57:34,071 WARN L170 areAnnotationChecker]: L211 has no Hoare annotation [2022-04-08 14:57:34,071 WARN L170 areAnnotationChecker]: L211 has no Hoare annotation [2022-04-08 14:57:34,071 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-08 14:57:34,071 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-08 14:57:34,071 WARN L170 areAnnotationChecker]: L217 has no Hoare annotation [2022-04-08 14:57:34,071 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-04-08 14:57:34,072 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-04-08 14:57:34,072 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-08 14:57:34,072 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-04-08 14:57:34,072 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-04-08 14:57:34,072 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-08 14:57:34,072 WARN L170 areAnnotationChecker]: L88-2 has no Hoare annotation [2022-04-08 14:57:34,072 WARN L170 areAnnotationChecker]: L88-2 has no Hoare annotation [2022-04-08 14:57:34,072 WARN L170 areAnnotationChecker]: L92-1 has no Hoare annotation [2022-04-08 14:57:34,072 WARN L170 areAnnotationChecker]: L92-1 has no Hoare annotation [2022-04-08 14:57:34,072 WARN L170 areAnnotationChecker]: L96-1 has no Hoare annotation [2022-04-08 14:57:34,072 WARN L170 areAnnotationChecker]: L96-1 has no Hoare annotation [2022-04-08 14:57:34,072 WARN L170 areAnnotationChecker]: L100-1 has no Hoare annotation [2022-04-08 14:57:34,072 WARN L170 areAnnotationChecker]: L100-1 has no Hoare annotation [2022-04-08 14:57:34,072 WARN L170 areAnnotationChecker]: L104-1 has no Hoare annotation [2022-04-08 14:57:34,072 WARN L170 areAnnotationChecker]: L104-1 has no Hoare annotation [2022-04-08 14:57:34,073 WARN L170 areAnnotationChecker]: L108-1 has no Hoare annotation [2022-04-08 14:57:34,073 WARN L170 areAnnotationChecker]: L108-1 has no Hoare annotation [2022-04-08 14:57:34,073 WARN L170 areAnnotationChecker]: L112-1 has no Hoare annotation [2022-04-08 14:57:34,073 WARN L170 areAnnotationChecker]: L112-1 has no Hoare annotation [2022-04-08 14:57:34,073 WARN L170 areAnnotationChecker]: L116-1 has no Hoare annotation [2022-04-08 14:57:34,073 WARN L170 areAnnotationChecker]: L116-1 has no Hoare annotation [2022-04-08 14:57:34,073 WARN L170 areAnnotationChecker]: L120-1 has no Hoare annotation [2022-04-08 14:57:34,073 WARN L170 areAnnotationChecker]: L120-1 has no Hoare annotation [2022-04-08 14:57:34,073 WARN L170 areAnnotationChecker]: L124-1 has no Hoare annotation [2022-04-08 14:57:34,073 WARN L170 areAnnotationChecker]: L124-1 has no Hoare annotation [2022-04-08 14:57:34,073 WARN L170 areAnnotationChecker]: L128-1 has no Hoare annotation [2022-04-08 14:57:34,073 WARN L170 areAnnotationChecker]: L128-1 has no Hoare annotation [2022-04-08 14:57:34,073 WARN L170 areAnnotationChecker]: L132-1 has no Hoare annotation [2022-04-08 14:57:34,073 WARN L170 areAnnotationChecker]: L132-1 has no Hoare annotation [2022-04-08 14:57:34,073 WARN L170 areAnnotationChecker]: L136-1 has no Hoare annotation [2022-04-08 14:57:34,073 WARN L170 areAnnotationChecker]: L136-1 has no Hoare annotation [2022-04-08 14:57:34,073 WARN L170 areAnnotationChecker]: L140-1 has no Hoare annotation [2022-04-08 14:57:34,074 WARN L170 areAnnotationChecker]: L140-1 has no Hoare annotation [2022-04-08 14:57:34,074 WARN L170 areAnnotationChecker]: L147 has no Hoare annotation [2022-04-08 14:57:34,074 WARN L170 areAnnotationChecker]: L147 has no Hoare annotation [2022-04-08 14:57:34,074 WARN L170 areAnnotationChecker]: L146-1 has no Hoare annotation [2022-04-08 14:57:34,074 WARN L170 areAnnotationChecker]: L146-1 has no Hoare annotation [2022-04-08 14:57:34,074 WARN L170 areAnnotationChecker]: L214 has no Hoare annotation [2022-04-08 14:57:34,074 WARN L170 areAnnotationChecker]: L214 has no Hoare annotation [2022-04-08 14:57:34,074 WARN L170 areAnnotationChecker]: L152 has no Hoare annotation [2022-04-08 14:57:34,074 WARN L170 areAnnotationChecker]: L152 has no Hoare annotation [2022-04-08 14:57:34,074 WARN L170 areAnnotationChecker]: L151 has no Hoare annotation [2022-04-08 14:57:34,074 WARN L170 areAnnotationChecker]: L151 has no Hoare annotation [2022-04-08 14:57:34,074 WARN L170 areAnnotationChecker]: L157 has no Hoare annotation [2022-04-08 14:57:34,074 WARN L170 areAnnotationChecker]: L157 has no Hoare annotation [2022-04-08 14:57:34,074 WARN L170 areAnnotationChecker]: L156-1 has no Hoare annotation [2022-04-08 14:57:34,074 WARN L170 areAnnotationChecker]: L156-1 has no Hoare annotation [2022-04-08 14:57:34,074 WARN L170 areAnnotationChecker]: L162 has no Hoare annotation [2022-04-08 14:57:34,075 WARN L170 areAnnotationChecker]: L162 has no Hoare annotation [2022-04-08 14:57:34,075 WARN L170 areAnnotationChecker]: L161-1 has no Hoare annotation [2022-04-08 14:57:34,075 WARN L170 areAnnotationChecker]: L161-1 has no Hoare annotation [2022-04-08 14:57:34,075 WARN L170 areAnnotationChecker]: L167 has no Hoare annotation [2022-04-08 14:57:34,075 WARN L170 areAnnotationChecker]: L167 has no Hoare annotation [2022-04-08 14:57:34,075 WARN L170 areAnnotationChecker]: L166-1 has no Hoare annotation [2022-04-08 14:57:34,075 WARN L170 areAnnotationChecker]: L166-1 has no Hoare annotation [2022-04-08 14:57:34,075 WARN L170 areAnnotationChecker]: L172 has no Hoare annotation [2022-04-08 14:57:34,075 WARN L170 areAnnotationChecker]: L172 has no Hoare annotation [2022-04-08 14:57:34,075 WARN L170 areAnnotationChecker]: L171-1 has no Hoare annotation [2022-04-08 14:57:34,075 WARN L170 areAnnotationChecker]: L171-1 has no Hoare annotation [2022-04-08 14:57:34,075 WARN L170 areAnnotationChecker]: L177 has no Hoare annotation [2022-04-08 14:57:34,075 WARN L170 areAnnotationChecker]: L177 has no Hoare annotation [2022-04-08 14:57:34,075 WARN L170 areAnnotationChecker]: L176-1 has no Hoare annotation [2022-04-08 14:57:34,075 WARN L170 areAnnotationChecker]: L176-1 has no Hoare annotation [2022-04-08 14:57:34,075 WARN L170 areAnnotationChecker]: L182 has no Hoare annotation [2022-04-08 14:57:34,075 WARN L170 areAnnotationChecker]: L182 has no Hoare annotation [2022-04-08 14:57:34,075 WARN L170 areAnnotationChecker]: L181-1 has no Hoare annotation [2022-04-08 14:57:34,076 WARN L170 areAnnotationChecker]: L181-1 has no Hoare annotation [2022-04-08 14:57:34,076 WARN L170 areAnnotationChecker]: L187 has no Hoare annotation [2022-04-08 14:57:34,076 WARN L170 areAnnotationChecker]: L187 has no Hoare annotation [2022-04-08 14:57:34,076 WARN L170 areAnnotationChecker]: L186-1 has no Hoare annotation [2022-04-08 14:57:34,076 WARN L170 areAnnotationChecker]: L186-1 has no Hoare annotation [2022-04-08 14:57:34,076 WARN L170 areAnnotationChecker]: L192 has no Hoare annotation [2022-04-08 14:57:34,076 WARN L170 areAnnotationChecker]: L192 has no Hoare annotation [2022-04-08 14:57:34,076 WARN L170 areAnnotationChecker]: L191-1 has no Hoare annotation [2022-04-08 14:57:34,076 WARN L170 areAnnotationChecker]: L191-1 has no Hoare annotation [2022-04-08 14:57:34,076 WARN L170 areAnnotationChecker]: L197 has no Hoare annotation [2022-04-08 14:57:34,076 WARN L170 areAnnotationChecker]: L197 has no Hoare annotation [2022-04-08 14:57:34,076 WARN L170 areAnnotationChecker]: L196-1 has no Hoare annotation [2022-04-08 14:57:34,076 WARN L170 areAnnotationChecker]: L196-1 has no Hoare annotation [2022-04-08 14:57:34,076 WARN L170 areAnnotationChecker]: L202 has no Hoare annotation [2022-04-08 14:57:34,076 WARN L170 areAnnotationChecker]: L202 has no Hoare annotation [2022-04-08 14:57:34,076 WARN L170 areAnnotationChecker]: L201-1 has no Hoare annotation [2022-04-08 14:57:34,076 WARN L170 areAnnotationChecker]: L201-1 has no Hoare annotation [2022-04-08 14:57:34,077 WARN L170 areAnnotationChecker]: L207 has no Hoare annotation [2022-04-08 14:57:34,077 WARN L170 areAnnotationChecker]: L207 has no Hoare annotation [2022-04-08 14:57:34,077 WARN L170 areAnnotationChecker]: L206-1 has no Hoare annotation [2022-04-08 14:57:34,077 WARN L170 areAnnotationChecker]: L206-1 has no Hoare annotation [2022-04-08 14:57:34,077 WARN L170 areAnnotationChecker]: L212 has no Hoare annotation [2022-04-08 14:57:34,077 WARN L170 areAnnotationChecker]: L212 has no Hoare annotation [2022-04-08 14:57:34,077 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 14:57:34,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 02:57:34 BoogieIcfgContainer [2022-04-08 14:57:34,078 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 14:57:34,079 INFO L158 Benchmark]: Toolchain (without parser) took 3031.67ms. Allocated memory is still 196.1MB. Free memory was 146.3MB in the beginning and 83.5MB in the end (delta: 62.8MB). Peak memory consumption was 61.7MB. Max. memory is 8.0GB. [2022-04-08 14:57:34,080 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 196.1MB. Free memory is still 162.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 14:57:34,080 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.88ms. Allocated memory is still 196.1MB. Free memory was 146.1MB in the beginning and 173.3MB in the end (delta: -27.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 14:57:34,081 INFO L158 Benchmark]: Boogie Preprocessor took 50.52ms. Allocated memory is still 196.1MB. Free memory was 173.3MB in the beginning and 171.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 14:57:34,081 INFO L158 Benchmark]: RCFGBuilder took 425.87ms. Allocated memory is still 196.1MB. Free memory was 171.8MB in the beginning and 155.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-04-08 14:57:34,081 INFO L158 Benchmark]: TraceAbstraction took 2296.13ms. Allocated memory is still 196.1MB. Free memory was 154.5MB in the beginning and 83.5MB in the end (delta: 70.9MB). Peak memory consumption was 70.4MB. Max. memory is 8.0GB. [2022-04-08 14:57:34,083 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 196.1MB. Free memory is still 162.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 251.88ms. Allocated memory is still 196.1MB. Free memory was 146.1MB in the beginning and 173.3MB in the end (delta: -27.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.52ms. Allocated memory is still 196.1MB. Free memory was 173.3MB in the beginning and 171.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 425.87ms. Allocated memory is still 196.1MB. Free memory was 171.8MB in the beginning and 155.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 2296.13ms. Allocated memory is still 196.1MB. Free memory was 154.5MB in the beginning and 83.5MB in the end (delta: 70.9MB). Peak memory consumption was 70.4MB. 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 - CounterExampleResult [Line: 219]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L51] int cond; [L53] COND TRUE 1 [L54] cond = __VERIFIER_nondet_int() [L55] COND FALSE !(cond == 0) [L58] lk1 = 0 [L60] lk2 = 0 [L62] lk3 = 0 [L64] lk4 = 0 [L66] lk5 = 0 [L68] lk6 = 0 [L70] lk7 = 0 [L72] lk8 = 0 [L74] lk9 = 0 [L76] lk10 = 0 [L78] lk11 = 0 [L80] lk12 = 0 [L82] lk13 = 0 [L84] lk14 = 0 [L88] COND FALSE !(p1 != 0) [L92] COND FALSE !(p2 != 0) [L96] COND TRUE p3 != 0 [L97] lk3 = 1 [L100] COND TRUE p4 != 0 [L101] lk4 = 1 [L104] COND TRUE p5 != 0 [L105] lk5 = 1 [L108] COND TRUE p6 != 0 [L109] lk6 = 1 [L112] COND TRUE p7 != 0 [L113] lk7 = 1 [L116] COND TRUE p8 != 0 [L117] lk8 = 1 [L120] COND TRUE p9 != 0 [L121] lk9 = 1 [L124] COND FALSE !(p10 != 0) [L128] COND TRUE p11 != 0 [L129] lk11 = 1 [L132] COND TRUE p12 != 0 [L133] lk12 = 1 [L136] COND TRUE p13 != 0 [L137] lk13 = 1 [L140] COND TRUE p14 != 0 [L141] lk14 = 1 [L146] COND FALSE !(p1 != 0) [L151] COND FALSE !(p2 != 0) [L219] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 321 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 321 mSDsluCounter, 263 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 183 IncrementalHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 247 mSDtfsCounter, 183 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=2, InterpolantAutomatonStates: 8, 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, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 proved your program to be incorrect! [2022-04-08 14:57:34,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...