/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/locks/test_locks_5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 15:10:12,378 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 15:10:12,386 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 15:10:12,420 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 15:10:12,421 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 15:10:12,421 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 15:10:12,422 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 15:10:12,424 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 15:10:12,425 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 15:10:12,426 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 15:10:12,426 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 15:10:12,427 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 15:10:12,427 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 15:10:12,428 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 15:10:12,428 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 15:10:12,429 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 15:10:12,429 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 15:10:12,443 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 15:10:12,444 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 15:10:12,445 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 15:10:12,446 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 15:10:12,447 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 15:10:12,447 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 15:10:12,448 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 15:10:12,448 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 15:10:12,450 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 15:10:12,450 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 15:10:12,451 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 15:10:12,451 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 15:10:12,451 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 15:10:12,452 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 15:10:12,452 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 15:10:12,452 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 15:10:12,453 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 15:10:12,453 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 15:10:12,454 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 15:10:12,454 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 15:10:12,454 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 15:10:12,454 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 15:10:12,455 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 15:10:12,455 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 15:10:12,456 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 15:10:12,456 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 15:10:12,469 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 15:10:12,469 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 15:10:12,469 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 15:10:12,470 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 15:10:12,470 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 15:10:12,470 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 15:10:12,470 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 15:10:12,471 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 15:10:12,471 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 15:10:12,471 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 15:10:12,487 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 15:10:12,487 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 15:10:12,487 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 15:10:12,487 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 15:10:12,488 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 15:10:12,488 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 15:10:12,488 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 15:10:12,488 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 15:10:12,488 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 15:10:12,488 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 15:10:12,488 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 15:10:12,488 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 15:10:12,488 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 15:10:12,489 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 15:10:12,489 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:10:12,489 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 15:10:12,489 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 15:10:12,489 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 15:10:12,489 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 15:10:12,489 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 15:10:12,489 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 15:10:12,490 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 15:10:12,490 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 15:10:12,490 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-27 15:10:12,660 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 15:10:12,680 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 15:10:12,682 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 15:10:12,682 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 15:10:12,683 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 15:10:12,684 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_5.c [2022-04-27 15:10:12,748 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be3b786b4/967896a1fa354f03945f1b764c299472/FLAG8807eb63a [2022-04-27 15:10:13,130 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 15:10:13,130 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c [2022-04-27 15:10:13,136 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be3b786b4/967896a1fa354f03945f1b764c299472/FLAG8807eb63a [2022-04-27 15:10:13,148 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be3b786b4/967896a1fa354f03945f1b764c299472 [2022-04-27 15:10:13,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 15:10:13,153 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 15:10:13,153 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 15:10:13,154 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 15:10:13,156 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 15:10:13,160 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:10:13" (1/1) ... [2022-04-27 15:10:13,160 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@681f9c3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:13, skipping insertion in model container [2022-04-27 15:10:13,160 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:10:13" (1/1) ... [2022-04-27 15:10:13,165 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 15:10:13,176 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 15:10:13,338 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_5.c[2207,2220] [2022-04-27 15:10:13,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:10:13,344 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 15:10:13,367 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_5.c[2207,2220] [2022-04-27 15:10:13,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:10:13,379 INFO L208 MainTranslator]: Completed translation [2022-04-27 15:10:13,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:13 WrapperNode [2022-04-27 15:10:13,379 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 15:10:13,380 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 15:10:13,380 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 15:10:13,380 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 15:10:13,386 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:13" (1/1) ... [2022-04-27 15:10:13,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:13" (1/1) ... [2022-04-27 15:10:13,390 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:13" (1/1) ... [2022-04-27 15:10:13,391 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:13" (1/1) ... [2022-04-27 15:10:13,401 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:13" (1/1) ... [2022-04-27 15:10:13,406 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:13" (1/1) ... [2022-04-27 15:10:13,409 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:13" (1/1) ... [2022-04-27 15:10:13,411 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 15:10:13,411 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 15:10:13,412 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 15:10:13,412 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 15:10:13,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:13" (1/1) ... [2022-04-27 15:10:13,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:10:13,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:10:13,445 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-27 15:10:13,459 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-27 15:10:13,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 15:10:13,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 15:10:13,486 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 15:10:13,486 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 15:10:13,487 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 15:10:13,488 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 15:10:13,488 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 15:10:13,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 15:10:13,488 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 15:10:13,488 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 15:10:13,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 15:10:13,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 15:10:13,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 15:10:13,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 15:10:13,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 15:10:13,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 15:10:13,557 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 15:10:13,558 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 15:10:13,770 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 15:10:13,787 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 15:10:13,787 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 15:10:13,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:10:13 BoogieIcfgContainer [2022-04-27 15:10:13,788 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 15:10:13,789 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 15:10:13,789 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 15:10:13,805 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 15:10:13,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 03:10:13" (1/3) ... [2022-04-27 15:10:13,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aa24962 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:10:13, skipping insertion in model container [2022-04-27 15:10:13,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:13" (2/3) ... [2022-04-27 15:10:13,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aa24962 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:10:13, skipping insertion in model container [2022-04-27 15:10:13,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:10:13" (3/3) ... [2022-04-27 15:10:13,807 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_5.c [2022-04-27 15:10:13,815 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 15:10:13,835 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 15:10:13,911 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 15:10:13,915 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=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5ed3b90d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7e4f30cd [2022-04-27 15:10:13,916 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 15:10:13,933 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 25 states have internal predecessors, (43), 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-27 15:10:13,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 15:10:13,946 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:13,946 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:13,946 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:13,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:13,950 INFO L85 PathProgramCache]: Analyzing trace with hash -663266717, now seen corresponding path program 1 times [2022-04-27 15:10:13,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:13,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096900651] [2022-04-27 15:10:13,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:13,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:14,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:14,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:14,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:14,179 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(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(15, 2);call #Ultimate.allocInit(12, 3); {33#true} is VALID [2022-04-27 15:10:14,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-27 15:10:14,179 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #115#return; {33#true} is VALID [2022-04-27 15:10:14,181 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:14,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(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(15, 2);call #Ultimate.allocInit(12, 3); {33#true} is VALID [2022-04-27 15:10:14,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-27 15:10:14,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #115#return; {33#true} is VALID [2022-04-27 15:10:14,182 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret10 := main(); {33#true} is VALID [2022-04-27 15:10:14,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#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;havoc ~cond~0; {33#true} is VALID [2022-04-27 15:10:14,183 INFO L290 TraceCheckUtils]: 6: Hoare triple {33#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {33#true} is VALID [2022-04-27 15:10:14,183 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {33#true} is VALID [2022-04-27 15:10:14,184 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 != ~p1~0;~lk1~0 := 1; {38#(= main_~lk1~0 1)} is VALID [2022-04-27 15:10:14,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {38#(= main_~lk1~0 1)} is VALID [2022-04-27 15:10:14,185 INFO L290 TraceCheckUtils]: 10: Hoare triple {38#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {38#(= main_~lk1~0 1)} is VALID [2022-04-27 15:10:14,186 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {38#(= main_~lk1~0 1)} is VALID [2022-04-27 15:10:14,186 INFO L290 TraceCheckUtils]: 12: Hoare triple {38#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {38#(= main_~lk1~0 1)} is VALID [2022-04-27 15:10:14,190 INFO L290 TraceCheckUtils]: 13: Hoare triple {38#(= main_~lk1~0 1)} assume 0 != ~p1~0; {38#(= main_~lk1~0 1)} is VALID [2022-04-27 15:10:14,191 INFO L290 TraceCheckUtils]: 14: Hoare triple {38#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {34#false} is VALID [2022-04-27 15:10:14,191 INFO L290 TraceCheckUtils]: 15: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-27 15:10:14,191 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-27 15:10:14,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:14,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096900651] [2022-04-27 15:10:14,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096900651] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:14,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:14,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:14,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041067461] [2022-04-27 15:10:14,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:14,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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 16 [2022-04-27 15:10:14,201 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:14,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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-27 15:10:14,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:14,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:14,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:14,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:14,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:14,245 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 25 states have internal predecessors, (43), 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 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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-27 15:10:14,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:14,433 INFO L93 Difference]: Finished difference Result 58 states and 91 transitions. [2022-04-27 15:10:14,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:14,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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 16 [2022-04-27 15:10:14,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:14,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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-27 15:10:14,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-27 15:10:14,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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-27 15:10:14,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-27 15:10:14,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 91 transitions. [2022-04-27 15:10:14,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:14,520 INFO L225 Difference]: With dead ends: 58 [2022-04-27 15:10:14,520 INFO L226 Difference]: Without dead ends: 43 [2022-04-27 15:10:14,522 INFO L412 NwaCegarLoop]: 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-27 15:10:14,524 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 89 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:14,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 59 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:14,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-27 15:10:14,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2022-04-27 15:10:14,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:14,543 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 31 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 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-27 15:10:14,544 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 31 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 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-27 15:10:14,544 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 31 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 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-27 15:10:14,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:14,547 INFO L93 Difference]: Finished difference Result 43 states and 69 transitions. [2022-04-27 15:10:14,547 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 69 transitions. [2022-04-27 15:10:14,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:14,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:14,548 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 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 43 states. [2022-04-27 15:10:14,548 INFO L87 Difference]: Start difference. First operand has 31 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 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 43 states. [2022-04-27 15:10:14,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:14,551 INFO L93 Difference]: Finished difference Result 43 states and 69 transitions. [2022-04-27 15:10:14,551 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 69 transitions. [2022-04-27 15:10:14,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:14,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:14,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:14,552 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:14,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 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-27 15:10:14,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 50 transitions. [2022-04-27 15:10:14,554 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 50 transitions. Word has length 16 [2022-04-27 15:10:14,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:14,555 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 50 transitions. [2022-04-27 15:10:14,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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-27 15:10:14,555 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 50 transitions. [2022-04-27 15:10:14,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 15:10:14,556 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:14,556 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:14,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 15:10:14,556 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:14,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:14,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1472613343, now seen corresponding path program 1 times [2022-04-27 15:10:14,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:14,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951388577] [2022-04-27 15:10:14,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:14,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:14,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:14,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:14,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {244#(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(15, 2);call #Ultimate.allocInit(12, 3); {238#true} is VALID [2022-04-27 15:10:14,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {238#true} assume true; {238#true} is VALID [2022-04-27 15:10:14,597 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {238#true} {238#true} #115#return; {238#true} is VALID [2022-04-27 15:10:14,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {238#true} call ULTIMATE.init(); {244#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:14,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {244#(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(15, 2);call #Ultimate.allocInit(12, 3); {238#true} is VALID [2022-04-27 15:10:14,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {238#true} assume true; {238#true} is VALID [2022-04-27 15:10:14,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {238#true} {238#true} #115#return; {238#true} is VALID [2022-04-27 15:10:14,598 INFO L272 TraceCheckUtils]: 4: Hoare triple {238#true} call #t~ret10 := main(); {238#true} is VALID [2022-04-27 15:10:14,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {238#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;havoc ~cond~0; {238#true} is VALID [2022-04-27 15:10:14,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {238#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {238#true} is VALID [2022-04-27 15:10:14,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {238#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {238#true} is VALID [2022-04-27 15:10:14,599 INFO L290 TraceCheckUtils]: 8: Hoare triple {238#true} assume !(0 != ~p1~0); {243#(= main_~p1~0 0)} is VALID [2022-04-27 15:10:14,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {243#(= main_~p1~0 0)} assume !(0 != ~p2~0); {243#(= main_~p1~0 0)} is VALID [2022-04-27 15:10:14,600 INFO L290 TraceCheckUtils]: 10: Hoare triple {243#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {243#(= main_~p1~0 0)} is VALID [2022-04-27 15:10:14,600 INFO L290 TraceCheckUtils]: 11: Hoare triple {243#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {243#(= main_~p1~0 0)} is VALID [2022-04-27 15:10:14,600 INFO L290 TraceCheckUtils]: 12: Hoare triple {243#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {243#(= main_~p1~0 0)} is VALID [2022-04-27 15:10:14,601 INFO L290 TraceCheckUtils]: 13: Hoare triple {243#(= main_~p1~0 0)} assume 0 != ~p1~0; {239#false} is VALID [2022-04-27 15:10:14,601 INFO L290 TraceCheckUtils]: 14: Hoare triple {239#false} assume 1 != ~lk1~0; {239#false} is VALID [2022-04-27 15:10:14,601 INFO L290 TraceCheckUtils]: 15: Hoare triple {239#false} assume !false; {239#false} is VALID [2022-04-27 15:10:14,601 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-27 15:10:14,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:14,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951388577] [2022-04-27 15:10:14,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951388577] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:14,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:14,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:14,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506041911] [2022-04-27 15:10:14,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:14,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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 16 [2022-04-27 15:10:14,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:14,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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-27 15:10:14,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:14,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:14,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:14,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:14,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:14,615 INFO L87 Difference]: Start difference. First operand 31 states and 50 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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-27 15:10:14,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:14,705 INFO L93 Difference]: Finished difference Result 68 states and 113 transitions. [2022-04-27 15:10:14,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:14,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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 16 [2022-04-27 15:10:14,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:14,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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-27 15:10:14,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2022-04-27 15:10:14,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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-27 15:10:14,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2022-04-27 15:10:14,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 102 transitions. [2022-04-27 15:10:14,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:14,843 INFO L225 Difference]: With dead ends: 68 [2022-04-27 15:10:14,843 INFO L226 Difference]: Without dead ends: 43 [2022-04-27 15:10:14,844 INFO L412 NwaCegarLoop]: 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-27 15:10:14,845 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 73 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:14,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 55 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:14,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-27 15:10:14,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2022-04-27 15:10:14,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:14,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 41 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 states have internal predecessors, (63), 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-27 15:10:14,850 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 41 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 states have internal predecessors, (63), 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-27 15:10:14,850 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 41 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 states have internal predecessors, (63), 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-27 15:10:14,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:14,852 INFO L93 Difference]: Finished difference Result 43 states and 67 transitions. [2022-04-27 15:10:14,852 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 67 transitions. [2022-04-27 15:10:14,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:14,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:14,868 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 states have internal predecessors, (63), 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 43 states. [2022-04-27 15:10:14,868 INFO L87 Difference]: Start difference. First operand has 41 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 states have internal predecessors, (63), 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 43 states. [2022-04-27 15:10:14,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:14,870 INFO L93 Difference]: Finished difference Result 43 states and 67 transitions. [2022-04-27 15:10:14,870 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 67 transitions. [2022-04-27 15:10:14,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:14,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:14,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:14,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:14,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 states have internal predecessors, (63), 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-27 15:10:14,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 66 transitions. [2022-04-27 15:10:14,873 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 66 transitions. Word has length 16 [2022-04-27 15:10:14,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:14,873 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 66 transitions. [2022-04-27 15:10:14,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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-27 15:10:14,873 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 66 transitions. [2022-04-27 15:10:14,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 15:10:14,874 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:14,874 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:14,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 15:10:14,874 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:14,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:14,875 INFO L85 PathProgramCache]: Analyzing trace with hash 913783256, now seen corresponding path program 1 times [2022-04-27 15:10:14,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:14,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320963360] [2022-04-27 15:10:14,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:14,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:14,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:14,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:14,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {468#(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(15, 2);call #Ultimate.allocInit(12, 3); {462#true} is VALID [2022-04-27 15:10:14,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {462#true} assume true; {462#true} is VALID [2022-04-27 15:10:14,939 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {462#true} {462#true} #115#return; {462#true} is VALID [2022-04-27 15:10:14,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {462#true} call ULTIMATE.init(); {468#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:14,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {468#(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(15, 2);call #Ultimate.allocInit(12, 3); {462#true} is VALID [2022-04-27 15:10:14,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {462#true} assume true; {462#true} is VALID [2022-04-27 15:10:14,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {462#true} {462#true} #115#return; {462#true} is VALID [2022-04-27 15:10:14,940 INFO L272 TraceCheckUtils]: 4: Hoare triple {462#true} call #t~ret10 := main(); {462#true} is VALID [2022-04-27 15:10:14,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {462#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;havoc ~cond~0; {462#true} is VALID [2022-04-27 15:10:14,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {462#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {462#true} is VALID [2022-04-27 15:10:14,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {462#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {462#true} is VALID [2022-04-27 15:10:14,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {462#true} assume 0 != ~p1~0;~lk1~0 := 1; {467#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:10:14,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {467#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {467#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:10:14,942 INFO L290 TraceCheckUtils]: 10: Hoare triple {467#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {467#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:10:14,942 INFO L290 TraceCheckUtils]: 11: Hoare triple {467#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {467#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:10:14,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {467#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {467#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:10:14,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {467#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {463#false} is VALID [2022-04-27 15:10:14,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {463#false} assume 0 != ~p2~0; {463#false} is VALID [2022-04-27 15:10:14,943 INFO L290 TraceCheckUtils]: 15: Hoare triple {463#false} assume 1 != ~lk2~0; {463#false} is VALID [2022-04-27 15:10:14,943 INFO L290 TraceCheckUtils]: 16: Hoare triple {463#false} assume !false; {463#false} is VALID [2022-04-27 15:10:14,944 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-27 15:10:14,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:14,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320963360] [2022-04-27 15:10:14,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320963360] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:14,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:14,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:14,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512673698] [2022-04-27 15:10:14,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:14,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 17 [2022-04-27 15:10:14,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:14,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-27 15:10:14,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:14,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:14,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:14,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:14,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:14,957 INFO L87 Difference]: Start difference. First operand 41 states and 66 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-27 15:10:15,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:15,039 INFO L93 Difference]: Finished difference Result 64 states and 100 transitions. [2022-04-27 15:10:15,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:15,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 17 [2022-04-27 15:10:15,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:15,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-27 15:10:15,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2022-04-27 15:10:15,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-27 15:10:15,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2022-04-27 15:10:15,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 97 transitions. [2022-04-27 15:10:15,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:15,117 INFO L225 Difference]: With dead ends: 64 [2022-04-27 15:10:15,117 INFO L226 Difference]: Without dead ends: 46 [2022-04-27 15:10:15,117 INFO L412 NwaCegarLoop]: 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-27 15:10:15,118 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 66 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:15,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 63 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:15,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-27 15:10:15,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2022-04-27 15:10:15,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:15,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 44 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 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-27 15:10:15,122 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 44 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 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-27 15:10:15,122 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 44 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 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-27 15:10:15,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:15,124 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2022-04-27 15:10:15,124 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 69 transitions. [2022-04-27 15:10:15,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:15,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:15,125 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 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 46 states. [2022-04-27 15:10:15,125 INFO L87 Difference]: Start difference. First operand has 44 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 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 46 states. [2022-04-27 15:10:15,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:15,126 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2022-04-27 15:10:15,127 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 69 transitions. [2022-04-27 15:10:15,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:15,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:15,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:15,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:15,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 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-27 15:10:15,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 68 transitions. [2022-04-27 15:10:15,129 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 68 transitions. Word has length 17 [2022-04-27 15:10:15,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:15,129 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 68 transitions. [2022-04-27 15:10:15,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-27 15:10:15,129 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 68 transitions. [2022-04-27 15:10:15,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 15:10:15,130 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:15,130 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:15,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 15:10:15,130 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:15,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:15,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1593841626, now seen corresponding path program 1 times [2022-04-27 15:10:15,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:15,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429607787] [2022-04-27 15:10:15,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:15,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:15,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:15,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:15,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:15,177 INFO L290 TraceCheckUtils]: 0: Hoare triple {699#(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(15, 2);call #Ultimate.allocInit(12, 3); {693#true} is VALID [2022-04-27 15:10:15,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {693#true} assume true; {693#true} is VALID [2022-04-27 15:10:15,177 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {693#true} {693#true} #115#return; {693#true} is VALID [2022-04-27 15:10:15,178 INFO L272 TraceCheckUtils]: 0: Hoare triple {693#true} call ULTIMATE.init(); {699#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:15,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {699#(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(15, 2);call #Ultimate.allocInit(12, 3); {693#true} is VALID [2022-04-27 15:10:15,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {693#true} assume true; {693#true} is VALID [2022-04-27 15:10:15,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {693#true} {693#true} #115#return; {693#true} is VALID [2022-04-27 15:10:15,179 INFO L272 TraceCheckUtils]: 4: Hoare triple {693#true} call #t~ret10 := main(); {693#true} is VALID [2022-04-27 15:10:15,179 INFO L290 TraceCheckUtils]: 5: Hoare triple {693#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;havoc ~cond~0; {693#true} is VALID [2022-04-27 15:10:15,179 INFO L290 TraceCheckUtils]: 6: Hoare triple {693#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {693#true} is VALID [2022-04-27 15:10:15,179 INFO L290 TraceCheckUtils]: 7: Hoare triple {693#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {693#true} is VALID [2022-04-27 15:10:15,179 INFO L290 TraceCheckUtils]: 8: Hoare triple {693#true} assume !(0 != ~p1~0); {693#true} is VALID [2022-04-27 15:10:15,180 INFO L290 TraceCheckUtils]: 9: Hoare triple {693#true} assume !(0 != ~p2~0); {698#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:15,180 INFO L290 TraceCheckUtils]: 10: Hoare triple {698#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {698#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:15,180 INFO L290 TraceCheckUtils]: 11: Hoare triple {698#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {698#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:15,181 INFO L290 TraceCheckUtils]: 12: Hoare triple {698#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {698#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:15,181 INFO L290 TraceCheckUtils]: 13: Hoare triple {698#(= main_~p2~0 0)} assume !(0 != ~p1~0); {698#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:15,181 INFO L290 TraceCheckUtils]: 14: Hoare triple {698#(= main_~p2~0 0)} assume 0 != ~p2~0; {694#false} is VALID [2022-04-27 15:10:15,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {694#false} assume 1 != ~lk2~0; {694#false} is VALID [2022-04-27 15:10:15,182 INFO L290 TraceCheckUtils]: 16: Hoare triple {694#false} assume !false; {694#false} is VALID [2022-04-27 15:10:15,182 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-27 15:10:15,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:15,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429607787] [2022-04-27 15:10:15,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429607787] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:15,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:15,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:15,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43982647] [2022-04-27 15:10:15,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:15,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 17 [2022-04-27 15:10:15,184 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:15,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-27 15:10:15,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:15,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:15,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:15,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:15,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:15,195 INFO L87 Difference]: Start difference. First operand 44 states and 68 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-27 15:10:15,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:15,276 INFO L93 Difference]: Finished difference Result 112 states and 180 transitions. [2022-04-27 15:10:15,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:15,276 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 17 [2022-04-27 15:10:15,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:15,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-27 15:10:15,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-04-27 15:10:15,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-27 15:10:15,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-04-27 15:10:15,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 100 transitions. [2022-04-27 15:10:15,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:15,349 INFO L225 Difference]: With dead ends: 112 [2022-04-27 15:10:15,349 INFO L226 Difference]: Without dead ends: 77 [2022-04-27 15:10:15,349 INFO L412 NwaCegarLoop]: 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-27 15:10:15,356 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 78 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:15,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 49 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:15,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-27 15:10:15,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2022-04-27 15:10:15,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:15,366 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 75 states, 71 states have (on average 1.6056338028169015) internal successors, (114), 71 states have internal predecessors, (114), 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-27 15:10:15,366 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 75 states, 71 states have (on average 1.6056338028169015) internal successors, (114), 71 states have internal predecessors, (114), 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-27 15:10:15,366 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 75 states, 71 states have (on average 1.6056338028169015) internal successors, (114), 71 states have internal predecessors, (114), 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-27 15:10:15,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:15,368 INFO L93 Difference]: Finished difference Result 77 states and 118 transitions. [2022-04-27 15:10:15,368 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 118 transitions. [2022-04-27 15:10:15,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:15,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:15,369 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 71 states have (on average 1.6056338028169015) internal successors, (114), 71 states have internal predecessors, (114), 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 77 states. [2022-04-27 15:10:15,369 INFO L87 Difference]: Start difference. First operand has 75 states, 71 states have (on average 1.6056338028169015) internal successors, (114), 71 states have internal predecessors, (114), 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 77 states. [2022-04-27 15:10:15,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:15,371 INFO L93 Difference]: Finished difference Result 77 states and 118 transitions. [2022-04-27 15:10:15,371 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 118 transitions. [2022-04-27 15:10:15,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:15,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:15,372 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:15,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:15,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 71 states have (on average 1.6056338028169015) internal successors, (114), 71 states have internal predecessors, (114), 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-27 15:10:15,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 117 transitions. [2022-04-27 15:10:15,373 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 117 transitions. Word has length 17 [2022-04-27 15:10:15,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:15,374 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 117 transitions. [2022-04-27 15:10:15,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-27 15:10:15,374 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 117 transitions. [2022-04-27 15:10:15,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 15:10:15,374 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:15,374 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:15,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 15:10:15,375 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:15,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:15,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1891779044, now seen corresponding path program 1 times [2022-04-27 15:10:15,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:15,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409521700] [2022-04-27 15:10:15,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:15,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:15,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:15,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:15,433 INFO L290 TraceCheckUtils]: 0: Hoare triple {1076#(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(15, 2);call #Ultimate.allocInit(12, 3); {1070#true} is VALID [2022-04-27 15:10:15,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {1070#true} assume true; {1070#true} is VALID [2022-04-27 15:10:15,434 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1070#true} {1070#true} #115#return; {1070#true} is VALID [2022-04-27 15:10:15,434 INFO L272 TraceCheckUtils]: 0: Hoare triple {1070#true} call ULTIMATE.init(); {1076#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:15,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {1076#(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(15, 2);call #Ultimate.allocInit(12, 3); {1070#true} is VALID [2022-04-27 15:10:15,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {1070#true} assume true; {1070#true} is VALID [2022-04-27 15:10:15,435 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1070#true} {1070#true} #115#return; {1070#true} is VALID [2022-04-27 15:10:15,435 INFO L272 TraceCheckUtils]: 4: Hoare triple {1070#true} call #t~ret10 := main(); {1070#true} is VALID [2022-04-27 15:10:15,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {1070#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;havoc ~cond~0; {1070#true} is VALID [2022-04-27 15:10:15,436 INFO L290 TraceCheckUtils]: 6: Hoare triple {1070#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {1070#true} is VALID [2022-04-27 15:10:15,437 INFO L290 TraceCheckUtils]: 7: Hoare triple {1070#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {1070#true} is VALID [2022-04-27 15:10:15,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {1070#true} assume !(0 != ~p1~0); {1070#true} is VALID [2022-04-27 15:10:15,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {1070#true} assume 0 != ~p2~0;~lk2~0 := 1; {1075#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:15,438 INFO L290 TraceCheckUtils]: 10: Hoare triple {1075#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {1075#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:15,438 INFO L290 TraceCheckUtils]: 11: Hoare triple {1075#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {1075#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:15,438 INFO L290 TraceCheckUtils]: 12: Hoare triple {1075#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {1075#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:15,439 INFO L290 TraceCheckUtils]: 13: Hoare triple {1075#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {1075#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:15,439 INFO L290 TraceCheckUtils]: 14: Hoare triple {1075#(= main_~lk2~0 1)} assume 0 != ~p2~0; {1075#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:15,439 INFO L290 TraceCheckUtils]: 15: Hoare triple {1075#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {1071#false} is VALID [2022-04-27 15:10:15,439 INFO L290 TraceCheckUtils]: 16: Hoare triple {1071#false} assume !false; {1071#false} is VALID [2022-04-27 15:10:15,440 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-27 15:10:15,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:15,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409521700] [2022-04-27 15:10:15,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409521700] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:15,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:15,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:15,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42748580] [2022-04-27 15:10:15,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:15,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 17 [2022-04-27 15:10:15,441 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:15,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-27 15:10:15,451 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:15,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:15,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:15,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:15,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:15,451 INFO L87 Difference]: Start difference. First operand 75 states and 117 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-27 15:10:15,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:15,524 INFO L93 Difference]: Finished difference Result 95 states and 147 transitions. [2022-04-27 15:10:15,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:15,525 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 17 [2022-04-27 15:10:15,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:15,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-27 15:10:15,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-27 15:10:15,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-27 15:10:15,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-27 15:10:15,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 64 transitions. [2022-04-27 15:10:15,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:15,568 INFO L225 Difference]: With dead ends: 95 [2022-04-27 15:10:15,568 INFO L226 Difference]: Without dead ends: 93 [2022-04-27 15:10:15,569 INFO L412 NwaCegarLoop]: 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-27 15:10:15,569 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 51 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:15,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 68 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:15,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-27 15:10:15,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 75. [2022-04-27 15:10:15,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:15,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 75 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 71 states have internal predecessors, (112), 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-27 15:10:15,573 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 75 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 71 states have internal predecessors, (112), 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-27 15:10:15,573 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 75 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 71 states have internal predecessors, (112), 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-27 15:10:15,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:15,575 INFO L93 Difference]: Finished difference Result 93 states and 144 transitions. [2022-04-27 15:10:15,575 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 144 transitions. [2022-04-27 15:10:15,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:15,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:15,576 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 71 states have internal predecessors, (112), 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 93 states. [2022-04-27 15:10:15,576 INFO L87 Difference]: Start difference. First operand has 75 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 71 states have internal predecessors, (112), 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 93 states. [2022-04-27 15:10:15,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:15,578 INFO L93 Difference]: Finished difference Result 93 states and 144 transitions. [2022-04-27 15:10:15,578 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 144 transitions. [2022-04-27 15:10:15,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:15,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:15,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:15,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:15,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 71 states have internal predecessors, (112), 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-27 15:10:15,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 115 transitions. [2022-04-27 15:10:15,581 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 115 transitions. Word has length 17 [2022-04-27 15:10:15,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:15,581 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 115 transitions. [2022-04-27 15:10:15,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-27 15:10:15,581 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 115 transitions. [2022-04-27 15:10:15,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 15:10:15,582 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:15,582 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:15,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 15:10:15,582 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:15,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:15,582 INFO L85 PathProgramCache]: Analyzing trace with hash -2130301802, now seen corresponding path program 1 times [2022-04-27 15:10:15,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:15,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866408937] [2022-04-27 15:10:15,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:15,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:15,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:15,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:15,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:15,607 INFO L290 TraceCheckUtils]: 0: Hoare triple {1468#(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(15, 2);call #Ultimate.allocInit(12, 3); {1462#true} is VALID [2022-04-27 15:10:15,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {1462#true} assume true; {1462#true} is VALID [2022-04-27 15:10:15,607 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1462#true} {1462#true} #115#return; {1462#true} is VALID [2022-04-27 15:10:15,608 INFO L272 TraceCheckUtils]: 0: Hoare triple {1462#true} call ULTIMATE.init(); {1468#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:15,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {1468#(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(15, 2);call #Ultimate.allocInit(12, 3); {1462#true} is VALID [2022-04-27 15:10:15,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {1462#true} assume true; {1462#true} is VALID [2022-04-27 15:10:15,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1462#true} {1462#true} #115#return; {1462#true} is VALID [2022-04-27 15:10:15,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {1462#true} call #t~ret10 := main(); {1462#true} is VALID [2022-04-27 15:10:15,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {1462#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;havoc ~cond~0; {1462#true} is VALID [2022-04-27 15:10:15,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {1462#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {1462#true} is VALID [2022-04-27 15:10:15,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {1462#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {1462#true} is VALID [2022-04-27 15:10:15,609 INFO L290 TraceCheckUtils]: 8: Hoare triple {1462#true} assume !(0 != ~p1~0); {1462#true} is VALID [2022-04-27 15:10:15,609 INFO L290 TraceCheckUtils]: 9: Hoare triple {1462#true} assume !(0 != ~p2~0); {1462#true} is VALID [2022-04-27 15:10:15,609 INFO L290 TraceCheckUtils]: 10: Hoare triple {1462#true} assume 0 != ~p3~0;~lk3~0 := 1; {1467#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:15,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {1467#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {1467#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:15,610 INFO L290 TraceCheckUtils]: 12: Hoare triple {1467#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {1467#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:15,610 INFO L290 TraceCheckUtils]: 13: Hoare triple {1467#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {1467#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:15,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {1467#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {1467#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:15,611 INFO L290 TraceCheckUtils]: 15: Hoare triple {1467#(= main_~lk3~0 1)} assume 0 != ~p3~0; {1467#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:15,611 INFO L290 TraceCheckUtils]: 16: Hoare triple {1467#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {1463#false} is VALID [2022-04-27 15:10:15,611 INFO L290 TraceCheckUtils]: 17: Hoare triple {1463#false} assume !false; {1463#false} is VALID [2022-04-27 15:10:15,611 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-27 15:10:15,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:15,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866408937] [2022-04-27 15:10:15,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866408937] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:15,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:15,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:15,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647160725] [2022-04-27 15:10:15,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:15,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 18 [2022-04-27 15:10:15,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:15,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-27 15:10:15,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:15,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:15,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:15,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:15,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:15,623 INFO L87 Difference]: Start difference. First operand 75 states and 115 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-27 15:10:15,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:15,698 INFO L93 Difference]: Finished difference Result 131 states and 203 transitions. [2022-04-27 15:10:15,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:15,698 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 18 [2022-04-27 15:10:15,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:15,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-27 15:10:15,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-04-27 15:10:15,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-27 15:10:15,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-04-27 15:10:15,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 63 transitions. [2022-04-27 15:10:15,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:15,740 INFO L225 Difference]: With dead ends: 131 [2022-04-27 15:10:15,740 INFO L226 Difference]: Without dead ends: 129 [2022-04-27 15:10:15,740 INFO L412 NwaCegarLoop]: 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-27 15:10:15,741 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 69 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:15,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 46 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:15,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-27 15:10:15,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 103. [2022-04-27 15:10:15,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:15,745 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 103 states, 99 states have (on average 1.5555555555555556) internal successors, (154), 99 states have internal predecessors, (154), 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-27 15:10:15,746 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 103 states, 99 states have (on average 1.5555555555555556) internal successors, (154), 99 states have internal predecessors, (154), 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-27 15:10:15,746 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 103 states, 99 states have (on average 1.5555555555555556) internal successors, (154), 99 states have internal predecessors, (154), 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-27 15:10:15,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:15,749 INFO L93 Difference]: Finished difference Result 129 states and 198 transitions. [2022-04-27 15:10:15,749 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 198 transitions. [2022-04-27 15:10:15,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:15,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:15,749 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 99 states have (on average 1.5555555555555556) internal successors, (154), 99 states have internal predecessors, (154), 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 129 states. [2022-04-27 15:10:15,749 INFO L87 Difference]: Start difference. First operand has 103 states, 99 states have (on average 1.5555555555555556) internal successors, (154), 99 states have internal predecessors, (154), 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 129 states. [2022-04-27 15:10:15,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:15,752 INFO L93 Difference]: Finished difference Result 129 states and 198 transitions. [2022-04-27 15:10:15,752 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 198 transitions. [2022-04-27 15:10:15,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:15,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:15,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:15,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:15,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 99 states have (on average 1.5555555555555556) internal successors, (154), 99 states have internal predecessors, (154), 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-27 15:10:15,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 157 transitions. [2022-04-27 15:10:15,755 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 157 transitions. Word has length 18 [2022-04-27 15:10:15,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:15,755 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 157 transitions. [2022-04-27 15:10:15,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-27 15:10:15,755 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 157 transitions. [2022-04-27 15:10:15,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 15:10:15,755 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:15,756 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:15,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 15:10:15,756 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:15,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:15,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1355318868, now seen corresponding path program 1 times [2022-04-27 15:10:15,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:15,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863975338] [2022-04-27 15:10:15,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:15,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:15,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:15,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:15,781 INFO L290 TraceCheckUtils]: 0: Hoare triple {1998#(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(15, 2);call #Ultimate.allocInit(12, 3); {1992#true} is VALID [2022-04-27 15:10:15,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {1992#true} assume true; {1992#true} is VALID [2022-04-27 15:10:15,781 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1992#true} {1992#true} #115#return; {1992#true} is VALID [2022-04-27 15:10:15,782 INFO L272 TraceCheckUtils]: 0: Hoare triple {1992#true} call ULTIMATE.init(); {1998#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:15,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {1998#(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(15, 2);call #Ultimate.allocInit(12, 3); {1992#true} is VALID [2022-04-27 15:10:15,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {1992#true} assume true; {1992#true} is VALID [2022-04-27 15:10:15,782 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1992#true} {1992#true} #115#return; {1992#true} is VALID [2022-04-27 15:10:15,782 INFO L272 TraceCheckUtils]: 4: Hoare triple {1992#true} call #t~ret10 := main(); {1992#true} is VALID [2022-04-27 15:10:15,782 INFO L290 TraceCheckUtils]: 5: Hoare triple {1992#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;havoc ~cond~0; {1992#true} is VALID [2022-04-27 15:10:15,782 INFO L290 TraceCheckUtils]: 6: Hoare triple {1992#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {1992#true} is VALID [2022-04-27 15:10:15,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {1992#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {1992#true} is VALID [2022-04-27 15:10:15,783 INFO L290 TraceCheckUtils]: 8: Hoare triple {1992#true} assume !(0 != ~p1~0); {1992#true} is VALID [2022-04-27 15:10:15,783 INFO L290 TraceCheckUtils]: 9: Hoare triple {1992#true} assume !(0 != ~p2~0); {1992#true} is VALID [2022-04-27 15:10:15,783 INFO L290 TraceCheckUtils]: 10: Hoare triple {1992#true} assume !(0 != ~p3~0); {1997#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:15,783 INFO L290 TraceCheckUtils]: 11: Hoare triple {1997#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1997#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:15,784 INFO L290 TraceCheckUtils]: 12: Hoare triple {1997#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1997#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:15,784 INFO L290 TraceCheckUtils]: 13: Hoare triple {1997#(= main_~p3~0 0)} assume !(0 != ~p1~0); {1997#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:15,784 INFO L290 TraceCheckUtils]: 14: Hoare triple {1997#(= main_~p3~0 0)} assume !(0 != ~p2~0); {1997#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:15,785 INFO L290 TraceCheckUtils]: 15: Hoare triple {1997#(= main_~p3~0 0)} assume 0 != ~p3~0; {1993#false} is VALID [2022-04-27 15:10:15,785 INFO L290 TraceCheckUtils]: 16: Hoare triple {1993#false} assume 1 != ~lk3~0; {1993#false} is VALID [2022-04-27 15:10:15,785 INFO L290 TraceCheckUtils]: 17: Hoare triple {1993#false} assume !false; {1993#false} is VALID [2022-04-27 15:10:15,785 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-27 15:10:15,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:15,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863975338] [2022-04-27 15:10:15,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863975338] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:15,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:15,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:15,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47340334] [2022-04-27 15:10:15,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:15,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 18 [2022-04-27 15:10:15,786 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:15,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-27 15:10:15,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:15,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:15,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:15,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:15,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:15,796 INFO L87 Difference]: Start difference. First operand 103 states and 157 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-27 15:10:15,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:15,870 INFO L93 Difference]: Finished difference Result 231 states and 355 transitions. [2022-04-27 15:10:15,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:15,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 18 [2022-04-27 15:10:15,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:15,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-27 15:10:15,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2022-04-27 15:10:15,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-27 15:10:15,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2022-04-27 15:10:15,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 96 transitions. [2022-04-27 15:10:15,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:15,928 INFO L225 Difference]: With dead ends: 231 [2022-04-27 15:10:15,928 INFO L226 Difference]: Without dead ends: 137 [2022-04-27 15:10:15,928 INFO L412 NwaCegarLoop]: 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-27 15:10:15,929 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 61 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:15,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 59 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:15,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-27 15:10:15,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2022-04-27 15:10:15,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:15,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 135 states, 131 states have (on average 1.4961832061068703) internal successors, (196), 131 states have internal predecessors, (196), 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-27 15:10:15,934 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 135 states, 131 states have (on average 1.4961832061068703) internal successors, (196), 131 states have internal predecessors, (196), 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-27 15:10:15,934 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 135 states, 131 states have (on average 1.4961832061068703) internal successors, (196), 131 states have internal predecessors, (196), 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-27 15:10:15,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:15,937 INFO L93 Difference]: Finished difference Result 137 states and 200 transitions. [2022-04-27 15:10:15,937 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2022-04-27 15:10:15,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:15,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:15,937 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 131 states have (on average 1.4961832061068703) internal successors, (196), 131 states have internal predecessors, (196), 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 137 states. [2022-04-27 15:10:15,937 INFO L87 Difference]: Start difference. First operand has 135 states, 131 states have (on average 1.4961832061068703) internal successors, (196), 131 states have internal predecessors, (196), 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 137 states. [2022-04-27 15:10:15,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:15,940 INFO L93 Difference]: Finished difference Result 137 states and 200 transitions. [2022-04-27 15:10:15,940 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2022-04-27 15:10:15,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:15,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:15,940 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:15,940 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:15,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 131 states have (on average 1.4961832061068703) internal successors, (196), 131 states have internal predecessors, (196), 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-27 15:10:15,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 199 transitions. [2022-04-27 15:10:15,943 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 199 transitions. Word has length 18 [2022-04-27 15:10:15,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:15,943 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 199 transitions. [2022-04-27 15:10:15,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-27 15:10:15,943 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 199 transitions. [2022-04-27 15:10:15,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 15:10:15,944 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:15,944 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:15,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-27 15:10:15,944 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:15,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:15,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1614630737, now seen corresponding path program 1 times [2022-04-27 15:10:15,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:15,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132969259] [2022-04-27 15:10:15,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:15,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:15,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:15,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:15,969 INFO L290 TraceCheckUtils]: 0: Hoare triple {2684#(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(15, 2);call #Ultimate.allocInit(12, 3); {2678#true} is VALID [2022-04-27 15:10:15,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {2678#true} assume true; {2678#true} is VALID [2022-04-27 15:10:15,969 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2678#true} {2678#true} #115#return; {2678#true} is VALID [2022-04-27 15:10:15,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {2678#true} call ULTIMATE.init(); {2684#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:15,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {2684#(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(15, 2);call #Ultimate.allocInit(12, 3); {2678#true} is VALID [2022-04-27 15:10:15,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {2678#true} assume true; {2678#true} is VALID [2022-04-27 15:10:15,970 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2678#true} {2678#true} #115#return; {2678#true} is VALID [2022-04-27 15:10:15,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {2678#true} call #t~ret10 := main(); {2678#true} is VALID [2022-04-27 15:10:15,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {2678#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;havoc ~cond~0; {2678#true} is VALID [2022-04-27 15:10:15,970 INFO L290 TraceCheckUtils]: 6: Hoare triple {2678#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {2678#true} is VALID [2022-04-27 15:10:15,970 INFO L290 TraceCheckUtils]: 7: Hoare triple {2678#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {2678#true} is VALID [2022-04-27 15:10:15,970 INFO L290 TraceCheckUtils]: 8: Hoare triple {2678#true} assume !(0 != ~p1~0); {2678#true} is VALID [2022-04-27 15:10:15,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {2678#true} assume !(0 != ~p2~0); {2678#true} is VALID [2022-04-27 15:10:15,970 INFO L290 TraceCheckUtils]: 10: Hoare triple {2678#true} assume 0 != ~p3~0;~lk3~0 := 1; {2683#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:15,971 INFO L290 TraceCheckUtils]: 11: Hoare triple {2683#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {2683#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:15,971 INFO L290 TraceCheckUtils]: 12: Hoare triple {2683#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {2683#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:15,971 INFO L290 TraceCheckUtils]: 13: Hoare triple {2683#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {2683#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:15,971 INFO L290 TraceCheckUtils]: 14: Hoare triple {2683#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {2683#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:15,972 INFO L290 TraceCheckUtils]: 15: Hoare triple {2683#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {2679#false} is VALID [2022-04-27 15:10:15,972 INFO L290 TraceCheckUtils]: 16: Hoare triple {2679#false} assume 0 != ~p4~0; {2679#false} is VALID [2022-04-27 15:10:15,972 INFO L290 TraceCheckUtils]: 17: Hoare triple {2679#false} assume 1 != ~lk4~0; {2679#false} is VALID [2022-04-27 15:10:15,972 INFO L290 TraceCheckUtils]: 18: Hoare triple {2679#false} assume !false; {2679#false} is VALID [2022-04-27 15:10:15,972 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-27 15:10:15,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:15,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132969259] [2022-04-27 15:10:15,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132969259] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:15,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:15,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:15,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652924014] [2022-04-27 15:10:15,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:15,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 19 [2022-04-27 15:10:15,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:15,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-27 15:10:15,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:15,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:15,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:15,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:15,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:15,984 INFO L87 Difference]: Start difference. First operand 135 states and 199 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-27 15:10:16,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:16,075 INFO L93 Difference]: Finished difference Result 205 states and 301 transitions. [2022-04-27 15:10:16,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:16,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 19 [2022-04-27 15:10:16,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:16,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-27 15:10:16,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-27 15:10:16,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-27 15:10:16,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-27 15:10:16,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 91 transitions. [2022-04-27 15:10:16,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:16,131 INFO L225 Difference]: With dead ends: 205 [2022-04-27 15:10:16,131 INFO L226 Difference]: Without dead ends: 143 [2022-04-27 15:10:16,131 INFO L412 NwaCegarLoop]: 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-27 15:10:16,132 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:16,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 57 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:16,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-04-27 15:10:16,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2022-04-27 15:10:16,136 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:16,136 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand has 141 states, 137 states have (on average 1.4598540145985401) internal successors, (200), 137 states have internal predecessors, (200), 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-27 15:10:16,136 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand has 141 states, 137 states have (on average 1.4598540145985401) internal successors, (200), 137 states have internal predecessors, (200), 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-27 15:10:16,136 INFO L87 Difference]: Start difference. First operand 143 states. Second operand has 141 states, 137 states have (on average 1.4598540145985401) internal successors, (200), 137 states have internal predecessors, (200), 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-27 15:10:16,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:16,139 INFO L93 Difference]: Finished difference Result 143 states and 204 transitions. [2022-04-27 15:10:16,139 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 204 transitions. [2022-04-27 15:10:16,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:16,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:16,139 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 137 states have (on average 1.4598540145985401) internal successors, (200), 137 states have internal predecessors, (200), 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 143 states. [2022-04-27 15:10:16,140 INFO L87 Difference]: Start difference. First operand has 141 states, 137 states have (on average 1.4598540145985401) internal successors, (200), 137 states have internal predecessors, (200), 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 143 states. [2022-04-27 15:10:16,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:16,142 INFO L93 Difference]: Finished difference Result 143 states and 204 transitions. [2022-04-27 15:10:16,142 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 204 transitions. [2022-04-27 15:10:16,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:16,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:16,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:16,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:16,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 137 states have (on average 1.4598540145985401) internal successors, (200), 137 states have internal predecessors, (200), 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-27 15:10:16,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 203 transitions. [2022-04-27 15:10:16,145 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 203 transitions. Word has length 19 [2022-04-27 15:10:16,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:16,145 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 203 transitions. [2022-04-27 15:10:16,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-27 15:10:16,145 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 203 transitions. [2022-04-27 15:10:16,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 15:10:16,146 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:16,146 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:16,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-27 15:10:16,146 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:16,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:16,146 INFO L85 PathProgramCache]: Analyzing trace with hash -934572367, now seen corresponding path program 1 times [2022-04-27 15:10:16,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:16,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587330786] [2022-04-27 15:10:16,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:16,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:16,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:16,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:16,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {3362#(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(15, 2);call #Ultimate.allocInit(12, 3); {3356#true} is VALID [2022-04-27 15:10:16,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {3356#true} assume true; {3356#true} is VALID [2022-04-27 15:10:16,168 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3356#true} {3356#true} #115#return; {3356#true} is VALID [2022-04-27 15:10:16,169 INFO L272 TraceCheckUtils]: 0: Hoare triple {3356#true} call ULTIMATE.init(); {3362#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:16,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {3362#(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(15, 2);call #Ultimate.allocInit(12, 3); {3356#true} is VALID [2022-04-27 15:10:16,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {3356#true} assume true; {3356#true} is VALID [2022-04-27 15:10:16,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3356#true} {3356#true} #115#return; {3356#true} is VALID [2022-04-27 15:10:16,169 INFO L272 TraceCheckUtils]: 4: Hoare triple {3356#true} call #t~ret10 := main(); {3356#true} is VALID [2022-04-27 15:10:16,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {3356#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;havoc ~cond~0; {3356#true} is VALID [2022-04-27 15:10:16,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {3356#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {3356#true} is VALID [2022-04-27 15:10:16,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {3356#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {3356#true} is VALID [2022-04-27 15:10:16,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {3356#true} assume !(0 != ~p1~0); {3356#true} is VALID [2022-04-27 15:10:16,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {3356#true} assume !(0 != ~p2~0); {3356#true} is VALID [2022-04-27 15:10:16,170 INFO L290 TraceCheckUtils]: 10: Hoare triple {3356#true} assume !(0 != ~p3~0); {3356#true} is VALID [2022-04-27 15:10:16,170 INFO L290 TraceCheckUtils]: 11: Hoare triple {3356#true} assume 0 != ~p4~0;~lk4~0 := 1; {3361#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:16,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {3361#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {3361#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:16,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {3361#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {3361#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:16,171 INFO L290 TraceCheckUtils]: 14: Hoare triple {3361#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {3361#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:16,171 INFO L290 TraceCheckUtils]: 15: Hoare triple {3361#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {3361#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:16,171 INFO L290 TraceCheckUtils]: 16: Hoare triple {3361#(= main_~lk4~0 1)} assume 0 != ~p4~0; {3361#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:16,172 INFO L290 TraceCheckUtils]: 17: Hoare triple {3361#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {3357#false} is VALID [2022-04-27 15:10:16,172 INFO L290 TraceCheckUtils]: 18: Hoare triple {3357#false} assume !false; {3357#false} is VALID [2022-04-27 15:10:16,172 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-27 15:10:16,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:16,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587330786] [2022-04-27 15:10:16,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587330786] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:16,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:16,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:16,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509866215] [2022-04-27 15:10:16,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:16,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 19 [2022-04-27 15:10:16,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:16,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-27 15:10:16,183 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:16,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:16,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:16,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:16,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:16,183 INFO L87 Difference]: Start difference. First operand 141 states and 203 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-27 15:10:16,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:16,251 INFO L93 Difference]: Finished difference Result 237 states and 341 transitions. [2022-04-27 15:10:16,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:16,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 19 [2022-04-27 15:10:16,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:16,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-27 15:10:16,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-04-27 15:10:16,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-27 15:10:16,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-04-27 15:10:16,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 59 transitions. [2022-04-27 15:10:16,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:16,292 INFO L225 Difference]: With dead ends: 237 [2022-04-27 15:10:16,292 INFO L226 Difference]: Without dead ends: 235 [2022-04-27 15:10:16,293 INFO L412 NwaCegarLoop]: 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-27 15:10:16,293 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 62 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:16,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 45 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:16,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-04-27 15:10:16,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 201. [2022-04-27 15:10:16,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:16,301 INFO L82 GeneralOperation]: Start isEquivalent. First operand 235 states. Second operand has 201 states, 197 states have (on average 1.4213197969543148) internal successors, (280), 197 states have internal predecessors, (280), 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-27 15:10:16,301 INFO L74 IsIncluded]: Start isIncluded. First operand 235 states. Second operand has 201 states, 197 states have (on average 1.4213197969543148) internal successors, (280), 197 states have internal predecessors, (280), 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-27 15:10:16,301 INFO L87 Difference]: Start difference. First operand 235 states. Second operand has 201 states, 197 states have (on average 1.4213197969543148) internal successors, (280), 197 states have internal predecessors, (280), 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-27 15:10:16,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:16,305 INFO L93 Difference]: Finished difference Result 235 states and 332 transitions. [2022-04-27 15:10:16,305 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 332 transitions. [2022-04-27 15:10:16,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:16,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:16,306 INFO L74 IsIncluded]: Start isIncluded. First operand has 201 states, 197 states have (on average 1.4213197969543148) internal successors, (280), 197 states have internal predecessors, (280), 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 235 states. [2022-04-27 15:10:16,306 INFO L87 Difference]: Start difference. First operand has 201 states, 197 states have (on average 1.4213197969543148) internal successors, (280), 197 states have internal predecessors, (280), 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 235 states. [2022-04-27 15:10:16,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:16,310 INFO L93 Difference]: Finished difference Result 235 states and 332 transitions. [2022-04-27 15:10:16,310 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 332 transitions. [2022-04-27 15:10:16,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:16,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:16,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:16,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:16,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 197 states have (on average 1.4213197969543148) internal successors, (280), 197 states have internal predecessors, (280), 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-27 15:10:16,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 283 transitions. [2022-04-27 15:10:16,313 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 283 transitions. Word has length 19 [2022-04-27 15:10:16,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:16,314 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 283 transitions. [2022-04-27 15:10:16,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-27 15:10:16,314 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 283 transitions. [2022-04-27 15:10:16,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 15:10:16,314 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:16,314 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:16,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-27 15:10:16,314 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:16,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:16,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1743918993, now seen corresponding path program 1 times [2022-04-27 15:10:16,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:16,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595774966] [2022-04-27 15:10:16,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:16,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:16,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:16,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:16,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:16,351 INFO L290 TraceCheckUtils]: 0: Hoare triple {4320#(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(15, 2);call #Ultimate.allocInit(12, 3); {4314#true} is VALID [2022-04-27 15:10:16,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {4314#true} assume true; {4314#true} is VALID [2022-04-27 15:10:16,352 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4314#true} {4314#true} #115#return; {4314#true} is VALID [2022-04-27 15:10:16,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {4314#true} call ULTIMATE.init(); {4320#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:16,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {4320#(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(15, 2);call #Ultimate.allocInit(12, 3); {4314#true} is VALID [2022-04-27 15:10:16,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {4314#true} assume true; {4314#true} is VALID [2022-04-27 15:10:16,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4314#true} {4314#true} #115#return; {4314#true} is VALID [2022-04-27 15:10:16,355 INFO L272 TraceCheckUtils]: 4: Hoare triple {4314#true} call #t~ret10 := main(); {4314#true} is VALID [2022-04-27 15:10:16,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {4314#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;havoc ~cond~0; {4314#true} is VALID [2022-04-27 15:10:16,355 INFO L290 TraceCheckUtils]: 6: Hoare triple {4314#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {4314#true} is VALID [2022-04-27 15:10:16,355 INFO L290 TraceCheckUtils]: 7: Hoare triple {4314#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {4314#true} is VALID [2022-04-27 15:10:16,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {4314#true} assume !(0 != ~p1~0); {4314#true} is VALID [2022-04-27 15:10:16,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {4314#true} assume !(0 != ~p2~0); {4314#true} is VALID [2022-04-27 15:10:16,355 INFO L290 TraceCheckUtils]: 10: Hoare triple {4314#true} assume !(0 != ~p3~0); {4314#true} is VALID [2022-04-27 15:10:16,356 INFO L290 TraceCheckUtils]: 11: Hoare triple {4314#true} assume !(0 != ~p4~0); {4319#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:16,356 INFO L290 TraceCheckUtils]: 12: Hoare triple {4319#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {4319#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:16,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {4319#(= main_~p4~0 0)} assume !(0 != ~p1~0); {4319#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:16,360 INFO L290 TraceCheckUtils]: 14: Hoare triple {4319#(= main_~p4~0 0)} assume !(0 != ~p2~0); {4319#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:16,360 INFO L290 TraceCheckUtils]: 15: Hoare triple {4319#(= main_~p4~0 0)} assume !(0 != ~p3~0); {4319#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:16,361 INFO L290 TraceCheckUtils]: 16: Hoare triple {4319#(= main_~p4~0 0)} assume 0 != ~p4~0; {4315#false} is VALID [2022-04-27 15:10:16,361 INFO L290 TraceCheckUtils]: 17: Hoare triple {4315#false} assume 1 != ~lk4~0; {4315#false} is VALID [2022-04-27 15:10:16,361 INFO L290 TraceCheckUtils]: 18: Hoare triple {4315#false} assume !false; {4315#false} is VALID [2022-04-27 15:10:16,361 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-27 15:10:16,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:16,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595774966] [2022-04-27 15:10:16,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595774966] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:16,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:16,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:16,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811779468] [2022-04-27 15:10:16,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:16,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 19 [2022-04-27 15:10:16,362 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:16,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-27 15:10:16,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:16,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:16,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:16,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:16,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:16,372 INFO L87 Difference]: Start difference. First operand 201 states and 283 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-27 15:10:16,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:16,454 INFO L93 Difference]: Finished difference Result 445 states and 621 transitions. [2022-04-27 15:10:16,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:16,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 19 [2022-04-27 15:10:16,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:16,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-27 15:10:16,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2022-04-27 15:10:16,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-27 15:10:16,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2022-04-27 15:10:16,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 93 transitions. [2022-04-27 15:10:16,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:16,512 INFO L225 Difference]: With dead ends: 445 [2022-04-27 15:10:16,512 INFO L226 Difference]: Without dead ends: 259 [2022-04-27 15:10:16,512 INFO L412 NwaCegarLoop]: 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-27 15:10:16,513 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 55 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:16,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 61 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:16,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-04-27 15:10:16,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2022-04-27 15:10:16,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:16,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 259 states. Second operand has 257 states, 253 states have (on average 1.3438735177865613) internal successors, (340), 253 states have internal predecessors, (340), 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-27 15:10:16,519 INFO L74 IsIncluded]: Start isIncluded. First operand 259 states. Second operand has 257 states, 253 states have (on average 1.3438735177865613) internal successors, (340), 253 states have internal predecessors, (340), 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-27 15:10:16,519 INFO L87 Difference]: Start difference. First operand 259 states. Second operand has 257 states, 253 states have (on average 1.3438735177865613) internal successors, (340), 253 states have internal predecessors, (340), 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-27 15:10:16,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:16,522 INFO L93 Difference]: Finished difference Result 259 states and 344 transitions. [2022-04-27 15:10:16,522 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 344 transitions. [2022-04-27 15:10:16,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:16,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:16,523 INFO L74 IsIncluded]: Start isIncluded. First operand has 257 states, 253 states have (on average 1.3438735177865613) internal successors, (340), 253 states have internal predecessors, (340), 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 259 states. [2022-04-27 15:10:16,523 INFO L87 Difference]: Start difference. First operand has 257 states, 253 states have (on average 1.3438735177865613) internal successors, (340), 253 states have internal predecessors, (340), 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 259 states. [2022-04-27 15:10:16,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:16,527 INFO L93 Difference]: Finished difference Result 259 states and 344 transitions. [2022-04-27 15:10:16,527 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 344 transitions. [2022-04-27 15:10:16,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:16,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:16,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:16,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:16,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 253 states have (on average 1.3438735177865613) internal successors, (340), 253 states have internal predecessors, (340), 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-27 15:10:16,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 343 transitions. [2022-04-27 15:10:16,531 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 343 transitions. Word has length 19 [2022-04-27 15:10:16,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:16,531 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 343 transitions. [2022-04-27 15:10:16,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-27 15:10:16,531 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 343 transitions. [2022-04-27 15:10:16,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 15:10:16,531 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:16,532 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:16,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-27 15:10:16,532 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:16,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:16,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1093243721, now seen corresponding path program 1 times [2022-04-27 15:10:16,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:16,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292813540] [2022-04-27 15:10:16,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:16,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:16,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:16,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {5606#(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(15, 2);call #Ultimate.allocInit(12, 3); {5600#true} is VALID [2022-04-27 15:10:16,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {5600#true} assume true; {5600#true} is VALID [2022-04-27 15:10:16,553 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5600#true} {5600#true} #115#return; {5600#true} is VALID [2022-04-27 15:10:16,554 INFO L272 TraceCheckUtils]: 0: Hoare triple {5600#true} call ULTIMATE.init(); {5606#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:16,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {5606#(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(15, 2);call #Ultimate.allocInit(12, 3); {5600#true} is VALID [2022-04-27 15:10:16,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {5600#true} assume true; {5600#true} is VALID [2022-04-27 15:10:16,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5600#true} {5600#true} #115#return; {5600#true} is VALID [2022-04-27 15:10:16,554 INFO L272 TraceCheckUtils]: 4: Hoare triple {5600#true} call #t~ret10 := main(); {5600#true} is VALID [2022-04-27 15:10:16,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {5600#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;havoc ~cond~0; {5600#true} is VALID [2022-04-27 15:10:16,554 INFO L290 TraceCheckUtils]: 6: Hoare triple {5600#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {5600#true} is VALID [2022-04-27 15:10:16,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {5600#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {5600#true} is VALID [2022-04-27 15:10:16,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {5600#true} assume !(0 != ~p1~0); {5600#true} is VALID [2022-04-27 15:10:16,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {5600#true} assume !(0 != ~p2~0); {5600#true} is VALID [2022-04-27 15:10:16,555 INFO L290 TraceCheckUtils]: 10: Hoare triple {5600#true} assume !(0 != ~p3~0); {5600#true} is VALID [2022-04-27 15:10:16,555 INFO L290 TraceCheckUtils]: 11: Hoare triple {5600#true} assume 0 != ~p4~0;~lk4~0 := 1; {5605#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:16,555 INFO L290 TraceCheckUtils]: 12: Hoare triple {5605#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {5605#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:16,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {5605#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {5605#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:16,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {5605#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {5605#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:16,556 INFO L290 TraceCheckUtils]: 15: Hoare triple {5605#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {5605#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:16,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {5605#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {5601#false} is VALID [2022-04-27 15:10:16,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {5601#false} assume 0 != ~p5~0; {5601#false} is VALID [2022-04-27 15:10:16,557 INFO L290 TraceCheckUtils]: 18: Hoare triple {5601#false} assume 1 != ~lk5~0; {5601#false} is VALID [2022-04-27 15:10:16,557 INFO L290 TraceCheckUtils]: 19: Hoare triple {5601#false} assume !false; {5601#false} is VALID [2022-04-27 15:10:16,557 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-27 15:10:16,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:16,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292813540] [2022-04-27 15:10:16,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292813540] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:16,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:16,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:16,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645459579] [2022-04-27 15:10:16,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:16,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 20 [2022-04-27 15:10:16,558 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:16,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-27 15:10:16,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:16,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:16,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:16,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:16,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:16,569 INFO L87 Difference]: Start difference. First operand 257 states and 343 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-27 15:10:16,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:16,638 INFO L93 Difference]: Finished difference Result 385 states and 509 transitions. [2022-04-27 15:10:16,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:16,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 20 [2022-04-27 15:10:16,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:16,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-27 15:10:16,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-04-27 15:10:16,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-27 15:10:16,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-04-27 15:10:16,640 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 88 transitions. [2022-04-27 15:10:16,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:16,693 INFO L225 Difference]: With dead ends: 385 [2022-04-27 15:10:16,693 INFO L226 Difference]: Without dead ends: 267 [2022-04-27 15:10:16,693 INFO L412 NwaCegarLoop]: 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-27 15:10:16,694 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 63 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:16,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 54 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:16,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-04-27 15:10:16,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2022-04-27 15:10:16,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:16,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 267 states. Second operand has 265 states, 261 states have (on average 1.3026819923371646) internal successors, (340), 261 states have internal predecessors, (340), 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-27 15:10:16,699 INFO L74 IsIncluded]: Start isIncluded. First operand 267 states. Second operand has 265 states, 261 states have (on average 1.3026819923371646) internal successors, (340), 261 states have internal predecessors, (340), 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-27 15:10:16,700 INFO L87 Difference]: Start difference. First operand 267 states. Second operand has 265 states, 261 states have (on average 1.3026819923371646) internal successors, (340), 261 states have internal predecessors, (340), 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-27 15:10:16,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:16,703 INFO L93 Difference]: Finished difference Result 267 states and 344 transitions. [2022-04-27 15:10:16,703 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 344 transitions. [2022-04-27 15:10:16,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:16,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:16,704 INFO L74 IsIncluded]: Start isIncluded. First operand has 265 states, 261 states have (on average 1.3026819923371646) internal successors, (340), 261 states have internal predecessors, (340), 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 267 states. [2022-04-27 15:10:16,704 INFO L87 Difference]: Start difference. First operand has 265 states, 261 states have (on average 1.3026819923371646) internal successors, (340), 261 states have internal predecessors, (340), 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 267 states. [2022-04-27 15:10:16,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:16,708 INFO L93 Difference]: Finished difference Result 267 states and 344 transitions. [2022-04-27 15:10:16,708 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 344 transitions. [2022-04-27 15:10:16,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:16,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:16,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:16,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:16,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 261 states have (on average 1.3026819923371646) internal successors, (340), 261 states have internal predecessors, (340), 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-27 15:10:16,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 343 transitions. [2022-04-27 15:10:16,712 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 343 transitions. Word has length 20 [2022-04-27 15:10:16,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:16,712 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 343 transitions. [2022-04-27 15:10:16,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-27 15:10:16,712 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 343 transitions. [2022-04-27 15:10:16,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 15:10:16,712 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:16,713 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:16,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-27 15:10:16,713 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:16,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:16,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1773302091, now seen corresponding path program 1 times [2022-04-27 15:10:16,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:16,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112111404] [2022-04-27 15:10:16,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:16,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:16,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:16,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:16,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:16,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {6856#(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(15, 2);call #Ultimate.allocInit(12, 3); {6850#true} is VALID [2022-04-27 15:10:16,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {6850#true} assume true; {6850#true} is VALID [2022-04-27 15:10:16,735 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6850#true} {6850#true} #115#return; {6850#true} is VALID [2022-04-27 15:10:16,736 INFO L272 TraceCheckUtils]: 0: Hoare triple {6850#true} call ULTIMATE.init(); {6856#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:16,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {6856#(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(15, 2);call #Ultimate.allocInit(12, 3); {6850#true} is VALID [2022-04-27 15:10:16,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {6850#true} assume true; {6850#true} is VALID [2022-04-27 15:10:16,736 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6850#true} {6850#true} #115#return; {6850#true} is VALID [2022-04-27 15:10:16,736 INFO L272 TraceCheckUtils]: 4: Hoare triple {6850#true} call #t~ret10 := main(); {6850#true} is VALID [2022-04-27 15:10:16,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {6850#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;havoc ~cond~0; {6850#true} is VALID [2022-04-27 15:10:16,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {6850#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {6850#true} is VALID [2022-04-27 15:10:16,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {6850#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {6850#true} is VALID [2022-04-27 15:10:16,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {6850#true} assume !(0 != ~p1~0); {6850#true} is VALID [2022-04-27 15:10:16,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {6850#true} assume !(0 != ~p2~0); {6850#true} is VALID [2022-04-27 15:10:16,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {6850#true} assume !(0 != ~p3~0); {6850#true} is VALID [2022-04-27 15:10:16,737 INFO L290 TraceCheckUtils]: 11: Hoare triple {6850#true} assume !(0 != ~p4~0); {6850#true} is VALID [2022-04-27 15:10:16,737 INFO L290 TraceCheckUtils]: 12: Hoare triple {6850#true} assume 0 != ~p5~0;~lk5~0 := 1; {6855#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:16,737 INFO L290 TraceCheckUtils]: 13: Hoare triple {6855#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {6855#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:16,738 INFO L290 TraceCheckUtils]: 14: Hoare triple {6855#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {6855#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:16,738 INFO L290 TraceCheckUtils]: 15: Hoare triple {6855#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {6855#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:16,738 INFO L290 TraceCheckUtils]: 16: Hoare triple {6855#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {6855#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:16,738 INFO L290 TraceCheckUtils]: 17: Hoare triple {6855#(= main_~lk5~0 1)} assume 0 != ~p5~0; {6855#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:16,739 INFO L290 TraceCheckUtils]: 18: Hoare triple {6855#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {6851#false} is VALID [2022-04-27 15:10:16,739 INFO L290 TraceCheckUtils]: 19: Hoare triple {6851#false} assume !false; {6851#false} is VALID [2022-04-27 15:10:16,739 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-27 15:10:16,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:16,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112111404] [2022-04-27 15:10:16,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112111404] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:16,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:16,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:16,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954262730] [2022-04-27 15:10:16,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:16,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 20 [2022-04-27 15:10:16,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:16,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-27 15:10:16,750 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:16,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:16,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:16,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:16,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:16,751 INFO L87 Difference]: Start difference. First operand 265 states and 343 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-27 15:10:16,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:16,821 INFO L93 Difference]: Finished difference Result 427 states and 544 transitions. [2022-04-27 15:10:16,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:16,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 20 [2022-04-27 15:10:16,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:16,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-27 15:10:16,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-04-27 15:10:16,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-27 15:10:16,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-04-27 15:10:16,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 54 transitions. [2022-04-27 15:10:16,855 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:16,861 INFO L225 Difference]: With dead ends: 427 [2022-04-27 15:10:16,861 INFO L226 Difference]: Without dead ends: 425 [2022-04-27 15:10:16,864 INFO L412 NwaCegarLoop]: 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-27 15:10:16,864 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 54 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:16,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 43 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:16,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2022-04-27 15:10:16,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 393. [2022-04-27 15:10:16,871 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:16,871 INFO L82 GeneralOperation]: Start isEquivalent. First operand 425 states. Second operand has 393 states, 389 states have (on average 1.2647814910025708) internal successors, (492), 389 states have internal predecessors, (492), 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-27 15:10:16,872 INFO L74 IsIncluded]: Start isIncluded. First operand 425 states. Second operand has 393 states, 389 states have (on average 1.2647814910025708) internal successors, (492), 389 states have internal predecessors, (492), 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-27 15:10:16,872 INFO L87 Difference]: Start difference. First operand 425 states. Second operand has 393 states, 389 states have (on average 1.2647814910025708) internal successors, (492), 389 states have internal predecessors, (492), 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-27 15:10:16,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:16,879 INFO L93 Difference]: Finished difference Result 425 states and 527 transitions. [2022-04-27 15:10:16,879 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 527 transitions. [2022-04-27 15:10:16,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:16,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:16,880 INFO L74 IsIncluded]: Start isIncluded. First operand has 393 states, 389 states have (on average 1.2647814910025708) internal successors, (492), 389 states have internal predecessors, (492), 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 425 states. [2022-04-27 15:10:16,880 INFO L87 Difference]: Start difference. First operand has 393 states, 389 states have (on average 1.2647814910025708) internal successors, (492), 389 states have internal predecessors, (492), 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 425 states. [2022-04-27 15:10:16,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:16,888 INFO L93 Difference]: Finished difference Result 425 states and 527 transitions. [2022-04-27 15:10:16,888 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 527 transitions. [2022-04-27 15:10:16,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:16,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:16,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:16,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:16,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 389 states have (on average 1.2647814910025708) internal successors, (492), 389 states have internal predecessors, (492), 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-27 15:10:16,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 495 transitions. [2022-04-27 15:10:16,896 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 495 transitions. Word has length 20 [2022-04-27 15:10:16,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:16,897 INFO L495 AbstractCegarLoop]: Abstraction has 393 states and 495 transitions. [2022-04-27 15:10:16,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-27 15:10:16,897 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 495 transitions. [2022-04-27 15:10:16,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 15:10:16,897 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:16,897 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:16,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-27 15:10:16,897 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:16,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:16,898 INFO L85 PathProgramCache]: Analyzing trace with hash 963955465, now seen corresponding path program 1 times [2022-04-27 15:10:16,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:16,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181234710] [2022-04-27 15:10:16,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:16,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:16,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:16,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:16,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:16,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {8599#(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(15, 2);call #Ultimate.allocInit(12, 3); {8593#true} is VALID [2022-04-27 15:10:16,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {8593#true} assume true; {8593#true} is VALID [2022-04-27 15:10:16,927 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8593#true} {8593#true} #115#return; {8593#true} is VALID [2022-04-27 15:10:16,928 INFO L272 TraceCheckUtils]: 0: Hoare triple {8593#true} call ULTIMATE.init(); {8599#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:16,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {8599#(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(15, 2);call #Ultimate.allocInit(12, 3); {8593#true} is VALID [2022-04-27 15:10:16,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {8593#true} assume true; {8593#true} is VALID [2022-04-27 15:10:16,928 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8593#true} {8593#true} #115#return; {8593#true} is VALID [2022-04-27 15:10:16,928 INFO L272 TraceCheckUtils]: 4: Hoare triple {8593#true} call #t~ret10 := main(); {8593#true} is VALID [2022-04-27 15:10:16,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {8593#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;havoc ~cond~0; {8593#true} is VALID [2022-04-27 15:10:16,929 INFO L290 TraceCheckUtils]: 6: Hoare triple {8593#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {8593#true} is VALID [2022-04-27 15:10:16,929 INFO L290 TraceCheckUtils]: 7: Hoare triple {8593#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {8593#true} is VALID [2022-04-27 15:10:16,929 INFO L290 TraceCheckUtils]: 8: Hoare triple {8593#true} assume !(0 != ~p1~0); {8593#true} is VALID [2022-04-27 15:10:16,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {8593#true} assume !(0 != ~p2~0); {8593#true} is VALID [2022-04-27 15:10:16,929 INFO L290 TraceCheckUtils]: 10: Hoare triple {8593#true} assume !(0 != ~p3~0); {8593#true} is VALID [2022-04-27 15:10:16,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {8593#true} assume !(0 != ~p4~0); {8593#true} is VALID [2022-04-27 15:10:16,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {8593#true} assume !(0 != ~p5~0); {8598#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:16,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {8598#(= main_~p5~0 0)} assume !(0 != ~p1~0); {8598#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:16,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {8598#(= main_~p5~0 0)} assume !(0 != ~p2~0); {8598#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:16,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {8598#(= main_~p5~0 0)} assume !(0 != ~p3~0); {8598#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:16,930 INFO L290 TraceCheckUtils]: 16: Hoare triple {8598#(= main_~p5~0 0)} assume !(0 != ~p4~0); {8598#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:16,931 INFO L290 TraceCheckUtils]: 17: Hoare triple {8598#(= main_~p5~0 0)} assume 0 != ~p5~0; {8594#false} is VALID [2022-04-27 15:10:16,931 INFO L290 TraceCheckUtils]: 18: Hoare triple {8594#false} assume 1 != ~lk5~0; {8594#false} is VALID [2022-04-27 15:10:16,931 INFO L290 TraceCheckUtils]: 19: Hoare triple {8594#false} assume !false; {8594#false} is VALID [2022-04-27 15:10:16,931 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-27 15:10:16,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:16,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181234710] [2022-04-27 15:10:16,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181234710] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:16,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:16,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:16,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278133682] [2022-04-27 15:10:16,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:16,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 20 [2022-04-27 15:10:16,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:16,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-27 15:10:16,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:16,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:16,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:16,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:16,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:16,955 INFO L87 Difference]: Start difference. First operand 393 states and 495 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-27 15:10:17,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:17,045 INFO L93 Difference]: Finished difference Result 857 states and 1055 transitions. [2022-04-27 15:10:17,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:17,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 20 [2022-04-27 15:10:17,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:17,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-27 15:10:17,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-04-27 15:10:17,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-27 15:10:17,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-04-27 15:10:17,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 88 transitions. [2022-04-27 15:10:17,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:17,101 INFO L225 Difference]: With dead ends: 857 [2022-04-27 15:10:17,101 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 15:10:17,101 INFO L412 NwaCegarLoop]: 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-27 15:10:17,102 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 46 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:17,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 62 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:17,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 15:10:17,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 15:10:17,102 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:17,102 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 15:10:17,102 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 15:10:17,102 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 15:10:17,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:17,103 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 15:10:17,103 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 15:10:17,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:17,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:17,103 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 15:10:17,103 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 15:10:17,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:17,103 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 15:10:17,103 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 15:10:17,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:17,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:17,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:17,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:17,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 15:10:17,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 15:10:17,104 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2022-04-27 15:10:17,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:17,104 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 15:10:17,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-27 15:10:17,104 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 15:10:17,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:17,106 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 15:10:17,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-27 15:10:17,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 15:10:17,336 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-27 15:10:17,336 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-27 15:10:17,336 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-27 15:10:17,336 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 15:10:17,336 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 15:10:17,336 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 15:10:17,336 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 15:10:17,336 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 15:10:17,336 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 15:10:17,336 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 15:10:17,336 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 6 95) no Hoare annotation was computed. [2022-04-27 15:10:17,336 INFO L902 garLoopResultBuilder]: At program point L85-1(lines 26 90) the Hoare annotation is: true [2022-04-27 15:10:17,337 INFO L899 garLoopResultBuilder]: For program point L81(line 81) no Hoare annotation was computed. [2022-04-27 15:10:17,337 INFO L899 garLoopResultBuilder]: For program point L65-1(lines 26 90) no Hoare annotation was computed. [2022-04-27 15:10:17,337 INFO L899 garLoopResultBuilder]: For program point L28(lines 28 30) no Hoare annotation was computed. [2022-04-27 15:10:17,337 INFO L899 garLoopResultBuilder]: For program point L86(line 86) no Hoare annotation was computed. [2022-04-27 15:10:17,337 INFO L895 garLoopResultBuilder]: At program point L86-1(lines 7 95) the Hoare annotation is: false [2022-04-27 15:10:17,337 INFO L899 garLoopResultBuilder]: For program point L70-1(lines 26 90) no Hoare annotation was computed. [2022-04-27 15:10:17,337 INFO L899 garLoopResultBuilder]: For program point L66(line 66) no Hoare annotation was computed. [2022-04-27 15:10:17,337 INFO L902 garLoopResultBuilder]: At program point L91(lines 7 95) the Hoare annotation is: true [2022-04-27 15:10:17,337 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 6 95) no Hoare annotation was computed. [2022-04-27 15:10:17,337 INFO L899 garLoopResultBuilder]: For program point L75-1(lines 26 90) no Hoare annotation was computed. [2022-04-27 15:10:17,337 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2022-04-27 15:10:17,337 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 93) no Hoare annotation was computed. [2022-04-27 15:10:17,337 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 6 95) the Hoare annotation is: true [2022-04-27 15:10:17,337 INFO L899 garLoopResultBuilder]: For program point L59-1(lines 26 90) no Hoare annotation was computed. [2022-04-27 15:10:17,337 INFO L899 garLoopResultBuilder]: For program point L55-1(lines 26 90) no Hoare annotation was computed. [2022-04-27 15:10:17,338 INFO L899 garLoopResultBuilder]: For program point L51-1(lines 26 90) no Hoare annotation was computed. [2022-04-27 15:10:17,338 INFO L899 garLoopResultBuilder]: For program point L80-1(lines 26 90) no Hoare annotation was computed. [2022-04-27 15:10:17,338 INFO L899 garLoopResultBuilder]: For program point L47-1(lines 26 90) no Hoare annotation was computed. [2022-04-27 15:10:17,338 INFO L899 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2022-04-27 15:10:17,338 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 45) no Hoare annotation was computed. [2022-04-27 15:10:17,338 INFO L899 garLoopResultBuilder]: For program point L43-2(lines 26 90) no Hoare annotation was computed. [2022-04-27 15:10:17,340 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:17,341 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 15:10:17,343 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 15:10:17,343 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 15:10:17,344 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 15:10:17,344 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 15:10:17,344 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 15:10:17,344 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 15:10:17,345 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 15:10:17,345 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 15:10:17,345 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 15:10:17,345 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 15:10:17,345 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 15:10:17,345 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 15:10:17,345 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-27 15:10:17,345 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-27 15:10:17,345 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 15:10:17,345 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-04-27 15:10:17,345 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-04-27 15:10:17,345 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2022-04-27 15:10:17,345 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2022-04-27 15:10:17,345 WARN L170 areAnnotationChecker]: L51-1 has no Hoare annotation [2022-04-27 15:10:17,345 WARN L170 areAnnotationChecker]: L51-1 has no Hoare annotation [2022-04-27 15:10:17,345 WARN L170 areAnnotationChecker]: L55-1 has no Hoare annotation [2022-04-27 15:10:17,345 WARN L170 areAnnotationChecker]: L55-1 has no Hoare annotation [2022-04-27 15:10:17,345 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2022-04-27 15:10:17,345 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2022-04-27 15:10:17,345 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-04-27 15:10:17,345 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-04-27 15:10:17,345 WARN L170 areAnnotationChecker]: L65-1 has no Hoare annotation [2022-04-27 15:10:17,345 WARN L170 areAnnotationChecker]: L65-1 has no Hoare annotation [2022-04-27 15:10:17,345 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2022-04-27 15:10:17,345 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 15:10:17,346 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-04-27 15:10:17,346 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-04-27 15:10:17,346 WARN L170 areAnnotationChecker]: L70-1 has no Hoare annotation [2022-04-27 15:10:17,346 WARN L170 areAnnotationChecker]: L70-1 has no Hoare annotation [2022-04-27 15:10:17,346 WARN L170 areAnnotationChecker]: L76 has no Hoare annotation [2022-04-27 15:10:17,346 WARN L170 areAnnotationChecker]: L76 has no Hoare annotation [2022-04-27 15:10:17,346 WARN L170 areAnnotationChecker]: L75-1 has no Hoare annotation [2022-04-27 15:10:17,346 WARN L170 areAnnotationChecker]: L75-1 has no Hoare annotation [2022-04-27 15:10:17,346 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2022-04-27 15:10:17,346 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2022-04-27 15:10:17,346 WARN L170 areAnnotationChecker]: L80-1 has no Hoare annotation [2022-04-27 15:10:17,346 WARN L170 areAnnotationChecker]: L80-1 has no Hoare annotation [2022-04-27 15:10:17,346 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2022-04-27 15:10:17,346 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2022-04-27 15:10:17,346 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 15:10:17,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 03:10:17 BoogieIcfgContainer [2022-04-27 15:10:17,349 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 15:10:17,350 INFO L158 Benchmark]: Toolchain (without parser) took 4197.52ms. Allocated memory was 229.6MB in the beginning and 284.2MB in the end (delta: 54.5MB). Free memory was 175.8MB in the beginning and 244.8MB in the end (delta: -69.0MB). Peak memory consumption was 136.9MB. Max. memory is 8.0GB. [2022-04-27 15:10:17,350 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 229.6MB. Free memory is still 192.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 15:10:17,350 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.76ms. Allocated memory is still 229.6MB. Free memory was 175.6MB in the beginning and 201.0MB in the end (delta: -25.3MB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. [2022-04-27 15:10:17,350 INFO L158 Benchmark]: Boogie Preprocessor took 31.04ms. Allocated memory is still 229.6MB. Free memory was 201.0MB in the beginning and 199.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 15:10:17,351 INFO L158 Benchmark]: RCFGBuilder took 376.83ms. Allocated memory is still 229.6MB. Free memory was 199.5MB in the beginning and 186.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 15:10:17,351 INFO L158 Benchmark]: TraceAbstraction took 3560.30ms. Allocated memory was 229.6MB in the beginning and 284.2MB in the end (delta: 54.5MB). Free memory was 186.3MB in the beginning and 244.8MB in the end (delta: -58.5MB). Peak memory consumption was 146.9MB. Max. memory is 8.0GB. [2022-04-27 15:10:17,351 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.10ms. Allocated memory is still 229.6MB. Free memory is still 192.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 225.76ms. Allocated memory is still 229.6MB. Free memory was 175.6MB in the beginning and 201.0MB in the end (delta: -25.3MB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.04ms. Allocated memory is still 229.6MB. Free memory was 201.0MB in the beginning and 199.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 376.83ms. Allocated memory is still 229.6MB. Free memory was 199.5MB in the beginning and 186.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 3560.30ms. Allocated memory was 229.6MB in the beginning and 284.2MB in the end (delta: 54.5MB). Free memory was 186.3MB in the beginning and 244.8MB in the end (delta: -58.5MB). Peak memory consumption was 146.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 93]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 831 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 831 mSDsluCounter, 721 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 93 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 429 IncrementalHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 628 mSDtfsCounter, 429 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=393occurred in iteration=12, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 136 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 42 NumberOfFragments, 13 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 236 NumberOfCodeBlocks, 236 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 223 ConstructedInterpolants, 0 QuantifiedInterpolants, 456 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-04-27 15:10:17,372 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...