/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_12.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 15:09:18,703 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 15:09:18,705 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 15:09:18,771 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 15:09:18,772 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 15:09:18,774 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 15:09:18,777 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 15:09:18,778 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 15:09:18,780 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 15:09:18,784 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 15:09:18,784 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 15:09:18,785 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 15:09:18,786 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 15:09:18,787 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 15:09:18,788 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 15:09:18,791 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 15:09:18,792 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 15:09:18,792 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 15:09:18,794 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 15:09:18,796 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 15:09:18,797 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 15:09:18,799 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 15:09:18,799 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 15:09:18,800 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 15:09:18,800 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 15:09:18,802 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 15:09:18,802 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 15:09:18,802 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 15:09:18,802 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 15:09:18,803 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 15:09:18,803 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 15:09:18,803 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 15:09:18,804 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 15:09:18,804 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 15:09:18,805 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 15:09:18,805 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 15:09:18,806 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 15:09:18,806 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 15:09:18,806 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 15:09:18,806 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 15:09:18,807 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 15:09:18,811 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 15:09:18,811 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:09:18,835 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 15:09:18,835 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 15:09:18,835 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 15:09:18,836 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 15:09:18,836 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 15:09:18,836 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 15:09:18,837 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 15:09:18,837 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 15:09:18,837 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 15:09:18,838 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 15:09:18,838 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 15:09:18,838 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 15:09:18,838 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 15:09:18,838 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 15:09:18,838 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 15:09:18,839 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 15:09:18,839 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 15:09:18,840 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 15:09:18,840 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 15:09:18,840 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 15:09:18,840 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 15:09:18,840 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 15:09:18,840 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 15:09:18,840 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 15:09:18,841 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:09:18,841 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 15:09:18,841 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 15:09:18,841 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 15:09:18,841 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 15:09:18,841 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 15:09:18,841 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 15:09:18,842 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 15:09:18,842 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 15:09:18,842 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:09:19,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 15:09:19,015 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 15:09:19,017 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 15:09:19,018 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 15:09:19,019 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 15:09:19,019 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_12.c [2022-04-27 15:09:19,075 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48f76fc1d/8561fd746c7c4c5e8d924d9f94924966/FLAG48fda9684 [2022-04-27 15:09:19,437 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 15:09:19,438 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_12.c [2022-04-27 15:09:19,445 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48f76fc1d/8561fd746c7c4c5e8d924d9f94924966/FLAG48fda9684 [2022-04-27 15:09:19,461 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48f76fc1d/8561fd746c7c4c5e8d924d9f94924966 [2022-04-27 15:09:19,463 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 15:09:19,464 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 15:09:19,465 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 15:09:19,465 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 15:09:19,468 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 15:09:19,469 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:09:19" (1/1) ... [2022-04-27 15:09:19,471 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fefb0a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:19, skipping insertion in model container [2022-04-27 15:09:19,471 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:09:19" (1/1) ... [2022-04-27 15:09:19,475 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 15:09:19,494 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 15:09:19,665 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_12.c[4591,4604] [2022-04-27 15:09:19,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:09:19,680 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 15:09:19,712 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_12.c[4591,4604] [2022-04-27 15:09:19,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:09:19,721 INFO L208 MainTranslator]: Completed translation [2022-04-27 15:09:19,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:19 WrapperNode [2022-04-27 15:09:19,722 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 15:09:19,722 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 15:09:19,722 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 15:09:19,722 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 15:09:19,729 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:19" (1/1) ... [2022-04-27 15:09:19,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:19" (1/1) ... [2022-04-27 15:09:19,740 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:19" (1/1) ... [2022-04-27 15:09:19,740 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:19" (1/1) ... [2022-04-27 15:09:19,753 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:19" (1/1) ... [2022-04-27 15:09:19,758 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:19" (1/1) ... [2022-04-27 15:09:19,759 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:19" (1/1) ... [2022-04-27 15:09:19,760 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 15:09:19,761 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 15:09:19,761 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 15:09:19,761 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 15:09:19,763 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:19" (1/1) ... [2022-04-27 15:09:19,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:09:19,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:09:19,786 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:09:19,804 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:09:19,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 15:09:19,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 15:09:19,814 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 15:09:19,814 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 15:09:19,815 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 15:09:19,815 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 15:09:19,815 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 15:09:19,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 15:09:19,815 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 15:09:19,815 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 15:09:19,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 15:09:19,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 15:09:19,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 15:09:19,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 15:09:19,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 15:09:19,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 15:09:19,879 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 15:09:19,880 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 15:09:20,106 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 15:09:20,111 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 15:09:20,112 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 15:09:20,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:09:20 BoogieIcfgContainer [2022-04-27 15:09:20,113 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 15:09:20,114 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 15:09:20,114 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 15:09:20,117 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 15:09:20,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 03:09:19" (1/3) ... [2022-04-27 15:09:20,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14409d6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:09:20, skipping insertion in model container [2022-04-27 15:09:20,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:19" (2/3) ... [2022-04-27 15:09:20,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14409d6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:09:20, skipping insertion in model container [2022-04-27 15:09:20,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:09:20" (3/3) ... [2022-04-27 15:09:20,119 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_12.c [2022-04-27 15:09:20,128 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 15:09:20,128 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 15:09:20,160 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 15:09:20,167 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@473a5347, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@34c9ef64 [2022-04-27 15:09:20,167 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 15:09:20,173 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 46 states have internal predecessors, (85), 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:09:20,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 15:09:20,178 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:20,178 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, 1, 1, 1] [2022-04-27 15:09:20,179 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:20,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:20,183 INFO L85 PathProgramCache]: Analyzing trace with hash 88534809, now seen corresponding path program 1 times [2022-04-27 15:09:20,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:20,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599284821] [2022-04-27 15:09:20,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:20,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:20,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:20,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:20,375 INFO L290 TraceCheckUtils]: 0: Hoare triple {60#(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(16, 2);call #Ultimate.allocInit(12, 3); {54#true} is VALID [2022-04-27 15:09:20,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#true} assume true; {54#true} is VALID [2022-04-27 15:09:20,376 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54#true} {54#true} #234#return; {54#true} is VALID [2022-04-27 15:09:20,377 INFO L272 TraceCheckUtils]: 0: Hoare triple {54#true} call ULTIMATE.init(); {60#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:20,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {60#(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(16, 2);call #Ultimate.allocInit(12, 3); {54#true} is VALID [2022-04-27 15:09:20,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {54#true} assume true; {54#true} is VALID [2022-04-27 15:09:20,378 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54#true} {54#true} #234#return; {54#true} is VALID [2022-04-27 15:09:20,378 INFO L272 TraceCheckUtils]: 4: Hoare triple {54#true} call #t~ret17 := main(); {54#true} is VALID [2022-04-27 15:09:20,378 INFO L290 TraceCheckUtils]: 5: Hoare triple {54#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {54#true} is VALID [2022-04-27 15:09:20,378 INFO L290 TraceCheckUtils]: 6: Hoare triple {54#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {54#true} is VALID [2022-04-27 15:09:20,379 INFO L290 TraceCheckUtils]: 7: Hoare triple {54#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {54#true} is VALID [2022-04-27 15:09:20,379 INFO L290 TraceCheckUtils]: 8: Hoare triple {54#true} assume 0 != ~p1~0;~lk1~0 := 1; {59#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:20,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {59#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {59#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:20,380 INFO L290 TraceCheckUtils]: 10: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {59#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:20,380 INFO L290 TraceCheckUtils]: 11: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {59#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:20,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {59#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:20,381 INFO L290 TraceCheckUtils]: 13: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {59#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:20,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {59#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:20,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {59#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:20,382 INFO L290 TraceCheckUtils]: 16: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {59#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:20,383 INFO L290 TraceCheckUtils]: 17: Hoare triple {59#(= main_~lk1~0 1)} assume !(0 != ~p10~0); {59#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:20,383 INFO L290 TraceCheckUtils]: 18: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {59#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:20,384 INFO L290 TraceCheckUtils]: 19: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {59#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:20,384 INFO L290 TraceCheckUtils]: 20: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p1~0; {59#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:20,385 INFO L290 TraceCheckUtils]: 21: Hoare triple {59#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {55#false} is VALID [2022-04-27 15:09:20,385 INFO L290 TraceCheckUtils]: 22: Hoare triple {55#false} assume !false; {55#false} is VALID [2022-04-27 15:09:20,385 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:09:20,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:20,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599284821] [2022-04-27 15:09:20,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599284821] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:20,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:20,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:20,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913293345] [2022-04-27 15:09:20,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:20,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 23 [2022-04-27 15:09:20,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:20,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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:09:20,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:20,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:20,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:20,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:20,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:20,444 INFO L87 Difference]: Start difference. First operand has 51 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 46 states have internal predecessors, (85), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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:09:20,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:20,765 INFO L93 Difference]: Finished difference Result 100 states and 175 transitions. [2022-04-27 15:09:20,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:20,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 23 [2022-04-27 15:09:20,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:20,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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:09:20,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2022-04-27 15:09:20,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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:09:20,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2022-04-27 15:09:20,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 175 transitions. [2022-04-27 15:09:20,923 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:20,932 INFO L225 Difference]: With dead ends: 100 [2022-04-27 15:09:20,932 INFO L226 Difference]: Without dead ends: 85 [2022-04-27 15:09:20,934 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:09:20,937 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 208 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:20,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 101 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:09:20,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-27 15:09:20,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 59. [2022-04-27 15:09:20,964 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:20,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 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:09:20,965 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 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:09:20,966 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 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:09:20,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:20,970 INFO L93 Difference]: Finished difference Result 85 states and 153 transitions. [2022-04-27 15:09:20,970 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 153 transitions. [2022-04-27 15:09:20,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:20,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:20,971 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 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 85 states. [2022-04-27 15:09:20,972 INFO L87 Difference]: Start difference. First operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 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 85 states. [2022-04-27 15:09:20,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:20,975 INFO L93 Difference]: Finished difference Result 85 states and 153 transitions. [2022-04-27 15:09:20,975 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 153 transitions. [2022-04-27 15:09:20,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:20,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:20,976 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:20,976 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:20,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 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:09:20,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 106 transitions. [2022-04-27 15:09:20,980 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 106 transitions. Word has length 23 [2022-04-27 15:09:20,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:20,980 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 106 transitions. [2022-04-27 15:09:20,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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:09:20,981 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 106 transitions. [2022-04-27 15:09:20,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 15:09:20,981 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:20,981 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, 1, 1, 1] [2022-04-27 15:09:20,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 15:09:20,982 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:20,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:20,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1191328869, now seen corresponding path program 1 times [2022-04-27 15:09:20,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:20,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820297805] [2022-04-27 15:09:20,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:20,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:21,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:21,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {419#(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(16, 2);call #Ultimate.allocInit(12, 3); {413#true} is VALID [2022-04-27 15:09:21,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {413#true} assume true; {413#true} is VALID [2022-04-27 15:09:21,043 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {413#true} {413#true} #234#return; {413#true} is VALID [2022-04-27 15:09:21,044 INFO L272 TraceCheckUtils]: 0: Hoare triple {413#true} call ULTIMATE.init(); {419#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:21,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {419#(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(16, 2);call #Ultimate.allocInit(12, 3); {413#true} is VALID [2022-04-27 15:09:21,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {413#true} assume true; {413#true} is VALID [2022-04-27 15:09:21,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {413#true} {413#true} #234#return; {413#true} is VALID [2022-04-27 15:09:21,044 INFO L272 TraceCheckUtils]: 4: Hoare triple {413#true} call #t~ret17 := main(); {413#true} is VALID [2022-04-27 15:09:21,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {413#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {413#true} is VALID [2022-04-27 15:09:21,045 INFO L290 TraceCheckUtils]: 6: Hoare triple {413#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {413#true} is VALID [2022-04-27 15:09:21,045 INFO L290 TraceCheckUtils]: 7: Hoare triple {413#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {413#true} is VALID [2022-04-27 15:09:21,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {413#true} assume !(0 != ~p1~0); {418#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:21,046 INFO L290 TraceCheckUtils]: 9: Hoare triple {418#(= main_~p1~0 0)} assume !(0 != ~p2~0); {418#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:21,046 INFO L290 TraceCheckUtils]: 10: Hoare triple {418#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {418#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:21,046 INFO L290 TraceCheckUtils]: 11: Hoare triple {418#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {418#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:21,047 INFO L290 TraceCheckUtils]: 12: Hoare triple {418#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {418#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:21,047 INFO L290 TraceCheckUtils]: 13: Hoare triple {418#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {418#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:21,048 INFO L290 TraceCheckUtils]: 14: Hoare triple {418#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {418#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:21,048 INFO L290 TraceCheckUtils]: 15: Hoare triple {418#(= main_~p1~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {418#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:21,048 INFO L290 TraceCheckUtils]: 16: Hoare triple {418#(= main_~p1~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {418#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:21,049 INFO L290 TraceCheckUtils]: 17: Hoare triple {418#(= main_~p1~0 0)} assume !(0 != ~p10~0); {418#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:21,049 INFO L290 TraceCheckUtils]: 18: Hoare triple {418#(= main_~p1~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {418#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:21,050 INFO L290 TraceCheckUtils]: 19: Hoare triple {418#(= main_~p1~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {418#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:21,050 INFO L290 TraceCheckUtils]: 20: Hoare triple {418#(= main_~p1~0 0)} assume 0 != ~p1~0; {414#false} is VALID [2022-04-27 15:09:21,050 INFO L290 TraceCheckUtils]: 21: Hoare triple {414#false} assume 1 != ~lk1~0; {414#false} is VALID [2022-04-27 15:09:21,050 INFO L290 TraceCheckUtils]: 22: Hoare triple {414#false} assume !false; {414#false} is VALID [2022-04-27 15:09:21,051 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:09:21,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:21,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820297805] [2022-04-27 15:09:21,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820297805] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:21,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:21,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:21,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949376089] [2022-04-27 15:09:21,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:21,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 23 [2022-04-27 15:09:21,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:21,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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:09:21,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:21,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:21,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:21,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:21,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:21,071 INFO L87 Difference]: Start difference. First operand 59 states and 106 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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:09:21,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:21,313 INFO L93 Difference]: Finished difference Result 138 states and 253 transitions. [2022-04-27 15:09:21,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:21,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 23 [2022-04-27 15:09:21,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:21,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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:09:21,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 228 transitions. [2022-04-27 15:09:21,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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:09:21,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 228 transitions. [2022-04-27 15:09:21,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 228 transitions. [2022-04-27 15:09:21,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 228 edges. 228 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:21,457 INFO L225 Difference]: With dead ends: 138 [2022-04-27 15:09:21,457 INFO L226 Difference]: Without dead ends: 85 [2022-04-27 15:09:21,457 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:09:21,458 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 178 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:21,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 111 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:09:21,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-27 15:09:21,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2022-04-27 15:09:21,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:21,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 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:09:21,464 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 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:09:21,464 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 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:09:21,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:21,466 INFO L93 Difference]: Finished difference Result 85 states and 151 transitions. [2022-04-27 15:09:21,466 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 151 transitions. [2022-04-27 15:09:21,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:21,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:21,467 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 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 85 states. [2022-04-27 15:09:21,467 INFO L87 Difference]: Start difference. First operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 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 85 states. [2022-04-27 15:09:21,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:21,469 INFO L93 Difference]: Finished difference Result 85 states and 151 transitions. [2022-04-27 15:09:21,469 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 151 transitions. [2022-04-27 15:09:21,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:21,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:21,470 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:21,470 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:21,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 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:09:21,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 150 transitions. [2022-04-27 15:09:21,472 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 150 transitions. Word has length 23 [2022-04-27 15:09:21,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:21,472 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 150 transitions. [2022-04-27 15:09:21,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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:09:21,472 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 150 transitions. [2022-04-27 15:09:21,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 15:09:21,473 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:21,473 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, 1, 1, 1, 1] [2022-04-27 15:09:21,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 15:09:21,473 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:21,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:21,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1550175482, now seen corresponding path program 1 times [2022-04-27 15:09:21,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:21,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817363989] [2022-04-27 15:09:21,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:21,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:21,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:21,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:21,520 INFO L290 TraceCheckUtils]: 0: Hoare triple {839#(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(16, 2);call #Ultimate.allocInit(12, 3); {833#true} is VALID [2022-04-27 15:09:21,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {833#true} assume true; {833#true} is VALID [2022-04-27 15:09:21,520 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {833#true} {833#true} #234#return; {833#true} is VALID [2022-04-27 15:09:21,521 INFO L272 TraceCheckUtils]: 0: Hoare triple {833#true} call ULTIMATE.init(); {839#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:21,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {839#(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(16, 2);call #Ultimate.allocInit(12, 3); {833#true} is VALID [2022-04-27 15:09:21,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {833#true} assume true; {833#true} is VALID [2022-04-27 15:09:21,521 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {833#true} {833#true} #234#return; {833#true} is VALID [2022-04-27 15:09:21,521 INFO L272 TraceCheckUtils]: 4: Hoare triple {833#true} call #t~ret17 := main(); {833#true} is VALID [2022-04-27 15:09:21,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {833#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {833#true} is VALID [2022-04-27 15:09:21,522 INFO L290 TraceCheckUtils]: 6: Hoare triple {833#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {833#true} is VALID [2022-04-27 15:09:21,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {833#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {833#true} is VALID [2022-04-27 15:09:21,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {833#true} assume 0 != ~p1~0;~lk1~0 := 1; {838#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:21,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {838#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {838#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:21,523 INFO L290 TraceCheckUtils]: 10: Hoare triple {838#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {838#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:21,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {838#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {838#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:21,523 INFO L290 TraceCheckUtils]: 12: Hoare triple {838#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {838#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:21,524 INFO L290 TraceCheckUtils]: 13: Hoare triple {838#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {838#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:21,524 INFO L290 TraceCheckUtils]: 14: Hoare triple {838#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {838#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:21,524 INFO L290 TraceCheckUtils]: 15: Hoare triple {838#(not (= main_~p1~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {838#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:21,524 INFO L290 TraceCheckUtils]: 16: Hoare triple {838#(not (= main_~p1~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {838#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:21,525 INFO L290 TraceCheckUtils]: 17: Hoare triple {838#(not (= main_~p1~0 0))} assume !(0 != ~p10~0); {838#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:21,527 INFO L290 TraceCheckUtils]: 18: Hoare triple {838#(not (= main_~p1~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {838#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:21,527 INFO L290 TraceCheckUtils]: 19: Hoare triple {838#(not (= main_~p1~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {838#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:21,528 INFO L290 TraceCheckUtils]: 20: Hoare triple {838#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {834#false} is VALID [2022-04-27 15:09:21,528 INFO L290 TraceCheckUtils]: 21: Hoare triple {834#false} assume 0 != ~p2~0; {834#false} is VALID [2022-04-27 15:09:21,528 INFO L290 TraceCheckUtils]: 22: Hoare triple {834#false} assume 1 != ~lk2~0; {834#false} is VALID [2022-04-27 15:09:21,528 INFO L290 TraceCheckUtils]: 23: Hoare triple {834#false} assume !false; {834#false} is VALID [2022-04-27 15:09:21,529 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:09:21,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:21,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817363989] [2022-04-27 15:09:21,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817363989] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:21,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:21,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:21,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384715736] [2022-04-27 15:09:21,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:21,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 24 [2022-04-27 15:09:21,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:21,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:09:21,543 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:21,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:21,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:21,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:21,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:21,544 INFO L87 Difference]: Start difference. First operand 83 states and 150 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:09:21,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:21,702 INFO L93 Difference]: Finished difference Result 127 states and 226 transitions. [2022-04-27 15:09:21,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:21,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 24 [2022-04-27 15:09:21,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:21,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:09:21,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 223 transitions. [2022-04-27 15:09:21,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:09:21,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 223 transitions. [2022-04-27 15:09:21,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 223 transitions. [2022-04-27 15:09:21,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:21,844 INFO L225 Difference]: With dead ends: 127 [2022-04-27 15:09:21,844 INFO L226 Difference]: Without dead ends: 88 [2022-04-27 15:09:21,845 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:09:21,845 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 157 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:21,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 133 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:21,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-27 15:09:21,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2022-04-27 15:09:21,849 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:21,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 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:09:21,850 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 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:09:21,850 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 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:09:21,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:21,852 INFO L93 Difference]: Finished difference Result 88 states and 153 transitions. [2022-04-27 15:09:21,852 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 153 transitions. [2022-04-27 15:09:21,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:21,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:21,853 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 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 88 states. [2022-04-27 15:09:21,853 INFO L87 Difference]: Start difference. First operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 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 88 states. [2022-04-27 15:09:21,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:21,855 INFO L93 Difference]: Finished difference Result 88 states and 153 transitions. [2022-04-27 15:09:21,855 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 153 transitions. [2022-04-27 15:09:21,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:21,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:21,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:21,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:21,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 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:09:21,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 152 transitions. [2022-04-27 15:09:21,858 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 152 transitions. Word has length 24 [2022-04-27 15:09:21,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:21,858 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 152 transitions. [2022-04-27 15:09:21,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:09:21,859 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 152 transitions. [2022-04-27 15:09:21,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 15:09:21,859 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:21,859 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, 1, 1, 1, 1] [2022-04-27 15:09:21,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 15:09:21,859 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:21,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:21,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1723723460, now seen corresponding path program 1 times [2022-04-27 15:09:21,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:21,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901491185] [2022-04-27 15:09:21,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:21,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:21,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:21,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {1259#(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(16, 2);call #Ultimate.allocInit(12, 3); {1253#true} is VALID [2022-04-27 15:09:21,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {1253#true} assume true; {1253#true} is VALID [2022-04-27 15:09:21,904 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1253#true} {1253#true} #234#return; {1253#true} is VALID [2022-04-27 15:09:21,905 INFO L272 TraceCheckUtils]: 0: Hoare triple {1253#true} call ULTIMATE.init(); {1259#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:21,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {1259#(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(16, 2);call #Ultimate.allocInit(12, 3); {1253#true} is VALID [2022-04-27 15:09:21,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {1253#true} assume true; {1253#true} is VALID [2022-04-27 15:09:21,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1253#true} {1253#true} #234#return; {1253#true} is VALID [2022-04-27 15:09:21,905 INFO L272 TraceCheckUtils]: 4: Hoare triple {1253#true} call #t~ret17 := main(); {1253#true} is VALID [2022-04-27 15:09:21,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {1253#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {1253#true} is VALID [2022-04-27 15:09:21,905 INFO L290 TraceCheckUtils]: 6: Hoare triple {1253#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {1253#true} is VALID [2022-04-27 15:09:21,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {1253#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {1253#true} is VALID [2022-04-27 15:09:21,906 INFO L290 TraceCheckUtils]: 8: Hoare triple {1253#true} assume !(0 != ~p1~0); {1253#true} is VALID [2022-04-27 15:09:21,906 INFO L290 TraceCheckUtils]: 9: Hoare triple {1253#true} assume !(0 != ~p2~0); {1258#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:21,906 INFO L290 TraceCheckUtils]: 10: Hoare triple {1258#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1258#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:21,907 INFO L290 TraceCheckUtils]: 11: Hoare triple {1258#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1258#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:21,907 INFO L290 TraceCheckUtils]: 12: Hoare triple {1258#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1258#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:21,907 INFO L290 TraceCheckUtils]: 13: Hoare triple {1258#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1258#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:21,907 INFO L290 TraceCheckUtils]: 14: Hoare triple {1258#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {1258#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:21,908 INFO L290 TraceCheckUtils]: 15: Hoare triple {1258#(= main_~p2~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {1258#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:21,908 INFO L290 TraceCheckUtils]: 16: Hoare triple {1258#(= main_~p2~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {1258#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:21,908 INFO L290 TraceCheckUtils]: 17: Hoare triple {1258#(= main_~p2~0 0)} assume !(0 != ~p10~0); {1258#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:21,909 INFO L290 TraceCheckUtils]: 18: Hoare triple {1258#(= main_~p2~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {1258#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:21,909 INFO L290 TraceCheckUtils]: 19: Hoare triple {1258#(= main_~p2~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {1258#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:21,909 INFO L290 TraceCheckUtils]: 20: Hoare triple {1258#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1258#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:21,910 INFO L290 TraceCheckUtils]: 21: Hoare triple {1258#(= main_~p2~0 0)} assume 0 != ~p2~0; {1254#false} is VALID [2022-04-27 15:09:21,910 INFO L290 TraceCheckUtils]: 22: Hoare triple {1254#false} assume 1 != ~lk2~0; {1254#false} is VALID [2022-04-27 15:09:21,910 INFO L290 TraceCheckUtils]: 23: Hoare triple {1254#false} assume !false; {1254#false} is VALID [2022-04-27 15:09:21,910 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:09:21,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:21,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901491185] [2022-04-27 15:09:21,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901491185] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:21,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:21,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:21,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402310636] [2022-04-27 15:09:21,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:21,911 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 24 [2022-04-27 15:09:21,911 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:21,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:09:21,924 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:21,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:21,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:21,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:21,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:21,925 INFO L87 Difference]: Start difference. First operand 86 states and 152 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:09:22,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:22,081 INFO L93 Difference]: Finished difference Result 238 states and 432 transitions. [2022-04-27 15:09:22,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:22,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 24 [2022-04-27 15:09:22,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:22,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:09:22,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 226 transitions. [2022-04-27 15:09:22,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:09:22,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 226 transitions. [2022-04-27 15:09:22,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 226 transitions. [2022-04-27 15:09:22,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:22,213 INFO L225 Difference]: With dead ends: 238 [2022-04-27 15:09:22,214 INFO L226 Difference]: Without dead ends: 161 [2022-04-27 15:09:22,214 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:09:22,222 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 197 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:22,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 91 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:22,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-27 15:09:22,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2022-04-27 15:09:22,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:22,233 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 159 states, 155 states have (on average 1.8193548387096774) internal successors, (282), 155 states have internal predecessors, (282), 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:09:22,233 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 159 states, 155 states have (on average 1.8193548387096774) internal successors, (282), 155 states have internal predecessors, (282), 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:09:22,234 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 159 states, 155 states have (on average 1.8193548387096774) internal successors, (282), 155 states have internal predecessors, (282), 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:09:22,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:22,238 INFO L93 Difference]: Finished difference Result 161 states and 286 transitions. [2022-04-27 15:09:22,238 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 286 transitions. [2022-04-27 15:09:22,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:22,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:22,238 INFO L74 IsIncluded]: Start isIncluded. First operand has 159 states, 155 states have (on average 1.8193548387096774) internal successors, (282), 155 states have internal predecessors, (282), 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 161 states. [2022-04-27 15:09:22,239 INFO L87 Difference]: Start difference. First operand has 159 states, 155 states have (on average 1.8193548387096774) internal successors, (282), 155 states have internal predecessors, (282), 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 161 states. [2022-04-27 15:09:22,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:22,243 INFO L93 Difference]: Finished difference Result 161 states and 286 transitions. [2022-04-27 15:09:22,243 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 286 transitions. [2022-04-27 15:09:22,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:22,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:22,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:22,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:22,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 155 states have (on average 1.8193548387096774) internal successors, (282), 155 states have internal predecessors, (282), 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:09:22,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 285 transitions. [2022-04-27 15:09:22,248 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 285 transitions. Word has length 24 [2022-04-27 15:09:22,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:22,248 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 285 transitions. [2022-04-27 15:09:22,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:09:22,248 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 285 transitions. [2022-04-27 15:09:22,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 15:09:22,249 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:22,249 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, 1, 1, 1, 1] [2022-04-27 15:09:22,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 15:09:22,249 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:22,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:22,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1291380158, now seen corresponding path program 1 times [2022-04-27 15:09:22,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:22,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424755919] [2022-04-27 15:09:22,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:22,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:22,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:22,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:22,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:22,291 INFO L290 TraceCheckUtils]: 0: Hoare triple {2014#(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(16, 2);call #Ultimate.allocInit(12, 3); {2008#true} is VALID [2022-04-27 15:09:22,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {2008#true} assume true; {2008#true} is VALID [2022-04-27 15:09:22,291 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2008#true} {2008#true} #234#return; {2008#true} is VALID [2022-04-27 15:09:22,292 INFO L272 TraceCheckUtils]: 0: Hoare triple {2008#true} call ULTIMATE.init(); {2014#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:22,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {2014#(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(16, 2);call #Ultimate.allocInit(12, 3); {2008#true} is VALID [2022-04-27 15:09:22,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {2008#true} assume true; {2008#true} is VALID [2022-04-27 15:09:22,292 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2008#true} {2008#true} #234#return; {2008#true} is VALID [2022-04-27 15:09:22,292 INFO L272 TraceCheckUtils]: 4: Hoare triple {2008#true} call #t~ret17 := main(); {2008#true} is VALID [2022-04-27 15:09:22,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {2008#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {2008#true} is VALID [2022-04-27 15:09:22,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {2008#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {2008#true} is VALID [2022-04-27 15:09:22,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {2008#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {2008#true} is VALID [2022-04-27 15:09:22,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {2008#true} assume !(0 != ~p1~0); {2008#true} is VALID [2022-04-27 15:09:22,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {2008#true} assume 0 != ~p2~0;~lk2~0 := 1; {2013#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:22,293 INFO L290 TraceCheckUtils]: 10: Hoare triple {2013#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {2013#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:22,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {2013#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2013#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:22,294 INFO L290 TraceCheckUtils]: 12: Hoare triple {2013#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2013#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:22,294 INFO L290 TraceCheckUtils]: 13: Hoare triple {2013#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {2013#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:22,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {2013#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {2013#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:22,295 INFO L290 TraceCheckUtils]: 15: Hoare triple {2013#(= main_~lk2~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {2013#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:22,296 INFO L290 TraceCheckUtils]: 16: Hoare triple {2013#(= main_~lk2~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {2013#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:22,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {2013#(= main_~lk2~0 1)} assume !(0 != ~p10~0); {2013#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:22,296 INFO L290 TraceCheckUtils]: 18: Hoare triple {2013#(= main_~lk2~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {2013#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:22,297 INFO L290 TraceCheckUtils]: 19: Hoare triple {2013#(= main_~lk2~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {2013#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:22,297 INFO L290 TraceCheckUtils]: 20: Hoare triple {2013#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {2013#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:22,297 INFO L290 TraceCheckUtils]: 21: Hoare triple {2013#(= main_~lk2~0 1)} assume 0 != ~p2~0; {2013#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:22,297 INFO L290 TraceCheckUtils]: 22: Hoare triple {2013#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {2009#false} is VALID [2022-04-27 15:09:22,298 INFO L290 TraceCheckUtils]: 23: Hoare triple {2009#false} assume !false; {2009#false} is VALID [2022-04-27 15:09:22,298 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:09:22,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:22,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424755919] [2022-04-27 15:09:22,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424755919] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:22,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:22,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:22,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451361133] [2022-04-27 15:09:22,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:22,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 24 [2022-04-27 15:09:22,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:22,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:09:22,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:22,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:22,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:22,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:22,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:22,313 INFO L87 Difference]: Start difference. First operand 159 states and 285 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:09:22,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:22,463 INFO L93 Difference]: Finished difference Result 207 states and 371 transitions. [2022-04-27 15:09:22,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:22,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 24 [2022-04-27 15:09:22,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:22,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:09:22,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-04-27 15:09:22,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:09:22,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-04-27 15:09:22,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 148 transitions. [2022-04-27 15:09:22,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:22,557 INFO L225 Difference]: With dead ends: 207 [2022-04-27 15:09:22,557 INFO L226 Difference]: Without dead ends: 205 [2022-04-27 15:09:22,557 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:09:22,558 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 128 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:22,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 152 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:22,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-04-27 15:09:22,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 159. [2022-04-27 15:09:22,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:22,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 205 states. Second operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 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:09:22,564 INFO L74 IsIncluded]: Start isIncluded. First operand 205 states. Second operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 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:09:22,564 INFO L87 Difference]: Start difference. First operand 205 states. Second operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 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:09:22,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:22,570 INFO L93 Difference]: Finished difference Result 205 states and 368 transitions. [2022-04-27 15:09:22,570 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 368 transitions. [2022-04-27 15:09:22,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:22,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:22,571 INFO L74 IsIncluded]: Start isIncluded. First operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 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 205 states. [2022-04-27 15:09:22,571 INFO L87 Difference]: Start difference. First operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 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 205 states. [2022-04-27 15:09:22,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:22,577 INFO L93 Difference]: Finished difference Result 205 states and 368 transitions. [2022-04-27 15:09:22,577 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 368 transitions. [2022-04-27 15:09:22,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:22,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:22,577 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:22,577 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:22,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 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:09:22,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 283 transitions. [2022-04-27 15:09:22,582 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 283 transitions. Word has length 24 [2022-04-27 15:09:22,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:22,582 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 283 transitions. [2022-04-27 15:09:22,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:09:22,582 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 283 transitions. [2022-04-27 15:09:22,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 15:09:22,582 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:22,583 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, 1, 1, 1, 1, 1] [2022-04-27 15:09:22,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 15:09:22,583 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:22,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:22,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1896032784, now seen corresponding path program 1 times [2022-04-27 15:09:22,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:22,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829019165] [2022-04-27 15:09:22,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:22,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:22,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:22,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:22,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {2826#(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(16, 2);call #Ultimate.allocInit(12, 3); {2820#true} is VALID [2022-04-27 15:09:22,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {2820#true} assume true; {2820#true} is VALID [2022-04-27 15:09:22,620 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2820#true} {2820#true} #234#return; {2820#true} is VALID [2022-04-27 15:09:22,620 INFO L272 TraceCheckUtils]: 0: Hoare triple {2820#true} call ULTIMATE.init(); {2826#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:22,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {2826#(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(16, 2);call #Ultimate.allocInit(12, 3); {2820#true} is VALID [2022-04-27 15:09:22,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {2820#true} assume true; {2820#true} is VALID [2022-04-27 15:09:22,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2820#true} {2820#true} #234#return; {2820#true} is VALID [2022-04-27 15:09:22,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {2820#true} call #t~ret17 := main(); {2820#true} is VALID [2022-04-27 15:09:22,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {2820#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {2820#true} is VALID [2022-04-27 15:09:22,621 INFO L290 TraceCheckUtils]: 6: Hoare triple {2820#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {2820#true} is VALID [2022-04-27 15:09:22,622 INFO L290 TraceCheckUtils]: 7: Hoare triple {2820#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {2820#true} is VALID [2022-04-27 15:09:22,622 INFO L290 TraceCheckUtils]: 8: Hoare triple {2820#true} assume !(0 != ~p1~0); {2820#true} is VALID [2022-04-27 15:09:22,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {2820#true} assume !(0 != ~p2~0); {2820#true} is VALID [2022-04-27 15:09:22,622 INFO L290 TraceCheckUtils]: 10: Hoare triple {2820#true} assume 0 != ~p3~0;~lk3~0 := 1; {2825#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:22,622 INFO L290 TraceCheckUtils]: 11: Hoare triple {2825#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2825#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:22,623 INFO L290 TraceCheckUtils]: 12: Hoare triple {2825#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2825#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:22,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {2825#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {2825#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:22,623 INFO L290 TraceCheckUtils]: 14: Hoare triple {2825#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {2825#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:22,624 INFO L290 TraceCheckUtils]: 15: Hoare triple {2825#(= main_~lk3~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {2825#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:22,624 INFO L290 TraceCheckUtils]: 16: Hoare triple {2825#(= main_~lk3~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {2825#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:22,624 INFO L290 TraceCheckUtils]: 17: Hoare triple {2825#(= main_~lk3~0 1)} assume !(0 != ~p10~0); {2825#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:22,625 INFO L290 TraceCheckUtils]: 18: Hoare triple {2825#(= main_~lk3~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {2825#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:22,625 INFO L290 TraceCheckUtils]: 19: Hoare triple {2825#(= main_~lk3~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {2825#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:22,625 INFO L290 TraceCheckUtils]: 20: Hoare triple {2825#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {2825#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:22,626 INFO L290 TraceCheckUtils]: 21: Hoare triple {2825#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {2825#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:22,626 INFO L290 TraceCheckUtils]: 22: Hoare triple {2825#(= main_~lk3~0 1)} assume 0 != ~p3~0; {2825#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:22,626 INFO L290 TraceCheckUtils]: 23: Hoare triple {2825#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {2821#false} is VALID [2022-04-27 15:09:22,627 INFO L290 TraceCheckUtils]: 24: Hoare triple {2821#false} assume !false; {2821#false} is VALID [2022-04-27 15:09:22,627 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:09:22,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:22,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829019165] [2022-04-27 15:09:22,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829019165] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:22,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:22,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:22,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923751646] [2022-04-27 15:09:22,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:22,628 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 15:09:22,628 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:22,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:22,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:22,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:22,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:22,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:22,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:22,642 INFO L87 Difference]: Start difference. First operand 159 states and 283 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:22,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:22,828 INFO L93 Difference]: Finished difference Result 299 states and 539 transitions. [2022-04-27 15:09:22,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:22,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 15:09:22,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:22,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:22,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-27 15:09:22,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:22,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-27 15:09:22,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 147 transitions. [2022-04-27 15:09:22,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:22,932 INFO L225 Difference]: With dead ends: 299 [2022-04-27 15:09:22,932 INFO L226 Difference]: Without dead ends: 297 [2022-04-27 15:09:22,933 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:09:22,933 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 188 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:22,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 88 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:09:22,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-04-27 15:09:22,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 215. [2022-04-27 15:09:22,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:22,939 INFO L82 GeneralOperation]: Start isEquivalent. First operand 297 states. Second operand has 215 states, 211 states have (on average 1.7914691943127963) internal successors, (378), 211 states have internal predecessors, (378), 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:09:22,940 INFO L74 IsIncluded]: Start isIncluded. First operand 297 states. Second operand has 215 states, 211 states have (on average 1.7914691943127963) internal successors, (378), 211 states have internal predecessors, (378), 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:09:22,941 INFO L87 Difference]: Start difference. First operand 297 states. Second operand has 215 states, 211 states have (on average 1.7914691943127963) internal successors, (378), 211 states have internal predecessors, (378), 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:09:22,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:22,947 INFO L93 Difference]: Finished difference Result 297 states and 534 transitions. [2022-04-27 15:09:22,948 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 534 transitions. [2022-04-27 15:09:22,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:22,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:22,948 INFO L74 IsIncluded]: Start isIncluded. First operand has 215 states, 211 states have (on average 1.7914691943127963) internal successors, (378), 211 states have internal predecessors, (378), 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 297 states. [2022-04-27 15:09:22,949 INFO L87 Difference]: Start difference. First operand has 215 states, 211 states have (on average 1.7914691943127963) internal successors, (378), 211 states have internal predecessors, (378), 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 297 states. [2022-04-27 15:09:22,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:22,956 INFO L93 Difference]: Finished difference Result 297 states and 534 transitions. [2022-04-27 15:09:22,956 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 534 transitions. [2022-04-27 15:09:22,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:22,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:22,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:22,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:22,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 211 states have (on average 1.7914691943127963) internal successors, (378), 211 states have internal predecessors, (378), 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:09:22,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 381 transitions. [2022-04-27 15:09:22,961 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 381 transitions. Word has length 25 [2022-04-27 15:09:22,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:22,962 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 381 transitions. [2022-04-27 15:09:22,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:22,962 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 381 transitions. [2022-04-27 15:09:22,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 15:09:22,962 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:22,963 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, 1, 1, 1, 1, 1] [2022-04-27 15:09:22,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 15:09:22,967 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:22,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:22,968 INFO L85 PathProgramCache]: Analyzing trace with hash 616169106, now seen corresponding path program 1 times [2022-04-27 15:09:22,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:22,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788191901] [2022-04-27 15:09:22,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:22,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:22,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:23,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:23,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:23,020 INFO L290 TraceCheckUtils]: 0: Hoare triple {3972#(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(16, 2);call #Ultimate.allocInit(12, 3); {3966#true} is VALID [2022-04-27 15:09:23,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {3966#true} assume true; {3966#true} is VALID [2022-04-27 15:09:23,020 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3966#true} {3966#true} #234#return; {3966#true} is VALID [2022-04-27 15:09:23,021 INFO L272 TraceCheckUtils]: 0: Hoare triple {3966#true} call ULTIMATE.init(); {3972#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:23,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {3972#(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(16, 2);call #Ultimate.allocInit(12, 3); {3966#true} is VALID [2022-04-27 15:09:23,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {3966#true} assume true; {3966#true} is VALID [2022-04-27 15:09:23,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3966#true} {3966#true} #234#return; {3966#true} is VALID [2022-04-27 15:09:23,021 INFO L272 TraceCheckUtils]: 4: Hoare triple {3966#true} call #t~ret17 := main(); {3966#true} is VALID [2022-04-27 15:09:23,021 INFO L290 TraceCheckUtils]: 5: Hoare triple {3966#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {3966#true} is VALID [2022-04-27 15:09:23,027 INFO L290 TraceCheckUtils]: 6: Hoare triple {3966#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {3966#true} is VALID [2022-04-27 15:09:23,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {3966#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {3966#true} is VALID [2022-04-27 15:09:23,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {3966#true} assume !(0 != ~p1~0); {3966#true} is VALID [2022-04-27 15:09:23,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {3966#true} assume !(0 != ~p2~0); {3966#true} is VALID [2022-04-27 15:09:23,028 INFO L290 TraceCheckUtils]: 10: Hoare triple {3966#true} assume !(0 != ~p3~0); {3971#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:23,029 INFO L290 TraceCheckUtils]: 11: Hoare triple {3971#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {3971#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:23,029 INFO L290 TraceCheckUtils]: 12: Hoare triple {3971#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {3971#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:23,029 INFO L290 TraceCheckUtils]: 13: Hoare triple {3971#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {3971#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:23,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {3971#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {3971#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:23,031 INFO L290 TraceCheckUtils]: 15: Hoare triple {3971#(= main_~p3~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {3971#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:23,031 INFO L290 TraceCheckUtils]: 16: Hoare triple {3971#(= main_~p3~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {3971#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:23,032 INFO L290 TraceCheckUtils]: 17: Hoare triple {3971#(= main_~p3~0 0)} assume !(0 != ~p10~0); {3971#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:23,033 INFO L290 TraceCheckUtils]: 18: Hoare triple {3971#(= main_~p3~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {3971#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:23,033 INFO L290 TraceCheckUtils]: 19: Hoare triple {3971#(= main_~p3~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {3971#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:23,033 INFO L290 TraceCheckUtils]: 20: Hoare triple {3971#(= main_~p3~0 0)} assume !(0 != ~p1~0); {3971#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:23,035 INFO L290 TraceCheckUtils]: 21: Hoare triple {3971#(= main_~p3~0 0)} assume !(0 != ~p2~0); {3971#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:23,035 INFO L290 TraceCheckUtils]: 22: Hoare triple {3971#(= main_~p3~0 0)} assume 0 != ~p3~0; {3967#false} is VALID [2022-04-27 15:09:23,036 INFO L290 TraceCheckUtils]: 23: Hoare triple {3967#false} assume 1 != ~lk3~0; {3967#false} is VALID [2022-04-27 15:09:23,036 INFO L290 TraceCheckUtils]: 24: Hoare triple {3967#false} assume !false; {3967#false} is VALID [2022-04-27 15:09:23,036 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:09:23,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:23,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788191901] [2022-04-27 15:09:23,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788191901] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:23,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:23,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:23,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478737719] [2022-04-27 15:09:23,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:23,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 15:09:23,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:23,037 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:23,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:23,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:23,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:23,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:23,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:23,054 INFO L87 Difference]: Start difference. First operand 215 states and 381 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:23,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:23,245 INFO L93 Difference]: Finished difference Result 511 states and 915 transitions. [2022-04-27 15:09:23,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:23,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 15:09:23,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:23,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:23,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions. [2022-04-27 15:09:23,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:23,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions. [2022-04-27 15:09:23,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 222 transitions. [2022-04-27 15:09:23,394 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:23,399 INFO L225 Difference]: With dead ends: 511 [2022-04-27 15:09:23,399 INFO L226 Difference]: Without dead ends: 305 [2022-04-27 15:09:23,400 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:09:23,400 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 166 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:23,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 115 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:23,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-04-27 15:09:23,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 303. [2022-04-27 15:09:23,407 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:23,407 INFO L82 GeneralOperation]: Start isEquivalent. First operand 305 states. Second operand has 303 states, 299 states have (on average 1.7792642140468227) internal successors, (532), 299 states have internal predecessors, (532), 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:09:23,408 INFO L74 IsIncluded]: Start isIncluded. First operand 305 states. Second operand has 303 states, 299 states have (on average 1.7792642140468227) internal successors, (532), 299 states have internal predecessors, (532), 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:09:23,408 INFO L87 Difference]: Start difference. First operand 305 states. Second operand has 303 states, 299 states have (on average 1.7792642140468227) internal successors, (532), 299 states have internal predecessors, (532), 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:09:23,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:23,414 INFO L93 Difference]: Finished difference Result 305 states and 536 transitions. [2022-04-27 15:09:23,414 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 536 transitions. [2022-04-27 15:09:23,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:23,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:23,415 INFO L74 IsIncluded]: Start isIncluded. First operand has 303 states, 299 states have (on average 1.7792642140468227) internal successors, (532), 299 states have internal predecessors, (532), 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 305 states. [2022-04-27 15:09:23,415 INFO L87 Difference]: Start difference. First operand has 303 states, 299 states have (on average 1.7792642140468227) internal successors, (532), 299 states have internal predecessors, (532), 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 305 states. [2022-04-27 15:09:23,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:23,421 INFO L93 Difference]: Finished difference Result 305 states and 536 transitions. [2022-04-27 15:09:23,421 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 536 transitions. [2022-04-27 15:09:23,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:23,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:23,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:23,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:23,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 299 states have (on average 1.7792642140468227) internal successors, (532), 299 states have internal predecessors, (532), 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:09:23,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 535 transitions. [2022-04-27 15:09:23,427 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 535 transitions. Word has length 25 [2022-04-27 15:09:23,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:23,428 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 535 transitions. [2022-04-27 15:09:23,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:23,428 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 535 transitions. [2022-04-27 15:09:23,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 15:09:23,428 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:23,428 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, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:23,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-27 15:09:23,428 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:23,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:23,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1352312423, now seen corresponding path program 1 times [2022-04-27 15:09:23,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:23,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93219565] [2022-04-27 15:09:23,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:23,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:23,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:23,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:23,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:23,461 INFO L290 TraceCheckUtils]: 0: Hoare triple {5442#(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(16, 2);call #Ultimate.allocInit(12, 3); {5436#true} is VALID [2022-04-27 15:09:23,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {5436#true} assume true; {5436#true} is VALID [2022-04-27 15:09:23,461 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5436#true} {5436#true} #234#return; {5436#true} is VALID [2022-04-27 15:09:23,462 INFO L272 TraceCheckUtils]: 0: Hoare triple {5436#true} call ULTIMATE.init(); {5442#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:23,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {5442#(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(16, 2);call #Ultimate.allocInit(12, 3); {5436#true} is VALID [2022-04-27 15:09:23,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {5436#true} assume true; {5436#true} is VALID [2022-04-27 15:09:23,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5436#true} {5436#true} #234#return; {5436#true} is VALID [2022-04-27 15:09:23,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {5436#true} call #t~ret17 := main(); {5436#true} is VALID [2022-04-27 15:09:23,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {5436#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {5436#true} is VALID [2022-04-27 15:09:23,462 INFO L290 TraceCheckUtils]: 6: Hoare triple {5436#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {5436#true} is VALID [2022-04-27 15:09:23,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {5436#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {5436#true} is VALID [2022-04-27 15:09:23,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {5436#true} assume !(0 != ~p1~0); {5436#true} is VALID [2022-04-27 15:09:23,462 INFO L290 TraceCheckUtils]: 9: Hoare triple {5436#true} assume !(0 != ~p2~0); {5436#true} is VALID [2022-04-27 15:09:23,463 INFO L290 TraceCheckUtils]: 10: Hoare triple {5436#true} assume 0 != ~p3~0;~lk3~0 := 1; {5441#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:23,463 INFO L290 TraceCheckUtils]: 11: Hoare triple {5441#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {5441#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:23,463 INFO L290 TraceCheckUtils]: 12: Hoare triple {5441#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {5441#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:23,463 INFO L290 TraceCheckUtils]: 13: Hoare triple {5441#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {5441#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:23,464 INFO L290 TraceCheckUtils]: 14: Hoare triple {5441#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {5441#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:23,464 INFO L290 TraceCheckUtils]: 15: Hoare triple {5441#(not (= main_~p3~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {5441#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:23,464 INFO L290 TraceCheckUtils]: 16: Hoare triple {5441#(not (= main_~p3~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {5441#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:23,464 INFO L290 TraceCheckUtils]: 17: Hoare triple {5441#(not (= main_~p3~0 0))} assume !(0 != ~p10~0); {5441#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:23,465 INFO L290 TraceCheckUtils]: 18: Hoare triple {5441#(not (= main_~p3~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {5441#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:23,465 INFO L290 TraceCheckUtils]: 19: Hoare triple {5441#(not (= main_~p3~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {5441#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:23,465 INFO L290 TraceCheckUtils]: 20: Hoare triple {5441#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {5441#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:23,465 INFO L290 TraceCheckUtils]: 21: Hoare triple {5441#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {5441#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:23,466 INFO L290 TraceCheckUtils]: 22: Hoare triple {5441#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {5437#false} is VALID [2022-04-27 15:09:23,466 INFO L290 TraceCheckUtils]: 23: Hoare triple {5437#false} assume 0 != ~p4~0; {5437#false} is VALID [2022-04-27 15:09:23,466 INFO L290 TraceCheckUtils]: 24: Hoare triple {5437#false} assume 1 != ~lk4~0; {5437#false} is VALID [2022-04-27 15:09:23,466 INFO L290 TraceCheckUtils]: 25: Hoare triple {5437#false} assume !false; {5437#false} is VALID [2022-04-27 15:09:23,466 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:09:23,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:23,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93219565] [2022-04-27 15:09:23,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93219565] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:23,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:23,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:23,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467857519] [2022-04-27 15:09:23,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:23,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 26 [2022-04-27 15:09:23,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:23,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:09:23,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:23,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:23,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:23,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:23,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:23,489 INFO L87 Difference]: Start difference. First operand 303 states and 535 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:09:23,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:23,680 INFO L93 Difference]: Finished difference Result 457 states and 805 transitions. [2022-04-27 15:09:23,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:23,680 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 26 [2022-04-27 15:09:23,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:23,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:09:23,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions. [2022-04-27 15:09:23,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:09:23,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions. [2022-04-27 15:09:23,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 217 transitions. [2022-04-27 15:09:23,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 217 edges. 217 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:23,827 INFO L225 Difference]: With dead ends: 457 [2022-04-27 15:09:23,827 INFO L226 Difference]: Without dead ends: 311 [2022-04-27 15:09:23,828 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:09:23,828 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 155 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:23,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 127 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:23,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-04-27 15:09:23,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 309. [2022-04-27 15:09:23,833 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:23,834 INFO L82 GeneralOperation]: Start isEquivalent. First operand 311 states. Second operand has 309 states, 305 states have (on average 1.7573770491803278) internal successors, (536), 305 states have internal predecessors, (536), 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:09:23,835 INFO L74 IsIncluded]: Start isIncluded. First operand 311 states. Second operand has 309 states, 305 states have (on average 1.7573770491803278) internal successors, (536), 305 states have internal predecessors, (536), 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:09:23,835 INFO L87 Difference]: Start difference. First operand 311 states. Second operand has 309 states, 305 states have (on average 1.7573770491803278) internal successors, (536), 305 states have internal predecessors, (536), 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:09:23,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:23,841 INFO L93 Difference]: Finished difference Result 311 states and 540 transitions. [2022-04-27 15:09:23,841 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 540 transitions. [2022-04-27 15:09:23,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:23,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:23,842 INFO L74 IsIncluded]: Start isIncluded. First operand has 309 states, 305 states have (on average 1.7573770491803278) internal successors, (536), 305 states have internal predecessors, (536), 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 311 states. [2022-04-27 15:09:23,843 INFO L87 Difference]: Start difference. First operand has 309 states, 305 states have (on average 1.7573770491803278) internal successors, (536), 305 states have internal predecessors, (536), 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 311 states. [2022-04-27 15:09:23,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:23,848 INFO L93 Difference]: Finished difference Result 311 states and 540 transitions. [2022-04-27 15:09:23,848 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 540 transitions. [2022-04-27 15:09:23,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:23,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:23,849 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:23,849 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:23,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 305 states have (on average 1.7573770491803278) internal successors, (536), 305 states have internal predecessors, (536), 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:09:23,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 539 transitions. [2022-04-27 15:09:23,855 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 539 transitions. Word has length 26 [2022-04-27 15:09:23,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:23,855 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 539 transitions. [2022-04-27 15:09:23,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:09:23,855 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 539 transitions. [2022-04-27 15:09:23,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 15:09:23,856 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:23,856 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, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:23,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-27 15:09:23,856 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:23,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:23,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1921586519, now seen corresponding path program 1 times [2022-04-27 15:09:23,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:23,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377970955] [2022-04-27 15:09:23,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:23,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:23,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:23,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:23,901 INFO L290 TraceCheckUtils]: 0: Hoare triple {6876#(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(16, 2);call #Ultimate.allocInit(12, 3); {6870#true} is VALID [2022-04-27 15:09:23,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {6870#true} assume true; {6870#true} is VALID [2022-04-27 15:09:23,901 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6870#true} {6870#true} #234#return; {6870#true} is VALID [2022-04-27 15:09:23,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {6870#true} call ULTIMATE.init(); {6876#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:23,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {6876#(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(16, 2);call #Ultimate.allocInit(12, 3); {6870#true} is VALID [2022-04-27 15:09:23,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {6870#true} assume true; {6870#true} is VALID [2022-04-27 15:09:23,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6870#true} {6870#true} #234#return; {6870#true} is VALID [2022-04-27 15:09:23,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {6870#true} call #t~ret17 := main(); {6870#true} is VALID [2022-04-27 15:09:23,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {6870#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {6870#true} is VALID [2022-04-27 15:09:23,902 INFO L290 TraceCheckUtils]: 6: Hoare triple {6870#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {6870#true} is VALID [2022-04-27 15:09:23,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {6870#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {6870#true} is VALID [2022-04-27 15:09:23,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {6870#true} assume !(0 != ~p1~0); {6870#true} is VALID [2022-04-27 15:09:23,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {6870#true} assume !(0 != ~p2~0); {6870#true} is VALID [2022-04-27 15:09:23,902 INFO L290 TraceCheckUtils]: 10: Hoare triple {6870#true} assume !(0 != ~p3~0); {6870#true} is VALID [2022-04-27 15:09:23,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {6870#true} assume 0 != ~p4~0;~lk4~0 := 1; {6875#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:23,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {6875#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {6875#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:23,903 INFO L290 TraceCheckUtils]: 13: Hoare triple {6875#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {6875#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:23,903 INFO L290 TraceCheckUtils]: 14: Hoare triple {6875#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {6875#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:23,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {6875#(= main_~lk4~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {6875#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:23,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {6875#(= main_~lk4~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {6875#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:23,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {6875#(= main_~lk4~0 1)} assume !(0 != ~p10~0); {6875#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:23,904 INFO L290 TraceCheckUtils]: 18: Hoare triple {6875#(= main_~lk4~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {6875#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:23,905 INFO L290 TraceCheckUtils]: 19: Hoare triple {6875#(= main_~lk4~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {6875#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:23,905 INFO L290 TraceCheckUtils]: 20: Hoare triple {6875#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {6875#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:23,905 INFO L290 TraceCheckUtils]: 21: Hoare triple {6875#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {6875#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:23,906 INFO L290 TraceCheckUtils]: 22: Hoare triple {6875#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {6875#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:23,906 INFO L290 TraceCheckUtils]: 23: Hoare triple {6875#(= main_~lk4~0 1)} assume 0 != ~p4~0; {6875#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:23,906 INFO L290 TraceCheckUtils]: 24: Hoare triple {6875#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {6871#false} is VALID [2022-04-27 15:09:23,906 INFO L290 TraceCheckUtils]: 25: Hoare triple {6871#false} assume !false; {6871#false} is VALID [2022-04-27 15:09:23,906 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:09:23,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:23,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377970955] [2022-04-27 15:09:23,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377970955] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:23,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:23,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:23,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190891506] [2022-04-27 15:09:23,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:23,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 26 [2022-04-27 15:09:23,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:23,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:09:23,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:23,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:23,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:23,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:23,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:23,922 INFO L87 Difference]: Start difference. First operand 309 states and 539 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:09:24,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:24,118 INFO L93 Difference]: Finished difference Result 573 states and 1013 transitions. [2022-04-27 15:09:24,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:24,118 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 26 [2022-04-27 15:09:24,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:24,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:09:24,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2022-04-27 15:09:24,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:09:24,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2022-04-27 15:09:24,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 143 transitions. [2022-04-27 15:09:24,209 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:24,222 INFO L225 Difference]: With dead ends: 573 [2022-04-27 15:09:24,222 INFO L226 Difference]: Without dead ends: 571 [2022-04-27 15:09:24,223 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:09:24,223 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 181 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:24,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 87 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:24,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-04-27 15:09:24,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 425. [2022-04-27 15:09:24,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:24,231 INFO L82 GeneralOperation]: Start isEquivalent. First operand 571 states. Second operand has 425 states, 421 states have (on average 1.7292161520190024) internal successors, (728), 421 states have internal predecessors, (728), 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:09:24,231 INFO L74 IsIncluded]: Start isIncluded. First operand 571 states. Second operand has 425 states, 421 states have (on average 1.7292161520190024) internal successors, (728), 421 states have internal predecessors, (728), 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:09:24,232 INFO L87 Difference]: Start difference. First operand 571 states. Second operand has 425 states, 421 states have (on average 1.7292161520190024) internal successors, (728), 421 states have internal predecessors, (728), 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:09:24,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:24,245 INFO L93 Difference]: Finished difference Result 571 states and 1004 transitions. [2022-04-27 15:09:24,245 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 1004 transitions. [2022-04-27 15:09:24,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:24,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:24,247 INFO L74 IsIncluded]: Start isIncluded. First operand has 425 states, 421 states have (on average 1.7292161520190024) internal successors, (728), 421 states have internal predecessors, (728), 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 571 states. [2022-04-27 15:09:24,248 INFO L87 Difference]: Start difference. First operand has 425 states, 421 states have (on average 1.7292161520190024) internal successors, (728), 421 states have internal predecessors, (728), 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 571 states. [2022-04-27 15:09:24,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:24,261 INFO L93 Difference]: Finished difference Result 571 states and 1004 transitions. [2022-04-27 15:09:24,261 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 1004 transitions. [2022-04-27 15:09:24,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:24,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:24,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:24,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:24,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 421 states have (on average 1.7292161520190024) internal successors, (728), 421 states have internal predecessors, (728), 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:09:24,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 731 transitions. [2022-04-27 15:09:24,271 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 731 transitions. Word has length 26 [2022-04-27 15:09:24,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:24,272 INFO L495 AbstractCegarLoop]: Abstraction has 425 states and 731 transitions. [2022-04-27 15:09:24,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:09:24,272 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 731 transitions. [2022-04-27 15:09:24,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 15:09:24,272 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:24,272 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, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:24,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-27 15:09:24,273 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:24,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:24,273 INFO L85 PathProgramCache]: Analyzing trace with hash 641722841, now seen corresponding path program 1 times [2022-04-27 15:09:24,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:24,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087624805] [2022-04-27 15:09:24,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:24,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:24,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:24,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:24,321 INFO L290 TraceCheckUtils]: 0: Hoare triple {9066#(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(16, 2);call #Ultimate.allocInit(12, 3); {9060#true} is VALID [2022-04-27 15:09:24,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {9060#true} assume true; {9060#true} is VALID [2022-04-27 15:09:24,322 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9060#true} {9060#true} #234#return; {9060#true} is VALID [2022-04-27 15:09:24,322 INFO L272 TraceCheckUtils]: 0: Hoare triple {9060#true} call ULTIMATE.init(); {9066#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:24,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {9066#(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(16, 2);call #Ultimate.allocInit(12, 3); {9060#true} is VALID [2022-04-27 15:09:24,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {9060#true} assume true; {9060#true} is VALID [2022-04-27 15:09:24,322 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9060#true} {9060#true} #234#return; {9060#true} is VALID [2022-04-27 15:09:24,322 INFO L272 TraceCheckUtils]: 4: Hoare triple {9060#true} call #t~ret17 := main(); {9060#true} is VALID [2022-04-27 15:09:24,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {9060#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {9060#true} is VALID [2022-04-27 15:09:24,323 INFO L290 TraceCheckUtils]: 6: Hoare triple {9060#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {9060#true} is VALID [2022-04-27 15:09:24,323 INFO L290 TraceCheckUtils]: 7: Hoare triple {9060#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {9060#true} is VALID [2022-04-27 15:09:24,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {9060#true} assume !(0 != ~p1~0); {9060#true} is VALID [2022-04-27 15:09:24,323 INFO L290 TraceCheckUtils]: 9: Hoare triple {9060#true} assume !(0 != ~p2~0); {9060#true} is VALID [2022-04-27 15:09:24,323 INFO L290 TraceCheckUtils]: 10: Hoare triple {9060#true} assume !(0 != ~p3~0); {9060#true} is VALID [2022-04-27 15:09:24,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {9060#true} assume !(0 != ~p4~0); {9065#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:24,323 INFO L290 TraceCheckUtils]: 12: Hoare triple {9065#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {9065#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:24,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {9065#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {9065#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:24,324 INFO L290 TraceCheckUtils]: 14: Hoare triple {9065#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {9065#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:24,324 INFO L290 TraceCheckUtils]: 15: Hoare triple {9065#(= main_~p4~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {9065#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:24,324 INFO L290 TraceCheckUtils]: 16: Hoare triple {9065#(= main_~p4~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {9065#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:24,325 INFO L290 TraceCheckUtils]: 17: Hoare triple {9065#(= main_~p4~0 0)} assume !(0 != ~p10~0); {9065#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:24,325 INFO L290 TraceCheckUtils]: 18: Hoare triple {9065#(= main_~p4~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {9065#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:24,325 INFO L290 TraceCheckUtils]: 19: Hoare triple {9065#(= main_~p4~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {9065#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:24,325 INFO L290 TraceCheckUtils]: 20: Hoare triple {9065#(= main_~p4~0 0)} assume !(0 != ~p1~0); {9065#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:24,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {9065#(= main_~p4~0 0)} assume !(0 != ~p2~0); {9065#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:24,326 INFO L290 TraceCheckUtils]: 22: Hoare triple {9065#(= main_~p4~0 0)} assume !(0 != ~p3~0); {9065#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:24,326 INFO L290 TraceCheckUtils]: 23: Hoare triple {9065#(= main_~p4~0 0)} assume 0 != ~p4~0; {9061#false} is VALID [2022-04-27 15:09:24,326 INFO L290 TraceCheckUtils]: 24: Hoare triple {9061#false} assume 1 != ~lk4~0; {9061#false} is VALID [2022-04-27 15:09:24,326 INFO L290 TraceCheckUtils]: 25: Hoare triple {9061#false} assume !false; {9061#false} is VALID [2022-04-27 15:09:24,327 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:09:24,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:24,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087624805] [2022-04-27 15:09:24,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087624805] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:24,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:24,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:24,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259739388] [2022-04-27 15:09:24,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:24,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 26 [2022-04-27 15:09:24,327 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:24,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:09:24,340 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:24,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:24,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:24,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:24,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:24,341 INFO L87 Difference]: Start difference. First operand 425 states and 731 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:09:24,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:24,550 INFO L93 Difference]: Finished difference Result 1005 states and 1741 transitions. [2022-04-27 15:09:24,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:24,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 26 [2022-04-27 15:09:24,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:24,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:09:24,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 219 transitions. [2022-04-27 15:09:24,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:09:24,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 219 transitions. [2022-04-27 15:09:24,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 219 transitions. [2022-04-27 15:09:24,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 219 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:24,708 INFO L225 Difference]: With dead ends: 1005 [2022-04-27 15:09:24,709 INFO L226 Difference]: Without dead ends: 595 [2022-04-27 15:09:24,709 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:09:24,710 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 160 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:24,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 117 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:24,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2022-04-27 15:09:24,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 593. [2022-04-27 15:09:24,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:24,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 595 states. Second operand has 593 states, 589 states have (on average 1.7181663837011885) internal successors, (1012), 589 states have internal predecessors, (1012), 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:09:24,720 INFO L74 IsIncluded]: Start isIncluded. First operand 595 states. Second operand has 593 states, 589 states have (on average 1.7181663837011885) internal successors, (1012), 589 states have internal predecessors, (1012), 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:09:24,721 INFO L87 Difference]: Start difference. First operand 595 states. Second operand has 593 states, 589 states have (on average 1.7181663837011885) internal successors, (1012), 589 states have internal predecessors, (1012), 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:09:24,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:24,735 INFO L93 Difference]: Finished difference Result 595 states and 1016 transitions. [2022-04-27 15:09:24,735 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 1016 transitions. [2022-04-27 15:09:24,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:24,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:24,736 INFO L74 IsIncluded]: Start isIncluded. First operand has 593 states, 589 states have (on average 1.7181663837011885) internal successors, (1012), 589 states have internal predecessors, (1012), 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 595 states. [2022-04-27 15:09:24,737 INFO L87 Difference]: Start difference. First operand has 593 states, 589 states have (on average 1.7181663837011885) internal successors, (1012), 589 states have internal predecessors, (1012), 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 595 states. [2022-04-27 15:09:24,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:24,751 INFO L93 Difference]: Finished difference Result 595 states and 1016 transitions. [2022-04-27 15:09:24,751 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 1016 transitions. [2022-04-27 15:09:24,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:24,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:24,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:24,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:24,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 589 states have (on average 1.7181663837011885) internal successors, (1012), 589 states have internal predecessors, (1012), 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:09:24,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 1015 transitions. [2022-04-27 15:09:24,766 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 1015 transitions. Word has length 26 [2022-04-27 15:09:24,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:24,766 INFO L495 AbstractCegarLoop]: Abstraction has 593 states and 1015 transitions. [2022-04-27 15:09:24,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:09:24,766 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 1015 transitions. [2022-04-27 15:09:24,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 15:09:24,767 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:24,767 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, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:24,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-27 15:09:24,767 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:24,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:24,768 INFO L85 PathProgramCache]: Analyzing trace with hash -560146297, now seen corresponding path program 1 times [2022-04-27 15:09:24,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:24,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837324645] [2022-04-27 15:09:24,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:24,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:24,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:24,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:24,810 INFO L290 TraceCheckUtils]: 0: Hoare triple {11920#(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(16, 2);call #Ultimate.allocInit(12, 3); {11914#true} is VALID [2022-04-27 15:09:24,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {11914#true} assume true; {11914#true} is VALID [2022-04-27 15:09:24,811 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11914#true} {11914#true} #234#return; {11914#true} is VALID [2022-04-27 15:09:24,811 INFO L272 TraceCheckUtils]: 0: Hoare triple {11914#true} call ULTIMATE.init(); {11920#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:24,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {11920#(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(16, 2);call #Ultimate.allocInit(12, 3); {11914#true} is VALID [2022-04-27 15:09:24,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {11914#true} assume true; {11914#true} is VALID [2022-04-27 15:09:24,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11914#true} {11914#true} #234#return; {11914#true} is VALID [2022-04-27 15:09:24,811 INFO L272 TraceCheckUtils]: 4: Hoare triple {11914#true} call #t~ret17 := main(); {11914#true} is VALID [2022-04-27 15:09:24,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {11914#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {11914#true} is VALID [2022-04-27 15:09:24,812 INFO L290 TraceCheckUtils]: 6: Hoare triple {11914#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {11914#true} is VALID [2022-04-27 15:09:24,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {11914#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {11914#true} is VALID [2022-04-27 15:09:24,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {11914#true} assume !(0 != ~p1~0); {11914#true} is VALID [2022-04-27 15:09:24,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {11914#true} assume !(0 != ~p2~0); {11914#true} is VALID [2022-04-27 15:09:24,812 INFO L290 TraceCheckUtils]: 10: Hoare triple {11914#true} assume !(0 != ~p3~0); {11914#true} is VALID [2022-04-27 15:09:24,812 INFO L290 TraceCheckUtils]: 11: Hoare triple {11914#true} assume 0 != ~p4~0;~lk4~0 := 1; {11919#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:24,812 INFO L290 TraceCheckUtils]: 12: Hoare triple {11919#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {11919#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:24,813 INFO L290 TraceCheckUtils]: 13: Hoare triple {11919#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {11919#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:24,813 INFO L290 TraceCheckUtils]: 14: Hoare triple {11919#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {11919#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:24,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {11919#(not (= main_~p4~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {11919#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:24,814 INFO L290 TraceCheckUtils]: 16: Hoare triple {11919#(not (= main_~p4~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {11919#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:24,814 INFO L290 TraceCheckUtils]: 17: Hoare triple {11919#(not (= main_~p4~0 0))} assume !(0 != ~p10~0); {11919#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:24,815 INFO L290 TraceCheckUtils]: 18: Hoare triple {11919#(not (= main_~p4~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {11919#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:24,816 INFO L290 TraceCheckUtils]: 19: Hoare triple {11919#(not (= main_~p4~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {11919#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:24,816 INFO L290 TraceCheckUtils]: 20: Hoare triple {11919#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {11919#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:24,816 INFO L290 TraceCheckUtils]: 21: Hoare triple {11919#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {11919#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:24,817 INFO L290 TraceCheckUtils]: 22: Hoare triple {11919#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {11919#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:24,817 INFO L290 TraceCheckUtils]: 23: Hoare triple {11919#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {11915#false} is VALID [2022-04-27 15:09:24,820 INFO L290 TraceCheckUtils]: 24: Hoare triple {11915#false} assume 0 != ~p5~0; {11915#false} is VALID [2022-04-27 15:09:24,820 INFO L290 TraceCheckUtils]: 25: Hoare triple {11915#false} assume 1 != ~lk5~0; {11915#false} is VALID [2022-04-27 15:09:24,820 INFO L290 TraceCheckUtils]: 26: Hoare triple {11915#false} assume !false; {11915#false} is VALID [2022-04-27 15:09:24,821 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:09:24,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:24,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837324645] [2022-04-27 15:09:24,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837324645] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:24,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:24,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:24,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039163179] [2022-04-27 15:09:24,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:24,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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 27 [2022-04-27 15:09:24,822 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:24,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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:09:24,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:24,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:24,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:24,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:24,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:24,836 INFO L87 Difference]: Start difference. First operand 593 states and 1015 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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:09:25,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:25,003 INFO L93 Difference]: Finished difference Result 889 states and 1517 transitions. [2022-04-27 15:09:25,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:25,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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 27 [2022-04-27 15:09:25,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:25,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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:09:25,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 214 transitions. [2022-04-27 15:09:25,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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:09:25,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 214 transitions. [2022-04-27 15:09:25,007 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 214 transitions. [2022-04-27 15:09:25,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 214 edges. 214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:25,157 INFO L225 Difference]: With dead ends: 889 [2022-04-27 15:09:25,157 INFO L226 Difference]: Without dead ends: 603 [2022-04-27 15:09:25,158 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:09:25,159 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 154 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:25,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 124 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:25,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-04-27 15:09:25,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 601. [2022-04-27 15:09:25,173 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:25,174 INFO L82 GeneralOperation]: Start isEquivalent. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.695142378559464) internal successors, (1012), 597 states have internal predecessors, (1012), 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:09:25,176 INFO L74 IsIncluded]: Start isIncluded. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.695142378559464) internal successors, (1012), 597 states have internal predecessors, (1012), 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:09:25,178 INFO L87 Difference]: Start difference. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.695142378559464) internal successors, (1012), 597 states have internal predecessors, (1012), 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:09:25,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:25,205 INFO L93 Difference]: Finished difference Result 603 states and 1016 transitions. [2022-04-27 15:09:25,205 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1016 transitions. [2022-04-27 15:09:25,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:25,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:25,207 INFO L74 IsIncluded]: Start isIncluded. First operand has 601 states, 597 states have (on average 1.695142378559464) internal successors, (1012), 597 states have internal predecessors, (1012), 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 603 states. [2022-04-27 15:09:25,208 INFO L87 Difference]: Start difference. First operand has 601 states, 597 states have (on average 1.695142378559464) internal successors, (1012), 597 states have internal predecessors, (1012), 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 603 states. [2022-04-27 15:09:25,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:25,226 INFO L93 Difference]: Finished difference Result 603 states and 1016 transitions. [2022-04-27 15:09:25,226 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1016 transitions. [2022-04-27 15:09:25,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:25,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:25,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:25,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:25,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 597 states have (on average 1.695142378559464) internal successors, (1012), 597 states have internal predecessors, (1012), 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:09:25,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 1015 transitions. [2022-04-27 15:09:25,244 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 1015 transitions. Word has length 27 [2022-04-27 15:09:25,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:25,244 INFO L495 AbstractCegarLoop]: Abstraction has 601 states and 1015 transitions. [2022-04-27 15:09:25,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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:09:25,245 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 1015 transitions. [2022-04-27 15:09:25,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 15:09:25,245 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:25,246 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, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:25,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-27 15:09:25,246 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:25,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:25,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1581214651, now seen corresponding path program 1 times [2022-04-27 15:09:25,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:25,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406351078] [2022-04-27 15:09:25,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:25,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:25,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:25,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:25,299 INFO L290 TraceCheckUtils]: 0: Hoare triple {14682#(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(16, 2);call #Ultimate.allocInit(12, 3); {14676#true} is VALID [2022-04-27 15:09:25,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {14676#true} assume true; {14676#true} is VALID [2022-04-27 15:09:25,300 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14676#true} {14676#true} #234#return; {14676#true} is VALID [2022-04-27 15:09:25,300 INFO L272 TraceCheckUtils]: 0: Hoare triple {14676#true} call ULTIMATE.init(); {14682#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:25,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {14682#(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(16, 2);call #Ultimate.allocInit(12, 3); {14676#true} is VALID [2022-04-27 15:09:25,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {14676#true} assume true; {14676#true} is VALID [2022-04-27 15:09:25,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14676#true} {14676#true} #234#return; {14676#true} is VALID [2022-04-27 15:09:25,301 INFO L272 TraceCheckUtils]: 4: Hoare triple {14676#true} call #t~ret17 := main(); {14676#true} is VALID [2022-04-27 15:09:25,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {14676#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {14676#true} is VALID [2022-04-27 15:09:25,301 INFO L290 TraceCheckUtils]: 6: Hoare triple {14676#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {14676#true} is VALID [2022-04-27 15:09:25,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {14676#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {14676#true} is VALID [2022-04-27 15:09:25,301 INFO L290 TraceCheckUtils]: 8: Hoare triple {14676#true} assume !(0 != ~p1~0); {14676#true} is VALID [2022-04-27 15:09:25,301 INFO L290 TraceCheckUtils]: 9: Hoare triple {14676#true} assume !(0 != ~p2~0); {14676#true} is VALID [2022-04-27 15:09:25,301 INFO L290 TraceCheckUtils]: 10: Hoare triple {14676#true} assume !(0 != ~p3~0); {14676#true} is VALID [2022-04-27 15:09:25,301 INFO L290 TraceCheckUtils]: 11: Hoare triple {14676#true} assume !(0 != ~p4~0); {14676#true} is VALID [2022-04-27 15:09:25,301 INFO L290 TraceCheckUtils]: 12: Hoare triple {14676#true} assume 0 != ~p5~0;~lk5~0 := 1; {14681#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:25,302 INFO L290 TraceCheckUtils]: 13: Hoare triple {14681#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {14681#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:25,302 INFO L290 TraceCheckUtils]: 14: Hoare triple {14681#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {14681#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:25,302 INFO L290 TraceCheckUtils]: 15: Hoare triple {14681#(= main_~lk5~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {14681#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:25,302 INFO L290 TraceCheckUtils]: 16: Hoare triple {14681#(= main_~lk5~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {14681#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:25,303 INFO L290 TraceCheckUtils]: 17: Hoare triple {14681#(= main_~lk5~0 1)} assume !(0 != ~p10~0); {14681#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:25,303 INFO L290 TraceCheckUtils]: 18: Hoare triple {14681#(= main_~lk5~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {14681#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:25,303 INFO L290 TraceCheckUtils]: 19: Hoare triple {14681#(= main_~lk5~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {14681#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:25,304 INFO L290 TraceCheckUtils]: 20: Hoare triple {14681#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {14681#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:25,304 INFO L290 TraceCheckUtils]: 21: Hoare triple {14681#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {14681#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:25,304 INFO L290 TraceCheckUtils]: 22: Hoare triple {14681#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {14681#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:25,304 INFO L290 TraceCheckUtils]: 23: Hoare triple {14681#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {14681#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:25,305 INFO L290 TraceCheckUtils]: 24: Hoare triple {14681#(= main_~lk5~0 1)} assume 0 != ~p5~0; {14681#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:25,309 INFO L290 TraceCheckUtils]: 25: Hoare triple {14681#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {14677#false} is VALID [2022-04-27 15:09:25,309 INFO L290 TraceCheckUtils]: 26: Hoare triple {14677#false} assume !false; {14677#false} is VALID [2022-04-27 15:09:25,309 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:09:25,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:25,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406351078] [2022-04-27 15:09:25,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406351078] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:25,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:25,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:25,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316359410] [2022-04-27 15:09:25,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:25,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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 27 [2022-04-27 15:09:25,310 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:25,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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:09:25,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:25,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:25,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:25,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:25,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:25,325 INFO L87 Difference]: Start difference. First operand 601 states and 1015 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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:09:25,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:25,532 INFO L93 Difference]: Finished difference Result 1101 states and 1889 transitions. [2022-04-27 15:09:25,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:25,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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 27 [2022-04-27 15:09:25,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:25,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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:09:25,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-27 15:09:25,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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:09:25,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-27 15:09:25,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 139 transitions. [2022-04-27 15:09:25,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:25,667 INFO L225 Difference]: With dead ends: 1101 [2022-04-27 15:09:25,667 INFO L226 Difference]: Without dead ends: 1099 [2022-04-27 15:09:25,669 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:09:25,669 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 174 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:25,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 86 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:25,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2022-04-27 15:09:25,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 841. [2022-04-27 15:09:25,682 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:25,683 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1099 states. Second operand has 841 states, 837 states have (on average 1.6583034647550776) internal successors, (1388), 837 states have internal predecessors, (1388), 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:09:25,684 INFO L74 IsIncluded]: Start isIncluded. First operand 1099 states. Second operand has 841 states, 837 states have (on average 1.6583034647550776) internal successors, (1388), 837 states have internal predecessors, (1388), 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:09:25,685 INFO L87 Difference]: Start difference. First operand 1099 states. Second operand has 841 states, 837 states have (on average 1.6583034647550776) internal successors, (1388), 837 states have internal predecessors, (1388), 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:09:25,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:25,726 INFO L93 Difference]: Finished difference Result 1099 states and 1872 transitions. [2022-04-27 15:09:25,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1872 transitions. [2022-04-27 15:09:25,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:25,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:25,729 INFO L74 IsIncluded]: Start isIncluded. First operand has 841 states, 837 states have (on average 1.6583034647550776) internal successors, (1388), 837 states have internal predecessors, (1388), 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 1099 states. [2022-04-27 15:09:25,730 INFO L87 Difference]: Start difference. First operand has 841 states, 837 states have (on average 1.6583034647550776) internal successors, (1388), 837 states have internal predecessors, (1388), 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 1099 states. [2022-04-27 15:09:25,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:25,805 INFO L93 Difference]: Finished difference Result 1099 states and 1872 transitions. [2022-04-27 15:09:25,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1872 transitions. [2022-04-27 15:09:25,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:25,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:25,806 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:25,806 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:25,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 837 states have (on average 1.6583034647550776) internal successors, (1388), 837 states have internal predecessors, (1388), 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:09:25,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1391 transitions. [2022-04-27 15:09:25,835 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1391 transitions. Word has length 27 [2022-04-27 15:09:25,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:25,835 INFO L495 AbstractCegarLoop]: Abstraction has 841 states and 1391 transitions. [2022-04-27 15:09:25,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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:09:25,836 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1391 transitions. [2022-04-27 15:09:25,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 15:09:25,836 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:25,836 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, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:25,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-27 15:09:25,837 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:25,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:25,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1433888967, now seen corresponding path program 1 times [2022-04-27 15:09:25,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:25,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978783497] [2022-04-27 15:09:25,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:25,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:25,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:25,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:25,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:25,863 INFO L290 TraceCheckUtils]: 0: Hoare triple {18896#(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(16, 2);call #Ultimate.allocInit(12, 3); {18890#true} is VALID [2022-04-27 15:09:25,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {18890#true} assume true; {18890#true} is VALID [2022-04-27 15:09:25,863 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18890#true} {18890#true} #234#return; {18890#true} is VALID [2022-04-27 15:09:25,864 INFO L272 TraceCheckUtils]: 0: Hoare triple {18890#true} call ULTIMATE.init(); {18896#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:25,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {18896#(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(16, 2);call #Ultimate.allocInit(12, 3); {18890#true} is VALID [2022-04-27 15:09:25,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {18890#true} assume true; {18890#true} is VALID [2022-04-27 15:09:25,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18890#true} {18890#true} #234#return; {18890#true} is VALID [2022-04-27 15:09:25,864 INFO L272 TraceCheckUtils]: 4: Hoare triple {18890#true} call #t~ret17 := main(); {18890#true} is VALID [2022-04-27 15:09:25,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {18890#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {18890#true} is VALID [2022-04-27 15:09:25,864 INFO L290 TraceCheckUtils]: 6: Hoare triple {18890#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {18890#true} is VALID [2022-04-27 15:09:25,864 INFO L290 TraceCheckUtils]: 7: Hoare triple {18890#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {18890#true} is VALID [2022-04-27 15:09:25,864 INFO L290 TraceCheckUtils]: 8: Hoare triple {18890#true} assume !(0 != ~p1~0); {18890#true} is VALID [2022-04-27 15:09:25,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {18890#true} assume !(0 != ~p2~0); {18890#true} is VALID [2022-04-27 15:09:25,865 INFO L290 TraceCheckUtils]: 10: Hoare triple {18890#true} assume !(0 != ~p3~0); {18890#true} is VALID [2022-04-27 15:09:25,865 INFO L290 TraceCheckUtils]: 11: Hoare triple {18890#true} assume !(0 != ~p4~0); {18890#true} is VALID [2022-04-27 15:09:25,865 INFO L290 TraceCheckUtils]: 12: Hoare triple {18890#true} assume !(0 != ~p5~0); {18895#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:25,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {18895#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {18895#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:25,865 INFO L290 TraceCheckUtils]: 14: Hoare triple {18895#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {18895#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:25,866 INFO L290 TraceCheckUtils]: 15: Hoare triple {18895#(= main_~p5~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {18895#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:25,866 INFO L290 TraceCheckUtils]: 16: Hoare triple {18895#(= main_~p5~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {18895#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:25,866 INFO L290 TraceCheckUtils]: 17: Hoare triple {18895#(= main_~p5~0 0)} assume !(0 != ~p10~0); {18895#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:25,867 INFO L290 TraceCheckUtils]: 18: Hoare triple {18895#(= main_~p5~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {18895#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:25,867 INFO L290 TraceCheckUtils]: 19: Hoare triple {18895#(= main_~p5~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {18895#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:25,867 INFO L290 TraceCheckUtils]: 20: Hoare triple {18895#(= main_~p5~0 0)} assume !(0 != ~p1~0); {18895#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:25,867 INFO L290 TraceCheckUtils]: 21: Hoare triple {18895#(= main_~p5~0 0)} assume !(0 != ~p2~0); {18895#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:25,868 INFO L290 TraceCheckUtils]: 22: Hoare triple {18895#(= main_~p5~0 0)} assume !(0 != ~p3~0); {18895#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:25,868 INFO L290 TraceCheckUtils]: 23: Hoare triple {18895#(= main_~p5~0 0)} assume !(0 != ~p4~0); {18895#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:25,868 INFO L290 TraceCheckUtils]: 24: Hoare triple {18895#(= main_~p5~0 0)} assume 0 != ~p5~0; {18891#false} is VALID [2022-04-27 15:09:25,868 INFO L290 TraceCheckUtils]: 25: Hoare triple {18891#false} assume 1 != ~lk5~0; {18891#false} is VALID [2022-04-27 15:09:25,868 INFO L290 TraceCheckUtils]: 26: Hoare triple {18891#false} assume !false; {18891#false} is VALID [2022-04-27 15:09:25,869 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:09:25,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:25,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978783497] [2022-04-27 15:09:25,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978783497] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:25,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:25,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:25,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627118613] [2022-04-27 15:09:25,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:25,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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 27 [2022-04-27 15:09:25,870 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:25,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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:09:25,883 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:25,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:25,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:25,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:25,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:25,884 INFO L87 Difference]: Start difference. First operand 841 states and 1391 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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:09:26,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:26,161 INFO L93 Difference]: Finished difference Result 1981 states and 3297 transitions. [2022-04-27 15:09:26,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:26,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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 27 [2022-04-27 15:09:26,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:26,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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:09:26,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 216 transitions. [2022-04-27 15:09:26,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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:09:26,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 216 transitions. [2022-04-27 15:09:26,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 216 transitions. [2022-04-27 15:09:26,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:26,334 INFO L225 Difference]: With dead ends: 1981 [2022-04-27 15:09:26,334 INFO L226 Difference]: Without dead ends: 1163 [2022-04-27 15:09:26,335 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:09:26,336 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 154 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:26,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 119 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:26,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2022-04-27 15:09:26,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1161. [2022-04-27 15:09:26,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:26,352 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1163 states. Second operand has 1161 states, 1157 states have (on average 1.6490924805531546) internal successors, (1908), 1157 states have internal predecessors, (1908), 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:09:26,354 INFO L74 IsIncluded]: Start isIncluded. First operand 1163 states. Second operand has 1161 states, 1157 states have (on average 1.6490924805531546) internal successors, (1908), 1157 states have internal predecessors, (1908), 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:09:26,355 INFO L87 Difference]: Start difference. First operand 1163 states. Second operand has 1161 states, 1157 states have (on average 1.6490924805531546) internal successors, (1908), 1157 states have internal predecessors, (1908), 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:09:26,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:26,398 INFO L93 Difference]: Finished difference Result 1163 states and 1912 transitions. [2022-04-27 15:09:26,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1912 transitions. [2022-04-27 15:09:26,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:26,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:26,401 INFO L74 IsIncluded]: Start isIncluded. First operand has 1161 states, 1157 states have (on average 1.6490924805531546) internal successors, (1908), 1157 states have internal predecessors, (1908), 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 1163 states. [2022-04-27 15:09:26,402 INFO L87 Difference]: Start difference. First operand has 1161 states, 1157 states have (on average 1.6490924805531546) internal successors, (1908), 1157 states have internal predecessors, (1908), 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 1163 states. [2022-04-27 15:09:26,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:26,444 INFO L93 Difference]: Finished difference Result 1163 states and 1912 transitions. [2022-04-27 15:09:26,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1912 transitions. [2022-04-27 15:09:26,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:26,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:26,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:26,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:26,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 1157 states have (on average 1.6490924805531546) internal successors, (1908), 1157 states have internal predecessors, (1908), 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:09:26,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1911 transitions. [2022-04-27 15:09:26,493 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1911 transitions. Word has length 27 [2022-04-27 15:09:26,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:26,493 INFO L495 AbstractCegarLoop]: Abstraction has 1161 states and 1911 transitions. [2022-04-27 15:09:26,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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:09:26,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1911 transitions. [2022-04-27 15:09:26,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 15:09:26,494 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:26,494 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:26,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-27 15:09:26,495 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:26,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:26,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1772799826, now seen corresponding path program 1 times [2022-04-27 15:09:26,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:26,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020498671] [2022-04-27 15:09:26,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:26,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:26,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:26,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:26,527 INFO L290 TraceCheckUtils]: 0: Hoare triple {24470#(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(16, 2);call #Ultimate.allocInit(12, 3); {24464#true} is VALID [2022-04-27 15:09:26,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {24464#true} assume true; {24464#true} is VALID [2022-04-27 15:09:26,527 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24464#true} {24464#true} #234#return; {24464#true} is VALID [2022-04-27 15:09:26,527 INFO L272 TraceCheckUtils]: 0: Hoare triple {24464#true} call ULTIMATE.init(); {24470#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:26,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {24470#(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(16, 2);call #Ultimate.allocInit(12, 3); {24464#true} is VALID [2022-04-27 15:09:26,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {24464#true} assume true; {24464#true} is VALID [2022-04-27 15:09:26,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24464#true} {24464#true} #234#return; {24464#true} is VALID [2022-04-27 15:09:26,532 INFO L272 TraceCheckUtils]: 4: Hoare triple {24464#true} call #t~ret17 := main(); {24464#true} is VALID [2022-04-27 15:09:26,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {24464#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {24464#true} is VALID [2022-04-27 15:09:26,534 INFO L290 TraceCheckUtils]: 6: Hoare triple {24464#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {24464#true} is VALID [2022-04-27 15:09:26,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {24464#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {24464#true} is VALID [2022-04-27 15:09:26,534 INFO L290 TraceCheckUtils]: 8: Hoare triple {24464#true} assume !(0 != ~p1~0); {24464#true} is VALID [2022-04-27 15:09:26,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {24464#true} assume !(0 != ~p2~0); {24464#true} is VALID [2022-04-27 15:09:26,534 INFO L290 TraceCheckUtils]: 10: Hoare triple {24464#true} assume !(0 != ~p3~0); {24464#true} is VALID [2022-04-27 15:09:26,535 INFO L290 TraceCheckUtils]: 11: Hoare triple {24464#true} assume !(0 != ~p4~0); {24464#true} is VALID [2022-04-27 15:09:26,535 INFO L290 TraceCheckUtils]: 12: Hoare triple {24464#true} assume 0 != ~p5~0;~lk5~0 := 1; {24469#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:26,536 INFO L290 TraceCheckUtils]: 13: Hoare triple {24469#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {24469#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:26,538 INFO L290 TraceCheckUtils]: 14: Hoare triple {24469#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {24469#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:26,538 INFO L290 TraceCheckUtils]: 15: Hoare triple {24469#(not (= main_~p5~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {24469#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:26,539 INFO L290 TraceCheckUtils]: 16: Hoare triple {24469#(not (= main_~p5~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {24469#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:26,539 INFO L290 TraceCheckUtils]: 17: Hoare triple {24469#(not (= main_~p5~0 0))} assume !(0 != ~p10~0); {24469#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:26,539 INFO L290 TraceCheckUtils]: 18: Hoare triple {24469#(not (= main_~p5~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {24469#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:26,539 INFO L290 TraceCheckUtils]: 19: Hoare triple {24469#(not (= main_~p5~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {24469#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:26,539 INFO L290 TraceCheckUtils]: 20: Hoare triple {24469#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {24469#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:26,540 INFO L290 TraceCheckUtils]: 21: Hoare triple {24469#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {24469#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:26,540 INFO L290 TraceCheckUtils]: 22: Hoare triple {24469#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {24469#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:26,540 INFO L290 TraceCheckUtils]: 23: Hoare triple {24469#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {24469#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:26,540 INFO L290 TraceCheckUtils]: 24: Hoare triple {24469#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {24465#false} is VALID [2022-04-27 15:09:26,541 INFO L290 TraceCheckUtils]: 25: Hoare triple {24465#false} assume 0 != ~p6~0; {24465#false} is VALID [2022-04-27 15:09:26,541 INFO L290 TraceCheckUtils]: 26: Hoare triple {24465#false} assume 1 != ~lk6~0; {24465#false} is VALID [2022-04-27 15:09:26,541 INFO L290 TraceCheckUtils]: 27: Hoare triple {24465#false} assume !false; {24465#false} is VALID [2022-04-27 15:09:26,541 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:09:26,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:26,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020498671] [2022-04-27 15:09:26,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020498671] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:26,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:26,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:26,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256381278] [2022-04-27 15:09:26,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:26,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 28 [2022-04-27 15:09:26,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:26,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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:09:26,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:26,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:26,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:26,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:26,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:26,555 INFO L87 Difference]: Start difference. First operand 1161 states and 1911 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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:09:26,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:26,803 INFO L93 Difference]: Finished difference Result 1741 states and 2857 transitions. [2022-04-27 15:09:26,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:26,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 28 [2022-04-27 15:09:26,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:26,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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:09:26,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 211 transitions. [2022-04-27 15:09:26,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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:09:26,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 211 transitions. [2022-04-27 15:09:26,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 211 transitions. [2022-04-27 15:09:26,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:26,997 INFO L225 Difference]: With dead ends: 1741 [2022-04-27 15:09:26,997 INFO L226 Difference]: Without dead ends: 1179 [2022-04-27 15:09:26,998 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:09:26,998 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 153 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:26,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 121 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:27,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2022-04-27 15:09:27,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1177. [2022-04-27 15:09:27,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:27,017 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1179 states. Second operand has 1177 states, 1173 states have (on average 1.6265984654731458) internal successors, (1908), 1173 states have internal predecessors, (1908), 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:09:27,018 INFO L74 IsIncluded]: Start isIncluded. First operand 1179 states. Second operand has 1177 states, 1173 states have (on average 1.6265984654731458) internal successors, (1908), 1173 states have internal predecessors, (1908), 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:09:27,019 INFO L87 Difference]: Start difference. First operand 1179 states. Second operand has 1177 states, 1173 states have (on average 1.6265984654731458) internal successors, (1908), 1173 states have internal predecessors, (1908), 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:09:27,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:27,065 INFO L93 Difference]: Finished difference Result 1179 states and 1912 transitions. [2022-04-27 15:09:27,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1912 transitions. [2022-04-27 15:09:27,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:27,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:27,068 INFO L74 IsIncluded]: Start isIncluded. First operand has 1177 states, 1173 states have (on average 1.6265984654731458) internal successors, (1908), 1173 states have internal predecessors, (1908), 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 1179 states. [2022-04-27 15:09:27,069 INFO L87 Difference]: Start difference. First operand has 1177 states, 1173 states have (on average 1.6265984654731458) internal successors, (1908), 1173 states have internal predecessors, (1908), 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 1179 states. [2022-04-27 15:09:27,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:27,115 INFO L93 Difference]: Finished difference Result 1179 states and 1912 transitions. [2022-04-27 15:09:27,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1912 transitions. [2022-04-27 15:09:27,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:27,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:27,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:27,117 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:27,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 1173 states have (on average 1.6265984654731458) internal successors, (1908), 1173 states have internal predecessors, (1908), 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:09:27,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1911 transitions. [2022-04-27 15:09:27,164 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1911 transitions. Word has length 28 [2022-04-27 15:09:27,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:27,164 INFO L495 AbstractCegarLoop]: Abstraction has 1177 states and 1911 transitions. [2022-04-27 15:09:27,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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:09:27,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1911 transitions. [2022-04-27 15:09:27,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 15:09:27,165 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:27,165 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:27,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-27 15:09:27,165 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:27,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:27,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1501099116, now seen corresponding path program 1 times [2022-04-27 15:09:27,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:27,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714168872] [2022-04-27 15:09:27,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:27,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:27,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:27,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:27,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:27,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {29852#(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(16, 2);call #Ultimate.allocInit(12, 3); {29846#true} is VALID [2022-04-27 15:09:27,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {29846#true} assume true; {29846#true} is VALID [2022-04-27 15:09:27,192 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29846#true} {29846#true} #234#return; {29846#true} is VALID [2022-04-27 15:09:27,193 INFO L272 TraceCheckUtils]: 0: Hoare triple {29846#true} call ULTIMATE.init(); {29852#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:27,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {29852#(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(16, 2);call #Ultimate.allocInit(12, 3); {29846#true} is VALID [2022-04-27 15:09:27,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {29846#true} assume true; {29846#true} is VALID [2022-04-27 15:09:27,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29846#true} {29846#true} #234#return; {29846#true} is VALID [2022-04-27 15:09:27,193 INFO L272 TraceCheckUtils]: 4: Hoare triple {29846#true} call #t~ret17 := main(); {29846#true} is VALID [2022-04-27 15:09:27,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {29846#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {29846#true} is VALID [2022-04-27 15:09:27,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {29846#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {29846#true} is VALID [2022-04-27 15:09:27,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {29846#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {29846#true} is VALID [2022-04-27 15:09:27,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {29846#true} assume !(0 != ~p1~0); {29846#true} is VALID [2022-04-27 15:09:27,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {29846#true} assume !(0 != ~p2~0); {29846#true} is VALID [2022-04-27 15:09:27,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {29846#true} assume !(0 != ~p3~0); {29846#true} is VALID [2022-04-27 15:09:27,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {29846#true} assume !(0 != ~p4~0); {29846#true} is VALID [2022-04-27 15:09:27,194 INFO L290 TraceCheckUtils]: 12: Hoare triple {29846#true} assume !(0 != ~p5~0); {29846#true} is VALID [2022-04-27 15:09:27,194 INFO L290 TraceCheckUtils]: 13: Hoare triple {29846#true} assume 0 != ~p6~0;~lk6~0 := 1; {29851#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:27,195 INFO L290 TraceCheckUtils]: 14: Hoare triple {29851#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {29851#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:27,195 INFO L290 TraceCheckUtils]: 15: Hoare triple {29851#(= main_~lk6~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {29851#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:27,195 INFO L290 TraceCheckUtils]: 16: Hoare triple {29851#(= main_~lk6~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {29851#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:27,196 INFO L290 TraceCheckUtils]: 17: Hoare triple {29851#(= main_~lk6~0 1)} assume !(0 != ~p10~0); {29851#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:27,196 INFO L290 TraceCheckUtils]: 18: Hoare triple {29851#(= main_~lk6~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {29851#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:27,196 INFO L290 TraceCheckUtils]: 19: Hoare triple {29851#(= main_~lk6~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {29851#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:27,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {29851#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {29851#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:27,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {29851#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {29851#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:27,197 INFO L290 TraceCheckUtils]: 22: Hoare triple {29851#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {29851#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:27,198 INFO L290 TraceCheckUtils]: 23: Hoare triple {29851#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {29851#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:27,198 INFO L290 TraceCheckUtils]: 24: Hoare triple {29851#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {29851#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:27,198 INFO L290 TraceCheckUtils]: 25: Hoare triple {29851#(= main_~lk6~0 1)} assume 0 != ~p6~0; {29851#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:27,198 INFO L290 TraceCheckUtils]: 26: Hoare triple {29851#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {29847#false} is VALID [2022-04-27 15:09:27,198 INFO L290 TraceCheckUtils]: 27: Hoare triple {29847#false} assume !false; {29847#false} is VALID [2022-04-27 15:09:27,199 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:09:27,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:27,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714168872] [2022-04-27 15:09:27,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714168872] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:27,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:27,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:27,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690056581] [2022-04-27 15:09:27,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:27,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 28 [2022-04-27 15:09:27,200 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:27,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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:09:27,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:27,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:27,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:27,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:27,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:27,215 INFO L87 Difference]: Start difference. First operand 1177 states and 1911 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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:09:27,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:27,552 INFO L93 Difference]: Finished difference Result 2125 states and 3513 transitions. [2022-04-27 15:09:27,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:27,552 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 28 [2022-04-27 15:09:27,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:27,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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:09:27,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2022-04-27 15:09:27,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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:09:27,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2022-04-27 15:09:27,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 135 transitions. [2022-04-27 15:09:27,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:27,775 INFO L225 Difference]: With dead ends: 2125 [2022-04-27 15:09:27,775 INFO L226 Difference]: Without dead ends: 2123 [2022-04-27 15:09:27,776 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:09:27,776 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 167 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:27,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 85 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:27,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2022-04-27 15:09:27,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 1673. [2022-04-27 15:09:27,797 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:27,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2123 states. Second operand has 1673 states, 1669 states have (on average 1.5841821449970042) internal successors, (2644), 1669 states have internal predecessors, (2644), 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:09:27,800 INFO L74 IsIncluded]: Start isIncluded. First operand 2123 states. Second operand has 1673 states, 1669 states have (on average 1.5841821449970042) internal successors, (2644), 1669 states have internal predecessors, (2644), 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:09:27,802 INFO L87 Difference]: Start difference. First operand 2123 states. Second operand has 1673 states, 1669 states have (on average 1.5841821449970042) internal successors, (2644), 1669 states have internal predecessors, (2644), 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:09:27,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:27,932 INFO L93 Difference]: Finished difference Result 2123 states and 3480 transitions. [2022-04-27 15:09:27,932 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 3480 transitions. [2022-04-27 15:09:27,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:27,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:27,937 INFO L74 IsIncluded]: Start isIncluded. First operand has 1673 states, 1669 states have (on average 1.5841821449970042) internal successors, (2644), 1669 states have internal predecessors, (2644), 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 2123 states. [2022-04-27 15:09:27,938 INFO L87 Difference]: Start difference. First operand has 1673 states, 1669 states have (on average 1.5841821449970042) internal successors, (2644), 1669 states have internal predecessors, (2644), 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 2123 states. [2022-04-27 15:09:28,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:28,089 INFO L93 Difference]: Finished difference Result 2123 states and 3480 transitions. [2022-04-27 15:09:28,090 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 3480 transitions. [2022-04-27 15:09:28,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:28,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:28,092 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:28,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:28,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1673 states, 1669 states have (on average 1.5841821449970042) internal successors, (2644), 1669 states have internal predecessors, (2644), 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:09:28,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 2647 transitions. [2022-04-27 15:09:28,183 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 2647 transitions. Word has length 28 [2022-04-27 15:09:28,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:28,184 INFO L495 AbstractCegarLoop]: Abstraction has 1673 states and 2647 transitions. [2022-04-27 15:09:28,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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:09:28,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 2647 transitions. [2022-04-27 15:09:28,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 15:09:28,185 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:28,185 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:28,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-27 15:09:28,185 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:28,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:28,185 INFO L85 PathProgramCache]: Analyzing trace with hash 221235438, now seen corresponding path program 1 times [2022-04-27 15:09:28,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:28,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832777577] [2022-04-27 15:09:28,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:28,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:28,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:28,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:28,215 INFO L290 TraceCheckUtils]: 0: Hoare triple {38018#(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(16, 2);call #Ultimate.allocInit(12, 3); {38012#true} is VALID [2022-04-27 15:09:28,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {38012#true} assume true; {38012#true} is VALID [2022-04-27 15:09:28,215 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38012#true} {38012#true} #234#return; {38012#true} is VALID [2022-04-27 15:09:28,216 INFO L272 TraceCheckUtils]: 0: Hoare triple {38012#true} call ULTIMATE.init(); {38018#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:28,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {38018#(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(16, 2);call #Ultimate.allocInit(12, 3); {38012#true} is VALID [2022-04-27 15:09:28,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {38012#true} assume true; {38012#true} is VALID [2022-04-27 15:09:28,216 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38012#true} {38012#true} #234#return; {38012#true} is VALID [2022-04-27 15:09:28,216 INFO L272 TraceCheckUtils]: 4: Hoare triple {38012#true} call #t~ret17 := main(); {38012#true} is VALID [2022-04-27 15:09:28,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {38012#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {38012#true} is VALID [2022-04-27 15:09:28,216 INFO L290 TraceCheckUtils]: 6: Hoare triple {38012#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {38012#true} is VALID [2022-04-27 15:09:28,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {38012#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {38012#true} is VALID [2022-04-27 15:09:28,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {38012#true} assume !(0 != ~p1~0); {38012#true} is VALID [2022-04-27 15:09:28,216 INFO L290 TraceCheckUtils]: 9: Hoare triple {38012#true} assume !(0 != ~p2~0); {38012#true} is VALID [2022-04-27 15:09:28,216 INFO L290 TraceCheckUtils]: 10: Hoare triple {38012#true} assume !(0 != ~p3~0); {38012#true} is VALID [2022-04-27 15:09:28,217 INFO L290 TraceCheckUtils]: 11: Hoare triple {38012#true} assume !(0 != ~p4~0); {38012#true} is VALID [2022-04-27 15:09:28,217 INFO L290 TraceCheckUtils]: 12: Hoare triple {38012#true} assume !(0 != ~p5~0); {38012#true} is VALID [2022-04-27 15:09:28,217 INFO L290 TraceCheckUtils]: 13: Hoare triple {38012#true} assume !(0 != ~p6~0); {38017#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:28,217 INFO L290 TraceCheckUtils]: 14: Hoare triple {38017#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {38017#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:28,217 INFO L290 TraceCheckUtils]: 15: Hoare triple {38017#(= main_~p6~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {38017#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:28,218 INFO L290 TraceCheckUtils]: 16: Hoare triple {38017#(= main_~p6~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {38017#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:28,218 INFO L290 TraceCheckUtils]: 17: Hoare triple {38017#(= main_~p6~0 0)} assume !(0 != ~p10~0); {38017#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:28,218 INFO L290 TraceCheckUtils]: 18: Hoare triple {38017#(= main_~p6~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {38017#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:28,219 INFO L290 TraceCheckUtils]: 19: Hoare triple {38017#(= main_~p6~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {38017#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:28,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {38017#(= main_~p6~0 0)} assume !(0 != ~p1~0); {38017#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:28,219 INFO L290 TraceCheckUtils]: 21: Hoare triple {38017#(= main_~p6~0 0)} assume !(0 != ~p2~0); {38017#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:28,219 INFO L290 TraceCheckUtils]: 22: Hoare triple {38017#(= main_~p6~0 0)} assume !(0 != ~p3~0); {38017#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:28,220 INFO L290 TraceCheckUtils]: 23: Hoare triple {38017#(= main_~p6~0 0)} assume !(0 != ~p4~0); {38017#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:28,220 INFO L290 TraceCheckUtils]: 24: Hoare triple {38017#(= main_~p6~0 0)} assume !(0 != ~p5~0); {38017#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:28,220 INFO L290 TraceCheckUtils]: 25: Hoare triple {38017#(= main_~p6~0 0)} assume 0 != ~p6~0; {38013#false} is VALID [2022-04-27 15:09:28,220 INFO L290 TraceCheckUtils]: 26: Hoare triple {38013#false} assume 1 != ~lk6~0; {38013#false} is VALID [2022-04-27 15:09:28,220 INFO L290 TraceCheckUtils]: 27: Hoare triple {38013#false} assume !false; {38013#false} is VALID [2022-04-27 15:09:28,220 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:09:28,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:28,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832777577] [2022-04-27 15:09:28,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832777577] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:28,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:28,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:28,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693543338] [2022-04-27 15:09:28,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:28,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 28 [2022-04-27 15:09:28,221 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:28,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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:09:28,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:28,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:28,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:28,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:28,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:28,237 INFO L87 Difference]: Start difference. First operand 1673 states and 2647 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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:09:28,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:28,886 INFO L93 Difference]: Finished difference Result 3917 states and 6233 transitions. [2022-04-27 15:09:28,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:28,886 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 28 [2022-04-27 15:09:28,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:28,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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:09:28,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 213 transitions. [2022-04-27 15:09:28,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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:09:28,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 213 transitions. [2022-04-27 15:09:28,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 213 transitions. [2022-04-27 15:09:29,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 213 edges. 213 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:29,195 INFO L225 Difference]: With dead ends: 3917 [2022-04-27 15:09:29,196 INFO L226 Difference]: Without dead ends: 2283 [2022-04-27 15:09:29,198 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:09:29,199 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 148 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:29,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 121 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:29,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2283 states. [2022-04-27 15:09:29,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2283 to 2281. [2022-04-27 15:09:29,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:29,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2283 states. Second operand has 2281 states, 2277 states have (on average 1.5757575757575757) internal successors, (3588), 2277 states have internal predecessors, (3588), 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:09:29,241 INFO L74 IsIncluded]: Start isIncluded. First operand 2283 states. Second operand has 2281 states, 2277 states have (on average 1.5757575757575757) internal successors, (3588), 2277 states have internal predecessors, (3588), 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:09:29,242 INFO L87 Difference]: Start difference. First operand 2283 states. Second operand has 2281 states, 2277 states have (on average 1.5757575757575757) internal successors, (3588), 2277 states have internal predecessors, (3588), 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:09:29,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:29,412 INFO L93 Difference]: Finished difference Result 2283 states and 3592 transitions. [2022-04-27 15:09:29,412 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 3592 transitions. [2022-04-27 15:09:29,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:29,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:29,419 INFO L74 IsIncluded]: Start isIncluded. First operand has 2281 states, 2277 states have (on average 1.5757575757575757) internal successors, (3588), 2277 states have internal predecessors, (3588), 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 2283 states. [2022-04-27 15:09:29,421 INFO L87 Difference]: Start difference. First operand has 2281 states, 2277 states have (on average 1.5757575757575757) internal successors, (3588), 2277 states have internal predecessors, (3588), 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 2283 states. [2022-04-27 15:09:29,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:29,580 INFO L93 Difference]: Finished difference Result 2283 states and 3592 transitions. [2022-04-27 15:09:29,580 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 3592 transitions. [2022-04-27 15:09:29,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:29,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:29,582 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:29,582 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:29,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2281 states, 2277 states have (on average 1.5757575757575757) internal successors, (3588), 2277 states have internal predecessors, (3588), 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:09:29,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 3591 transitions. [2022-04-27 15:09:29,746 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 3591 transitions. Word has length 28 [2022-04-27 15:09:29,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:29,746 INFO L495 AbstractCegarLoop]: Abstraction has 2281 states and 3591 transitions. [2022-04-27 15:09:29,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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:09:29,746 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 3591 transitions. [2022-04-27 15:09:29,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 15:09:29,747 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:29,748 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:29,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-27 15:09:29,748 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:29,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:29,748 INFO L85 PathProgramCache]: Analyzing trace with hash -710353220, now seen corresponding path program 1 times [2022-04-27 15:09:29,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:29,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420360210] [2022-04-27 15:09:29,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:29,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:29,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:29,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:29,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {48968#(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(16, 2);call #Ultimate.allocInit(12, 3); {48962#true} is VALID [2022-04-27 15:09:29,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {48962#true} assume true; {48962#true} is VALID [2022-04-27 15:09:29,785 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48962#true} {48962#true} #234#return; {48962#true} is VALID [2022-04-27 15:09:29,786 INFO L272 TraceCheckUtils]: 0: Hoare triple {48962#true} call ULTIMATE.init(); {48968#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:29,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {48968#(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(16, 2);call #Ultimate.allocInit(12, 3); {48962#true} is VALID [2022-04-27 15:09:29,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {48962#true} assume true; {48962#true} is VALID [2022-04-27 15:09:29,786 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48962#true} {48962#true} #234#return; {48962#true} is VALID [2022-04-27 15:09:29,786 INFO L272 TraceCheckUtils]: 4: Hoare triple {48962#true} call #t~ret17 := main(); {48962#true} is VALID [2022-04-27 15:09:29,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {48962#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {48962#true} is VALID [2022-04-27 15:09:29,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {48962#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {48962#true} is VALID [2022-04-27 15:09:29,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {48962#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {48962#true} is VALID [2022-04-27 15:09:29,786 INFO L290 TraceCheckUtils]: 8: Hoare triple {48962#true} assume !(0 != ~p1~0); {48962#true} is VALID [2022-04-27 15:09:29,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {48962#true} assume !(0 != ~p2~0); {48962#true} is VALID [2022-04-27 15:09:29,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {48962#true} assume !(0 != ~p3~0); {48962#true} is VALID [2022-04-27 15:09:29,786 INFO L290 TraceCheckUtils]: 11: Hoare triple {48962#true} assume !(0 != ~p4~0); {48962#true} is VALID [2022-04-27 15:09:29,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {48962#true} assume !(0 != ~p5~0); {48962#true} is VALID [2022-04-27 15:09:29,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {48962#true} assume 0 != ~p6~0;~lk6~0 := 1; {48967#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:29,787 INFO L290 TraceCheckUtils]: 14: Hoare triple {48967#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {48967#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:29,787 INFO L290 TraceCheckUtils]: 15: Hoare triple {48967#(not (= main_~p6~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {48967#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:29,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {48967#(not (= main_~p6~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {48967#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:29,788 INFO L290 TraceCheckUtils]: 17: Hoare triple {48967#(not (= main_~p6~0 0))} assume !(0 != ~p10~0); {48967#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:29,788 INFO L290 TraceCheckUtils]: 18: Hoare triple {48967#(not (= main_~p6~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {48967#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:29,788 INFO L290 TraceCheckUtils]: 19: Hoare triple {48967#(not (= main_~p6~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {48967#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:29,789 INFO L290 TraceCheckUtils]: 20: Hoare triple {48967#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {48967#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:29,789 INFO L290 TraceCheckUtils]: 21: Hoare triple {48967#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {48967#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:29,789 INFO L290 TraceCheckUtils]: 22: Hoare triple {48967#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {48967#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:29,790 INFO L290 TraceCheckUtils]: 23: Hoare triple {48967#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {48967#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:29,790 INFO L290 TraceCheckUtils]: 24: Hoare triple {48967#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {48967#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:29,790 INFO L290 TraceCheckUtils]: 25: Hoare triple {48967#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {48963#false} is VALID [2022-04-27 15:09:29,790 INFO L290 TraceCheckUtils]: 26: Hoare triple {48963#false} assume 0 != ~p7~0; {48963#false} is VALID [2022-04-27 15:09:29,790 INFO L290 TraceCheckUtils]: 27: Hoare triple {48963#false} assume 1 != ~lk7~0; {48963#false} is VALID [2022-04-27 15:09:29,790 INFO L290 TraceCheckUtils]: 28: Hoare triple {48963#false} assume !false; {48963#false} is VALID [2022-04-27 15:09:29,791 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:09:29,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:29,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420360210] [2022-04-27 15:09:29,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420360210] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:29,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:29,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:29,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152974706] [2022-04-27 15:09:29,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:29,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 29 [2022-04-27 15:09:29,792 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:29,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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:09:29,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:29,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:29,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:29,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:29,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:29,807 INFO L87 Difference]: Start difference. First operand 2281 states and 3591 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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:09:30,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:30,372 INFO L93 Difference]: Finished difference Result 3421 states and 5369 transitions. [2022-04-27 15:09:30,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:30,372 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 29 [2022-04-27 15:09:30,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:30,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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:09:30,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions. [2022-04-27 15:09:30,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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:09:30,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions. [2022-04-27 15:09:30,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 208 transitions. [2022-04-27 15:09:30,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:30,645 INFO L225 Difference]: With dead ends: 3421 [2022-04-27 15:09:30,646 INFO L226 Difference]: Without dead ends: 2315 [2022-04-27 15:09:30,647 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:09:30,647 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 152 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:30,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 118 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:30,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2315 states. [2022-04-27 15:09:30,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2315 to 2313. [2022-04-27 15:09:30,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:30,680 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2315 states. Second operand has 2313 states, 2309 states have (on average 1.5539194456474665) internal successors, (3588), 2309 states have internal predecessors, (3588), 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:09:30,682 INFO L74 IsIncluded]: Start isIncluded. First operand 2315 states. Second operand has 2313 states, 2309 states have (on average 1.5539194456474665) internal successors, (3588), 2309 states have internal predecessors, (3588), 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:09:30,683 INFO L87 Difference]: Start difference. First operand 2315 states. Second operand has 2313 states, 2309 states have (on average 1.5539194456474665) internal successors, (3588), 2309 states have internal predecessors, (3588), 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:09:30,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:30,824 INFO L93 Difference]: Finished difference Result 2315 states and 3592 transitions. [2022-04-27 15:09:30,824 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3592 transitions. [2022-04-27 15:09:30,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:30,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:30,829 INFO L74 IsIncluded]: Start isIncluded. First operand has 2313 states, 2309 states have (on average 1.5539194456474665) internal successors, (3588), 2309 states have internal predecessors, (3588), 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 2315 states. [2022-04-27 15:09:30,830 INFO L87 Difference]: Start difference. First operand has 2313 states, 2309 states have (on average 1.5539194456474665) internal successors, (3588), 2309 states have internal predecessors, (3588), 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 2315 states. [2022-04-27 15:09:30,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:30,978 INFO L93 Difference]: Finished difference Result 2315 states and 3592 transitions. [2022-04-27 15:09:30,978 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3592 transitions. [2022-04-27 15:09:30,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:30,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:30,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:30,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:30,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2313 states, 2309 states have (on average 1.5539194456474665) internal successors, (3588), 2309 states have internal predecessors, (3588), 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:09:31,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 3591 transitions. [2022-04-27 15:09:31,145 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 3591 transitions. Word has length 29 [2022-04-27 15:09:31,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:31,145 INFO L495 AbstractCegarLoop]: Abstraction has 2313 states and 3591 transitions. [2022-04-27 15:09:31,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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:09:31,145 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 3591 transitions. [2022-04-27 15:09:31,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 15:09:31,146 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:31,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:31,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-27 15:09:31,146 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:31,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:31,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1731421574, now seen corresponding path program 1 times [2022-04-27 15:09:31,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:31,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269813538] [2022-04-27 15:09:31,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:31,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:31,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:31,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:31,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:31,179 INFO L290 TraceCheckUtils]: 0: Hoare triple {59518#(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(16, 2);call #Ultimate.allocInit(12, 3); {59512#true} is VALID [2022-04-27 15:09:31,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {59512#true} assume true; {59512#true} is VALID [2022-04-27 15:09:31,179 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {59512#true} {59512#true} #234#return; {59512#true} is VALID [2022-04-27 15:09:31,180 INFO L272 TraceCheckUtils]: 0: Hoare triple {59512#true} call ULTIMATE.init(); {59518#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:31,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {59518#(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(16, 2);call #Ultimate.allocInit(12, 3); {59512#true} is VALID [2022-04-27 15:09:31,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {59512#true} assume true; {59512#true} is VALID [2022-04-27 15:09:31,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59512#true} {59512#true} #234#return; {59512#true} is VALID [2022-04-27 15:09:31,181 INFO L272 TraceCheckUtils]: 4: Hoare triple {59512#true} call #t~ret17 := main(); {59512#true} is VALID [2022-04-27 15:09:31,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {59512#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {59512#true} is VALID [2022-04-27 15:09:31,182 INFO L290 TraceCheckUtils]: 6: Hoare triple {59512#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {59512#true} is VALID [2022-04-27 15:09:31,183 INFO L290 TraceCheckUtils]: 7: Hoare triple {59512#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {59512#true} is VALID [2022-04-27 15:09:31,184 INFO L290 TraceCheckUtils]: 8: Hoare triple {59512#true} assume !(0 != ~p1~0); {59512#true} is VALID [2022-04-27 15:09:31,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {59512#true} assume !(0 != ~p2~0); {59512#true} is VALID [2022-04-27 15:09:31,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {59512#true} assume !(0 != ~p3~0); {59512#true} is VALID [2022-04-27 15:09:31,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {59512#true} assume !(0 != ~p4~0); {59512#true} is VALID [2022-04-27 15:09:31,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {59512#true} assume !(0 != ~p5~0); {59512#true} is VALID [2022-04-27 15:09:31,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {59512#true} assume !(0 != ~p6~0); {59512#true} is VALID [2022-04-27 15:09:31,184 INFO L290 TraceCheckUtils]: 14: Hoare triple {59512#true} assume 0 != ~p7~0;~lk7~0 := 1; {59517#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:31,185 INFO L290 TraceCheckUtils]: 15: Hoare triple {59517#(= main_~lk7~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {59517#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:31,185 INFO L290 TraceCheckUtils]: 16: Hoare triple {59517#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {59517#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:31,185 INFO L290 TraceCheckUtils]: 17: Hoare triple {59517#(= main_~lk7~0 1)} assume !(0 != ~p10~0); {59517#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:31,185 INFO L290 TraceCheckUtils]: 18: Hoare triple {59517#(= main_~lk7~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {59517#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:31,186 INFO L290 TraceCheckUtils]: 19: Hoare triple {59517#(= main_~lk7~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {59517#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:31,186 INFO L290 TraceCheckUtils]: 20: Hoare triple {59517#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {59517#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:31,186 INFO L290 TraceCheckUtils]: 21: Hoare triple {59517#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {59517#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:31,186 INFO L290 TraceCheckUtils]: 22: Hoare triple {59517#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {59517#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:31,186 INFO L290 TraceCheckUtils]: 23: Hoare triple {59517#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {59517#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:31,187 INFO L290 TraceCheckUtils]: 24: Hoare triple {59517#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {59517#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:31,187 INFO L290 TraceCheckUtils]: 25: Hoare triple {59517#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {59517#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:31,187 INFO L290 TraceCheckUtils]: 26: Hoare triple {59517#(= main_~lk7~0 1)} assume 0 != ~p7~0; {59517#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:31,187 INFO L290 TraceCheckUtils]: 27: Hoare triple {59517#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {59513#false} is VALID [2022-04-27 15:09:31,188 INFO L290 TraceCheckUtils]: 28: Hoare triple {59513#false} assume !false; {59513#false} is VALID [2022-04-27 15:09:31,188 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:09:31,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:31,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269813538] [2022-04-27 15:09:31,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269813538] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:31,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:31,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:31,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754883086] [2022-04-27 15:09:31,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:31,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 29 [2022-04-27 15:09:31,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:31,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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:09:31,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:31,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:31,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:31,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:31,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:31,204 INFO L87 Difference]: Start difference. First operand 2313 states and 3591 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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:09:31,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:31,896 INFO L93 Difference]: Finished difference Result 4109 states and 6505 transitions. [2022-04-27 15:09:31,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:31,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 29 [2022-04-27 15:09:31,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:31,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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:09:31,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2022-04-27 15:09:31,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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:09:31,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2022-04-27 15:09:31,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 131 transitions. [2022-04-27 15:09:31,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:32,470 INFO L225 Difference]: With dead ends: 4109 [2022-04-27 15:09:32,470 INFO L226 Difference]: Without dead ends: 4107 [2022-04-27 15:09:32,471 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:09:32,472 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 160 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:32,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 84 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:32,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4107 states. [2022-04-27 15:09:32,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4107 to 3337. [2022-04-27 15:09:32,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:32,528 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4107 states. Second operand has 3337 states, 3333 states have (on average 1.5085508550855085) internal successors, (5028), 3333 states have internal predecessors, (5028), 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:09:32,537 INFO L74 IsIncluded]: Start isIncluded. First operand 4107 states. Second operand has 3337 states, 3333 states have (on average 1.5085508550855085) internal successors, (5028), 3333 states have internal predecessors, (5028), 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:09:32,539 INFO L87 Difference]: Start difference. First operand 4107 states. Second operand has 3337 states, 3333 states have (on average 1.5085508550855085) internal successors, (5028), 3333 states have internal predecessors, (5028), 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:09:33,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:33,031 INFO L93 Difference]: Finished difference Result 4107 states and 6440 transitions. [2022-04-27 15:09:33,031 INFO L276 IsEmpty]: Start isEmpty. Operand 4107 states and 6440 transitions. [2022-04-27 15:09:33,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:33,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:33,038 INFO L74 IsIncluded]: Start isIncluded. First operand has 3337 states, 3333 states have (on average 1.5085508550855085) internal successors, (5028), 3333 states have internal predecessors, (5028), 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 4107 states. [2022-04-27 15:09:33,040 INFO L87 Difference]: Start difference. First operand has 3337 states, 3333 states have (on average 1.5085508550855085) internal successors, (5028), 3333 states have internal predecessors, (5028), 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 4107 states. [2022-04-27 15:09:33,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:33,549 INFO L93 Difference]: Finished difference Result 4107 states and 6440 transitions. [2022-04-27 15:09:33,549 INFO L276 IsEmpty]: Start isEmpty. Operand 4107 states and 6440 transitions. [2022-04-27 15:09:33,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:33,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:33,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:33,552 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:33,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3337 states, 3333 states have (on average 1.5085508550855085) internal successors, (5028), 3333 states have internal predecessors, (5028), 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:09:33,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3337 states to 3337 states and 5031 transitions. [2022-04-27 15:09:33,944 INFO L78 Accepts]: Start accepts. Automaton has 3337 states and 5031 transitions. Word has length 29 [2022-04-27 15:09:33,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:33,944 INFO L495 AbstractCegarLoop]: Abstraction has 3337 states and 5031 transitions. [2022-04-27 15:09:33,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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:09:33,944 INFO L276 IsEmpty]: Start isEmpty. Operand 3337 states and 5031 transitions. [2022-04-27 15:09:33,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 15:09:33,946 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:33,946 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:33,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-27 15:09:33,946 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:33,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:33,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1283682044, now seen corresponding path program 1 times [2022-04-27 15:09:33,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:33,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281161249] [2022-04-27 15:09:33,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:33,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:33,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:33,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:33,969 INFO L290 TraceCheckUtils]: 0: Hoare triple {75396#(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(16, 2);call #Ultimate.allocInit(12, 3); {75390#true} is VALID [2022-04-27 15:09:33,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {75390#true} assume true; {75390#true} is VALID [2022-04-27 15:09:33,969 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {75390#true} {75390#true} #234#return; {75390#true} is VALID [2022-04-27 15:09:33,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {75390#true} call ULTIMATE.init(); {75396#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:33,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {75396#(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(16, 2);call #Ultimate.allocInit(12, 3); {75390#true} is VALID [2022-04-27 15:09:33,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {75390#true} assume true; {75390#true} is VALID [2022-04-27 15:09:33,969 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75390#true} {75390#true} #234#return; {75390#true} is VALID [2022-04-27 15:09:33,969 INFO L272 TraceCheckUtils]: 4: Hoare triple {75390#true} call #t~ret17 := main(); {75390#true} is VALID [2022-04-27 15:09:33,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {75390#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {75390#true} is VALID [2022-04-27 15:09:33,970 INFO L290 TraceCheckUtils]: 6: Hoare triple {75390#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {75390#true} is VALID [2022-04-27 15:09:33,970 INFO L290 TraceCheckUtils]: 7: Hoare triple {75390#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {75390#true} is VALID [2022-04-27 15:09:33,970 INFO L290 TraceCheckUtils]: 8: Hoare triple {75390#true} assume !(0 != ~p1~0); {75390#true} is VALID [2022-04-27 15:09:33,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {75390#true} assume !(0 != ~p2~0); {75390#true} is VALID [2022-04-27 15:09:33,970 INFO L290 TraceCheckUtils]: 10: Hoare triple {75390#true} assume !(0 != ~p3~0); {75390#true} is VALID [2022-04-27 15:09:33,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {75390#true} assume !(0 != ~p4~0); {75390#true} is VALID [2022-04-27 15:09:33,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {75390#true} assume !(0 != ~p5~0); {75390#true} is VALID [2022-04-27 15:09:33,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {75390#true} assume !(0 != ~p6~0); {75390#true} is VALID [2022-04-27 15:09:33,971 INFO L290 TraceCheckUtils]: 14: Hoare triple {75390#true} assume !(0 != ~p7~0); {75395#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:33,971 INFO L290 TraceCheckUtils]: 15: Hoare triple {75395#(= main_~p7~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {75395#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:33,971 INFO L290 TraceCheckUtils]: 16: Hoare triple {75395#(= main_~p7~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {75395#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:33,971 INFO L290 TraceCheckUtils]: 17: Hoare triple {75395#(= main_~p7~0 0)} assume !(0 != ~p10~0); {75395#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:33,972 INFO L290 TraceCheckUtils]: 18: Hoare triple {75395#(= main_~p7~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {75395#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:33,972 INFO L290 TraceCheckUtils]: 19: Hoare triple {75395#(= main_~p7~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {75395#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:33,972 INFO L290 TraceCheckUtils]: 20: Hoare triple {75395#(= main_~p7~0 0)} assume !(0 != ~p1~0); {75395#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:33,972 INFO L290 TraceCheckUtils]: 21: Hoare triple {75395#(= main_~p7~0 0)} assume !(0 != ~p2~0); {75395#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:33,972 INFO L290 TraceCheckUtils]: 22: Hoare triple {75395#(= main_~p7~0 0)} assume !(0 != ~p3~0); {75395#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:33,973 INFO L290 TraceCheckUtils]: 23: Hoare triple {75395#(= main_~p7~0 0)} assume !(0 != ~p4~0); {75395#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:33,973 INFO L290 TraceCheckUtils]: 24: Hoare triple {75395#(= main_~p7~0 0)} assume !(0 != ~p5~0); {75395#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:33,973 INFO L290 TraceCheckUtils]: 25: Hoare triple {75395#(= main_~p7~0 0)} assume !(0 != ~p6~0); {75395#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:33,973 INFO L290 TraceCheckUtils]: 26: Hoare triple {75395#(= main_~p7~0 0)} assume 0 != ~p7~0; {75391#false} is VALID [2022-04-27 15:09:33,973 INFO L290 TraceCheckUtils]: 27: Hoare triple {75391#false} assume 1 != ~lk7~0; {75391#false} is VALID [2022-04-27 15:09:33,973 INFO L290 TraceCheckUtils]: 28: Hoare triple {75391#false} assume !false; {75391#false} is VALID [2022-04-27 15:09:33,974 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:09:33,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:33,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281161249] [2022-04-27 15:09:33,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281161249] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:33,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:33,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:33,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173049054] [2022-04-27 15:09:33,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:33,974 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 29 [2022-04-27 15:09:33,974 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:33,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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:09:33,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:33,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:33,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:33,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:33,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:33,988 INFO L87 Difference]: Start difference. First operand 3337 states and 5031 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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:09:36,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:36,115 INFO L93 Difference]: Finished difference Result 7757 states and 11753 transitions. [2022-04-27 15:09:36,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:36,115 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 29 [2022-04-27 15:09:36,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:36,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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:09:36,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2022-04-27 15:09:36,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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:09:36,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2022-04-27 15:09:36,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 210 transitions. [2022-04-27 15:09:36,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:36,932 INFO L225 Difference]: With dead ends: 7757 [2022-04-27 15:09:36,932 INFO L226 Difference]: Without dead ends: 4491 [2022-04-27 15:09:36,936 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:09:36,936 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 142 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:36,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 123 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:36,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4491 states. [2022-04-27 15:09:36,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4491 to 4489. [2022-04-27 15:09:36,987 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:36,992 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4491 states. Second operand has 4489 states, 4485 states have (on average 1.4992196209587514) internal successors, (6724), 4485 states have internal predecessors, (6724), 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:09:36,995 INFO L74 IsIncluded]: Start isIncluded. First operand 4491 states. Second operand has 4489 states, 4485 states have (on average 1.4992196209587514) internal successors, (6724), 4485 states have internal predecessors, (6724), 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:09:36,998 INFO L87 Difference]: Start difference. First operand 4491 states. Second operand has 4489 states, 4485 states have (on average 1.4992196209587514) internal successors, (6724), 4485 states have internal predecessors, (6724), 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:09:37,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:37,702 INFO L93 Difference]: Finished difference Result 4491 states and 6728 transitions. [2022-04-27 15:09:37,702 INFO L276 IsEmpty]: Start isEmpty. Operand 4491 states and 6728 transitions. [2022-04-27 15:09:37,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:37,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:37,711 INFO L74 IsIncluded]: Start isIncluded. First operand has 4489 states, 4485 states have (on average 1.4992196209587514) internal successors, (6724), 4485 states have internal predecessors, (6724), 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 4491 states. [2022-04-27 15:09:37,713 INFO L87 Difference]: Start difference. First operand has 4489 states, 4485 states have (on average 1.4992196209587514) internal successors, (6724), 4485 states have internal predecessors, (6724), 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 4491 states. [2022-04-27 15:09:38,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:38,395 INFO L93 Difference]: Finished difference Result 4491 states and 6728 transitions. [2022-04-27 15:09:38,395 INFO L276 IsEmpty]: Start isEmpty. Operand 4491 states and 6728 transitions. [2022-04-27 15:09:38,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:38,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:38,400 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:38,400 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:38,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4489 states, 4485 states have (on average 1.4992196209587514) internal successors, (6724), 4485 states have internal predecessors, (6724), 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:09:39,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4489 states to 4489 states and 6727 transitions. [2022-04-27 15:09:39,223 INFO L78 Accepts]: Start accepts. Automaton has 4489 states and 6727 transitions. Word has length 29 [2022-04-27 15:09:39,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:39,224 INFO L495 AbstractCegarLoop]: Abstraction has 4489 states and 6727 transitions. [2022-04-27 15:09:39,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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:09:39,224 INFO L276 IsEmpty]: Start isEmpty. Operand 4489 states and 6727 transitions. [2022-04-27 15:09:39,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 15:09:39,226 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:39,226 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:39,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-27 15:09:39,226 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:39,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:39,227 INFO L85 PathProgramCache]: Analyzing trace with hash -2134246461, now seen corresponding path program 1 times [2022-04-27 15:09:39,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:39,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800611263] [2022-04-27 15:09:39,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:39,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:39,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:39,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:39,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:39,250 INFO L290 TraceCheckUtils]: 0: Hoare triple {96970#(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(16, 2);call #Ultimate.allocInit(12, 3); {96964#true} is VALID [2022-04-27 15:09:39,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {96964#true} assume true; {96964#true} is VALID [2022-04-27 15:09:39,250 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {96964#true} {96964#true} #234#return; {96964#true} is VALID [2022-04-27 15:09:39,250 INFO L272 TraceCheckUtils]: 0: Hoare triple {96964#true} call ULTIMATE.init(); {96970#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:39,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {96970#(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(16, 2);call #Ultimate.allocInit(12, 3); {96964#true} is VALID [2022-04-27 15:09:39,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {96964#true} assume true; {96964#true} is VALID [2022-04-27 15:09:39,251 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {96964#true} {96964#true} #234#return; {96964#true} is VALID [2022-04-27 15:09:39,251 INFO L272 TraceCheckUtils]: 4: Hoare triple {96964#true} call #t~ret17 := main(); {96964#true} is VALID [2022-04-27 15:09:39,251 INFO L290 TraceCheckUtils]: 5: Hoare triple {96964#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {96964#true} is VALID [2022-04-27 15:09:39,251 INFO L290 TraceCheckUtils]: 6: Hoare triple {96964#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {96964#true} is VALID [2022-04-27 15:09:39,251 INFO L290 TraceCheckUtils]: 7: Hoare triple {96964#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {96964#true} is VALID [2022-04-27 15:09:39,251 INFO L290 TraceCheckUtils]: 8: Hoare triple {96964#true} assume !(0 != ~p1~0); {96964#true} is VALID [2022-04-27 15:09:39,251 INFO L290 TraceCheckUtils]: 9: Hoare triple {96964#true} assume !(0 != ~p2~0); {96964#true} is VALID [2022-04-27 15:09:39,251 INFO L290 TraceCheckUtils]: 10: Hoare triple {96964#true} assume !(0 != ~p3~0); {96964#true} is VALID [2022-04-27 15:09:39,251 INFO L290 TraceCheckUtils]: 11: Hoare triple {96964#true} assume !(0 != ~p4~0); {96964#true} is VALID [2022-04-27 15:09:39,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {96964#true} assume !(0 != ~p5~0); {96964#true} is VALID [2022-04-27 15:09:39,251 INFO L290 TraceCheckUtils]: 13: Hoare triple {96964#true} assume !(0 != ~p6~0); {96964#true} is VALID [2022-04-27 15:09:39,251 INFO L290 TraceCheckUtils]: 14: Hoare triple {96964#true} assume 0 != ~p7~0;~lk7~0 := 1; {96969#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:09:39,252 INFO L290 TraceCheckUtils]: 15: Hoare triple {96969#(not (= main_~p7~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {96969#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:09:39,252 INFO L290 TraceCheckUtils]: 16: Hoare triple {96969#(not (= main_~p7~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {96969#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:09:39,252 INFO L290 TraceCheckUtils]: 17: Hoare triple {96969#(not (= main_~p7~0 0))} assume !(0 != ~p10~0); {96969#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:09:39,252 INFO L290 TraceCheckUtils]: 18: Hoare triple {96969#(not (= main_~p7~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {96969#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:09:39,253 INFO L290 TraceCheckUtils]: 19: Hoare triple {96969#(not (= main_~p7~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {96969#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:09:39,253 INFO L290 TraceCheckUtils]: 20: Hoare triple {96969#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {96969#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:09:39,253 INFO L290 TraceCheckUtils]: 21: Hoare triple {96969#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {96969#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:09:39,253 INFO L290 TraceCheckUtils]: 22: Hoare triple {96969#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {96969#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:09:39,254 INFO L290 TraceCheckUtils]: 23: Hoare triple {96969#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {96969#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:09:39,254 INFO L290 TraceCheckUtils]: 24: Hoare triple {96969#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {96969#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:09:39,254 INFO L290 TraceCheckUtils]: 25: Hoare triple {96969#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {96969#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:09:39,254 INFO L290 TraceCheckUtils]: 26: Hoare triple {96969#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {96965#false} is VALID [2022-04-27 15:09:39,254 INFO L290 TraceCheckUtils]: 27: Hoare triple {96965#false} assume 0 != ~p8~0; {96965#false} is VALID [2022-04-27 15:09:39,254 INFO L290 TraceCheckUtils]: 28: Hoare triple {96965#false} assume 1 != ~lk8~0; {96965#false} is VALID [2022-04-27 15:09:39,255 INFO L290 TraceCheckUtils]: 29: Hoare triple {96965#false} assume !false; {96965#false} is VALID [2022-04-27 15:09:39,255 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:09:39,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:39,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800611263] [2022-04-27 15:09:39,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800611263] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:39,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:39,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:39,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974530180] [2022-04-27 15:09:39,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:39,255 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 30 [2022-04-27 15:09:39,256 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:39,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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:09:39,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:39,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:39,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:39,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:39,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:39,273 INFO L87 Difference]: Start difference. First operand 4489 states and 6727 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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:09:40,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:40,890 INFO L93 Difference]: Finished difference Result 6733 states and 10057 transitions. [2022-04-27 15:09:40,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:40,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 30 [2022-04-27 15:09:40,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:40,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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:09:40,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2022-04-27 15:09:40,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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:09:40,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2022-04-27 15:09:40,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 205 transitions. [2022-04-27 15:09:41,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:41,592 INFO L225 Difference]: With dead ends: 6733 [2022-04-27 15:09:41,592 INFO L226 Difference]: Without dead ends: 4555 [2022-04-27 15:09:41,594 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:09:41,594 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 151 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:41,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 115 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:41,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4555 states. [2022-04-27 15:09:41,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4555 to 4553. [2022-04-27 15:09:41,653 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:41,658 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4555 states. Second operand has 4553 states, 4549 states have (on average 1.478127060892504) internal successors, (6724), 4549 states have internal predecessors, (6724), 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:09:41,662 INFO L74 IsIncluded]: Start isIncluded. First operand 4555 states. Second operand has 4553 states, 4549 states have (on average 1.478127060892504) internal successors, (6724), 4549 states have internal predecessors, (6724), 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:09:41,664 INFO L87 Difference]: Start difference. First operand 4555 states. Second operand has 4553 states, 4549 states have (on average 1.478127060892504) internal successors, (6724), 4549 states have internal predecessors, (6724), 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:09:42,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:42,254 INFO L93 Difference]: Finished difference Result 4555 states and 6728 transitions. [2022-04-27 15:09:42,254 INFO L276 IsEmpty]: Start isEmpty. Operand 4555 states and 6728 transitions. [2022-04-27 15:09:42,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:42,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:42,262 INFO L74 IsIncluded]: Start isIncluded. First operand has 4553 states, 4549 states have (on average 1.478127060892504) internal successors, (6724), 4549 states have internal predecessors, (6724), 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 4555 states. [2022-04-27 15:09:42,264 INFO L87 Difference]: Start difference. First operand has 4553 states, 4549 states have (on average 1.478127060892504) internal successors, (6724), 4549 states have internal predecessors, (6724), 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 4555 states. [2022-04-27 15:09:42,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:42,874 INFO L93 Difference]: Finished difference Result 4555 states and 6728 transitions. [2022-04-27 15:09:42,874 INFO L276 IsEmpty]: Start isEmpty. Operand 4555 states and 6728 transitions. [2022-04-27 15:09:42,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:42,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:42,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:42,878 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:42,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4553 states, 4549 states have (on average 1.478127060892504) internal successors, (6724), 4549 states have internal predecessors, (6724), 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:09:43,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4553 states to 4553 states and 6727 transitions. [2022-04-27 15:09:43,569 INFO L78 Accepts]: Start accepts. Automaton has 4553 states and 6727 transitions. Word has length 30 [2022-04-27 15:09:43,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:43,569 INFO L495 AbstractCegarLoop]: Abstraction has 4553 states and 6727 transitions. [2022-04-27 15:09:43,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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:09:43,569 INFO L276 IsEmpty]: Start isEmpty. Operand 4553 states and 6727 transitions. [2022-04-27 15:09:43,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 15:09:43,571 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:43,571 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:43,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-27 15:09:43,571 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:43,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:43,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1139652481, now seen corresponding path program 1 times [2022-04-27 15:09:43,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:43,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637880823] [2022-04-27 15:09:43,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:43,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:43,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:43,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:43,597 INFO L290 TraceCheckUtils]: 0: Hoare triple {117712#(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(16, 2);call #Ultimate.allocInit(12, 3); {117706#true} is VALID [2022-04-27 15:09:43,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {117706#true} assume true; {117706#true} is VALID [2022-04-27 15:09:43,597 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {117706#true} {117706#true} #234#return; {117706#true} is VALID [2022-04-27 15:09:43,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {117706#true} call ULTIMATE.init(); {117712#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:43,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {117712#(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(16, 2);call #Ultimate.allocInit(12, 3); {117706#true} is VALID [2022-04-27 15:09:43,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {117706#true} assume true; {117706#true} is VALID [2022-04-27 15:09:43,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {117706#true} {117706#true} #234#return; {117706#true} is VALID [2022-04-27 15:09:43,597 INFO L272 TraceCheckUtils]: 4: Hoare triple {117706#true} call #t~ret17 := main(); {117706#true} is VALID [2022-04-27 15:09:43,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {117706#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {117706#true} is VALID [2022-04-27 15:09:43,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {117706#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {117706#true} is VALID [2022-04-27 15:09:43,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {117706#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {117706#true} is VALID [2022-04-27 15:09:43,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {117706#true} assume !(0 != ~p1~0); {117706#true} is VALID [2022-04-27 15:09:43,598 INFO L290 TraceCheckUtils]: 9: Hoare triple {117706#true} assume !(0 != ~p2~0); {117706#true} is VALID [2022-04-27 15:09:43,598 INFO L290 TraceCheckUtils]: 10: Hoare triple {117706#true} assume !(0 != ~p3~0); {117706#true} is VALID [2022-04-27 15:09:43,598 INFO L290 TraceCheckUtils]: 11: Hoare triple {117706#true} assume !(0 != ~p4~0); {117706#true} is VALID [2022-04-27 15:09:43,598 INFO L290 TraceCheckUtils]: 12: Hoare triple {117706#true} assume !(0 != ~p5~0); {117706#true} is VALID [2022-04-27 15:09:43,598 INFO L290 TraceCheckUtils]: 13: Hoare triple {117706#true} assume !(0 != ~p6~0); {117706#true} is VALID [2022-04-27 15:09:43,598 INFO L290 TraceCheckUtils]: 14: Hoare triple {117706#true} assume !(0 != ~p7~0); {117706#true} is VALID [2022-04-27 15:09:43,598 INFO L290 TraceCheckUtils]: 15: Hoare triple {117706#true} assume 0 != ~p8~0;~lk8~0 := 1; {117711#(= main_~lk8~0 1)} is VALID [2022-04-27 15:09:43,599 INFO L290 TraceCheckUtils]: 16: Hoare triple {117711#(= main_~lk8~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {117711#(= main_~lk8~0 1)} is VALID [2022-04-27 15:09:43,599 INFO L290 TraceCheckUtils]: 17: Hoare triple {117711#(= main_~lk8~0 1)} assume !(0 != ~p10~0); {117711#(= main_~lk8~0 1)} is VALID [2022-04-27 15:09:43,599 INFO L290 TraceCheckUtils]: 18: Hoare triple {117711#(= main_~lk8~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {117711#(= main_~lk8~0 1)} is VALID [2022-04-27 15:09:43,599 INFO L290 TraceCheckUtils]: 19: Hoare triple {117711#(= main_~lk8~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {117711#(= main_~lk8~0 1)} is VALID [2022-04-27 15:09:43,599 INFO L290 TraceCheckUtils]: 20: Hoare triple {117711#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {117711#(= main_~lk8~0 1)} is VALID [2022-04-27 15:09:43,600 INFO L290 TraceCheckUtils]: 21: Hoare triple {117711#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {117711#(= main_~lk8~0 1)} is VALID [2022-04-27 15:09:43,600 INFO L290 TraceCheckUtils]: 22: Hoare triple {117711#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {117711#(= main_~lk8~0 1)} is VALID [2022-04-27 15:09:43,600 INFO L290 TraceCheckUtils]: 23: Hoare triple {117711#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {117711#(= main_~lk8~0 1)} is VALID [2022-04-27 15:09:43,600 INFO L290 TraceCheckUtils]: 24: Hoare triple {117711#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {117711#(= main_~lk8~0 1)} is VALID [2022-04-27 15:09:43,601 INFO L290 TraceCheckUtils]: 25: Hoare triple {117711#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {117711#(= main_~lk8~0 1)} is VALID [2022-04-27 15:09:43,601 INFO L290 TraceCheckUtils]: 26: Hoare triple {117711#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {117711#(= main_~lk8~0 1)} is VALID [2022-04-27 15:09:43,601 INFO L290 TraceCheckUtils]: 27: Hoare triple {117711#(= main_~lk8~0 1)} assume 0 != ~p8~0; {117711#(= main_~lk8~0 1)} is VALID [2022-04-27 15:09:43,601 INFO L290 TraceCheckUtils]: 28: Hoare triple {117711#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {117707#false} is VALID [2022-04-27 15:09:43,601 INFO L290 TraceCheckUtils]: 29: Hoare triple {117707#false} assume !false; {117707#false} is VALID [2022-04-27 15:09:43,602 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:09:43,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:43,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637880823] [2022-04-27 15:09:43,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637880823] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:43,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:43,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:43,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424902961] [2022-04-27 15:09:43,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:43,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 30 [2022-04-27 15:09:43,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:43,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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:09:43,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:43,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:43,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:43,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:43,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:43,619 INFO L87 Difference]: Start difference. First operand 4553 states and 6727 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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:09:45,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:45,754 INFO L93 Difference]: Finished difference Result 7949 states and 11977 transitions. [2022-04-27 15:09:45,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:45,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 30 [2022-04-27 15:09:45,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:45,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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:09:45,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-27 15:09:45,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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:09:45,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-27 15:09:45,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 127 transitions. [2022-04-27 15:09:45,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:47,819 INFO L225 Difference]: With dead ends: 7949 [2022-04-27 15:09:47,820 INFO L226 Difference]: Without dead ends: 7947 [2022-04-27 15:09:47,823 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:09:47,823 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 153 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:47,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 83 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:09:47,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7947 states. [2022-04-27 15:09:47,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7947 to 6665. [2022-04-27 15:09:47,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:47,912 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7947 states. Second operand has 6665 states, 6661 states have (on average 1.4322173847770605) internal successors, (9540), 6661 states have internal predecessors, (9540), 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:09:47,916 INFO L74 IsIncluded]: Start isIncluded. First operand 7947 states. Second operand has 6665 states, 6661 states have (on average 1.4322173847770605) internal successors, (9540), 6661 states have internal predecessors, (9540), 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:09:47,921 INFO L87 Difference]: Start difference. First operand 7947 states. Second operand has 6665 states, 6661 states have (on average 1.4322173847770605) internal successors, (9540), 6661 states have internal predecessors, (9540), 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:09:49,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:49,846 INFO L93 Difference]: Finished difference Result 7947 states and 11848 transitions. [2022-04-27 15:09:49,846 INFO L276 IsEmpty]: Start isEmpty. Operand 7947 states and 11848 transitions. [2022-04-27 15:09:49,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:49,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:49,857 INFO L74 IsIncluded]: Start isIncluded. First operand has 6665 states, 6661 states have (on average 1.4322173847770605) internal successors, (9540), 6661 states have internal predecessors, (9540), 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 7947 states. [2022-04-27 15:09:49,861 INFO L87 Difference]: Start difference. First operand has 6665 states, 6661 states have (on average 1.4322173847770605) internal successors, (9540), 6661 states have internal predecessors, (9540), 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 7947 states. [2022-04-27 15:09:51,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:51,861 INFO L93 Difference]: Finished difference Result 7947 states and 11848 transitions. [2022-04-27 15:09:51,861 INFO L276 IsEmpty]: Start isEmpty. Operand 7947 states and 11848 transitions. [2022-04-27 15:09:51,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:51,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:51,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:51,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:51,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6665 states, 6661 states have (on average 1.4322173847770605) internal successors, (9540), 6661 states have internal predecessors, (9540), 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:09:53,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6665 states to 6665 states and 9543 transitions. [2022-04-27 15:09:53,481 INFO L78 Accepts]: Start accepts. Automaton has 6665 states and 9543 transitions. Word has length 30 [2022-04-27 15:09:53,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:53,481 INFO L495 AbstractCegarLoop]: Abstraction has 6665 states and 9543 transitions. [2022-04-27 15:09:53,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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:09:53,481 INFO L276 IsEmpty]: Start isEmpty. Operand 6665 states and 9543 transitions. [2022-04-27 15:09:53,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 15:09:53,484 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:53,484 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:53,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-27 15:09:53,484 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:53,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:53,485 INFO L85 PathProgramCache]: Analyzing trace with hash -140211197, now seen corresponding path program 1 times [2022-04-27 15:09:53,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:53,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875672336] [2022-04-27 15:09:53,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:53,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:53,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:53,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:53,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:53,510 INFO L290 TraceCheckUtils]: 0: Hoare triple {148630#(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(16, 2);call #Ultimate.allocInit(12, 3); {148624#true} is VALID [2022-04-27 15:09:53,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {148624#true} assume true; {148624#true} is VALID [2022-04-27 15:09:53,510 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {148624#true} {148624#true} #234#return; {148624#true} is VALID [2022-04-27 15:09:53,510 INFO L272 TraceCheckUtils]: 0: Hoare triple {148624#true} call ULTIMATE.init(); {148630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:53,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {148630#(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(16, 2);call #Ultimate.allocInit(12, 3); {148624#true} is VALID [2022-04-27 15:09:53,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {148624#true} assume true; {148624#true} is VALID [2022-04-27 15:09:53,510 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {148624#true} {148624#true} #234#return; {148624#true} is VALID [2022-04-27 15:09:53,510 INFO L272 TraceCheckUtils]: 4: Hoare triple {148624#true} call #t~ret17 := main(); {148624#true} is VALID [2022-04-27 15:09:53,511 INFO L290 TraceCheckUtils]: 5: Hoare triple {148624#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {148624#true} is VALID [2022-04-27 15:09:53,511 INFO L290 TraceCheckUtils]: 6: Hoare triple {148624#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {148624#true} is VALID [2022-04-27 15:09:53,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {148624#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {148624#true} is VALID [2022-04-27 15:09:53,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {148624#true} assume !(0 != ~p1~0); {148624#true} is VALID [2022-04-27 15:09:53,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {148624#true} assume !(0 != ~p2~0); {148624#true} is VALID [2022-04-27 15:09:53,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {148624#true} assume !(0 != ~p3~0); {148624#true} is VALID [2022-04-27 15:09:53,511 INFO L290 TraceCheckUtils]: 11: Hoare triple {148624#true} assume !(0 != ~p4~0); {148624#true} is VALID [2022-04-27 15:09:53,511 INFO L290 TraceCheckUtils]: 12: Hoare triple {148624#true} assume !(0 != ~p5~0); {148624#true} is VALID [2022-04-27 15:09:53,511 INFO L290 TraceCheckUtils]: 13: Hoare triple {148624#true} assume !(0 != ~p6~0); {148624#true} is VALID [2022-04-27 15:09:53,511 INFO L290 TraceCheckUtils]: 14: Hoare triple {148624#true} assume !(0 != ~p7~0); {148624#true} is VALID [2022-04-27 15:09:53,511 INFO L290 TraceCheckUtils]: 15: Hoare triple {148624#true} assume !(0 != ~p8~0); {148629#(= main_~p8~0 0)} is VALID [2022-04-27 15:09:53,512 INFO L290 TraceCheckUtils]: 16: Hoare triple {148629#(= main_~p8~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {148629#(= main_~p8~0 0)} is VALID [2022-04-27 15:09:53,512 INFO L290 TraceCheckUtils]: 17: Hoare triple {148629#(= main_~p8~0 0)} assume !(0 != ~p10~0); {148629#(= main_~p8~0 0)} is VALID [2022-04-27 15:09:53,512 INFO L290 TraceCheckUtils]: 18: Hoare triple {148629#(= main_~p8~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {148629#(= main_~p8~0 0)} is VALID [2022-04-27 15:09:53,512 INFO L290 TraceCheckUtils]: 19: Hoare triple {148629#(= main_~p8~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {148629#(= main_~p8~0 0)} is VALID [2022-04-27 15:09:53,513 INFO L290 TraceCheckUtils]: 20: Hoare triple {148629#(= main_~p8~0 0)} assume !(0 != ~p1~0); {148629#(= main_~p8~0 0)} is VALID [2022-04-27 15:09:53,513 INFO L290 TraceCheckUtils]: 21: Hoare triple {148629#(= main_~p8~0 0)} assume !(0 != ~p2~0); {148629#(= main_~p8~0 0)} is VALID [2022-04-27 15:09:53,513 INFO L290 TraceCheckUtils]: 22: Hoare triple {148629#(= main_~p8~0 0)} assume !(0 != ~p3~0); {148629#(= main_~p8~0 0)} is VALID [2022-04-27 15:09:53,513 INFO L290 TraceCheckUtils]: 23: Hoare triple {148629#(= main_~p8~0 0)} assume !(0 != ~p4~0); {148629#(= main_~p8~0 0)} is VALID [2022-04-27 15:09:53,513 INFO L290 TraceCheckUtils]: 24: Hoare triple {148629#(= main_~p8~0 0)} assume !(0 != ~p5~0); {148629#(= main_~p8~0 0)} is VALID [2022-04-27 15:09:53,514 INFO L290 TraceCheckUtils]: 25: Hoare triple {148629#(= main_~p8~0 0)} assume !(0 != ~p6~0); {148629#(= main_~p8~0 0)} is VALID [2022-04-27 15:09:53,514 INFO L290 TraceCheckUtils]: 26: Hoare triple {148629#(= main_~p8~0 0)} assume !(0 != ~p7~0); {148629#(= main_~p8~0 0)} is VALID [2022-04-27 15:09:53,514 INFO L290 TraceCheckUtils]: 27: Hoare triple {148629#(= main_~p8~0 0)} assume 0 != ~p8~0; {148625#false} is VALID [2022-04-27 15:09:53,514 INFO L290 TraceCheckUtils]: 28: Hoare triple {148625#false} assume 1 != ~lk8~0; {148625#false} is VALID [2022-04-27 15:09:53,514 INFO L290 TraceCheckUtils]: 29: Hoare triple {148625#false} assume !false; {148625#false} is VALID [2022-04-27 15:09:53,514 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:09:53,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:53,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875672336] [2022-04-27 15:09:53,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875672336] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:53,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:53,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:53,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922822783] [2022-04-27 15:09:53,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:53,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 30 [2022-04-27 15:09:53,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:53,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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:09:53,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:53,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:53,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:53,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:53,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:53,531 INFO L87 Difference]: Start difference. First operand 6665 states and 9543 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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:00,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:00,972 INFO L93 Difference]: Finished difference Result 15373 states and 22089 transitions. [2022-04-27 15:10:00,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:00,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 30 [2022-04-27 15:10:00,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:00,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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:00,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 207 transitions. [2022-04-27 15:10:00,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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:00,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 207 transitions. [2022-04-27 15:10:00,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 207 transitions. [2022-04-27 15:10:01,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 207 edges. 207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:03,287 INFO L225 Difference]: With dead ends: 15373 [2022-04-27 15:10:03,287 INFO L226 Difference]: Without dead ends: 8843 [2022-04-27 15:10:03,291 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:03,291 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 136 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:03,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 125 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:03,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8843 states. [2022-04-27 15:10:03,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8843 to 8841. [2022-04-27 15:10:03,381 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:03,389 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8843 states. Second operand has 8841 states, 8837 states have (on average 1.419938893289578) internal successors, (12548), 8837 states have internal predecessors, (12548), 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:03,396 INFO L74 IsIncluded]: Start isIncluded. First operand 8843 states. Second operand has 8841 states, 8837 states have (on average 1.419938893289578) internal successors, (12548), 8837 states have internal predecessors, (12548), 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:03,403 INFO L87 Difference]: Start difference. First operand 8843 states. Second operand has 8841 states, 8837 states have (on average 1.419938893289578) internal successors, (12548), 8837 states have internal predecessors, (12548), 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:05,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:05,735 INFO L93 Difference]: Finished difference Result 8843 states and 12552 transitions. [2022-04-27 15:10:05,735 INFO L276 IsEmpty]: Start isEmpty. Operand 8843 states and 12552 transitions. [2022-04-27 15:10:05,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:05,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:05,747 INFO L74 IsIncluded]: Start isIncluded. First operand has 8841 states, 8837 states have (on average 1.419938893289578) internal successors, (12548), 8837 states have internal predecessors, (12548), 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 8843 states. [2022-04-27 15:10:05,750 INFO L87 Difference]: Start difference. First operand has 8841 states, 8837 states have (on average 1.419938893289578) internal successors, (12548), 8837 states have internal predecessors, (12548), 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 8843 states. [2022-04-27 15:10:08,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:08,133 INFO L93 Difference]: Finished difference Result 8843 states and 12552 transitions. [2022-04-27 15:10:08,133 INFO L276 IsEmpty]: Start isEmpty. Operand 8843 states and 12552 transitions. [2022-04-27 15:10:08,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:08,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:08,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:08,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:08,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8841 states, 8837 states have (on average 1.419938893289578) internal successors, (12548), 8837 states have internal predecessors, (12548), 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:10,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8841 states to 8841 states and 12551 transitions. [2022-04-27 15:10:10,751 INFO L78 Accepts]: Start accepts. Automaton has 8841 states and 12551 transitions. Word has length 30 [2022-04-27 15:10:10,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:10,752 INFO L495 AbstractCegarLoop]: Abstraction has 8841 states and 12551 transitions. [2022-04-27 15:10:10,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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:10,752 INFO L276 IsEmpty]: Start isEmpty. Operand 8841 states and 12551 transitions. [2022-04-27 15:10:10,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 15:10:10,755 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:10,755 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:10,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-27 15:10:10,755 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:10,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:10,756 INFO L85 PathProgramCache]: Analyzing trace with hash 969703665, now seen corresponding path program 1 times [2022-04-27 15:10:10,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:10,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760904862] [2022-04-27 15:10:10,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:10,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:10,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:10,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:10,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:10,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {191196#(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(16, 2);call #Ultimate.allocInit(12, 3); {191190#true} is VALID [2022-04-27 15:10:10,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {191190#true} assume true; {191190#true} is VALID [2022-04-27 15:10:10,784 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {191190#true} {191190#true} #234#return; {191190#true} is VALID [2022-04-27 15:10:10,785 INFO L272 TraceCheckUtils]: 0: Hoare triple {191190#true} call ULTIMATE.init(); {191196#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:10,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {191196#(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(16, 2);call #Ultimate.allocInit(12, 3); {191190#true} is VALID [2022-04-27 15:10:10,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {191190#true} assume true; {191190#true} is VALID [2022-04-27 15:10:10,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {191190#true} {191190#true} #234#return; {191190#true} is VALID [2022-04-27 15:10:10,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {191190#true} call #t~ret17 := main(); {191190#true} is VALID [2022-04-27 15:10:10,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {191190#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {191190#true} is VALID [2022-04-27 15:10:10,785 INFO L290 TraceCheckUtils]: 6: Hoare triple {191190#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {191190#true} is VALID [2022-04-27 15:10:10,785 INFO L290 TraceCheckUtils]: 7: Hoare triple {191190#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {191190#true} is VALID [2022-04-27 15:10:10,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {191190#true} assume !(0 != ~p1~0); {191190#true} is VALID [2022-04-27 15:10:10,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {191190#true} assume !(0 != ~p2~0); {191190#true} is VALID [2022-04-27 15:10:10,785 INFO L290 TraceCheckUtils]: 10: Hoare triple {191190#true} assume !(0 != ~p3~0); {191190#true} is VALID [2022-04-27 15:10:10,785 INFO L290 TraceCheckUtils]: 11: Hoare triple {191190#true} assume !(0 != ~p4~0); {191190#true} is VALID [2022-04-27 15:10:10,785 INFO L290 TraceCheckUtils]: 12: Hoare triple {191190#true} assume !(0 != ~p5~0); {191190#true} is VALID [2022-04-27 15:10:10,785 INFO L290 TraceCheckUtils]: 13: Hoare triple {191190#true} assume !(0 != ~p6~0); {191190#true} is VALID [2022-04-27 15:10:10,785 INFO L290 TraceCheckUtils]: 14: Hoare triple {191190#true} assume !(0 != ~p7~0); {191190#true} is VALID [2022-04-27 15:10:10,786 INFO L290 TraceCheckUtils]: 15: Hoare triple {191190#true} assume 0 != ~p8~0;~lk8~0 := 1; {191195#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:10,786 INFO L290 TraceCheckUtils]: 16: Hoare triple {191195#(not (= main_~p8~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {191195#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:10,786 INFO L290 TraceCheckUtils]: 17: Hoare triple {191195#(not (= main_~p8~0 0))} assume !(0 != ~p10~0); {191195#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:10,786 INFO L290 TraceCheckUtils]: 18: Hoare triple {191195#(not (= main_~p8~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {191195#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:10,787 INFO L290 TraceCheckUtils]: 19: Hoare triple {191195#(not (= main_~p8~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {191195#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:10,787 INFO L290 TraceCheckUtils]: 20: Hoare triple {191195#(not (= main_~p8~0 0))} assume !(0 != ~p1~0); {191195#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:10,787 INFO L290 TraceCheckUtils]: 21: Hoare triple {191195#(not (= main_~p8~0 0))} assume !(0 != ~p2~0); {191195#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:10,787 INFO L290 TraceCheckUtils]: 22: Hoare triple {191195#(not (= main_~p8~0 0))} assume !(0 != ~p3~0); {191195#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:10,788 INFO L290 TraceCheckUtils]: 23: Hoare triple {191195#(not (= main_~p8~0 0))} assume !(0 != ~p4~0); {191195#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:10,788 INFO L290 TraceCheckUtils]: 24: Hoare triple {191195#(not (= main_~p8~0 0))} assume !(0 != ~p5~0); {191195#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:10,788 INFO L290 TraceCheckUtils]: 25: Hoare triple {191195#(not (= main_~p8~0 0))} assume !(0 != ~p6~0); {191195#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:10,788 INFO L290 TraceCheckUtils]: 26: Hoare triple {191195#(not (= main_~p8~0 0))} assume !(0 != ~p7~0); {191195#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:10,789 INFO L290 TraceCheckUtils]: 27: Hoare triple {191195#(not (= main_~p8~0 0))} assume !(0 != ~p8~0); {191191#false} is VALID [2022-04-27 15:10:10,789 INFO L290 TraceCheckUtils]: 28: Hoare triple {191191#false} assume 0 != ~p9~0; {191191#false} is VALID [2022-04-27 15:10:10,789 INFO L290 TraceCheckUtils]: 29: Hoare triple {191191#false} assume 1 != ~lk9~0; {191191#false} is VALID [2022-04-27 15:10:10,789 INFO L290 TraceCheckUtils]: 30: Hoare triple {191191#false} assume !false; {191191#false} is VALID [2022-04-27 15:10:10,789 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:10,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:10,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760904862] [2022-04-27 15:10:10,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760904862] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:10,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:10,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:10,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166057837] [2022-04-27 15:10:10,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:10,790 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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 31 [2022-04-27 15:10:10,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:10,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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:10,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:10,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:10,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:10,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:10,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:10,807 INFO L87 Difference]: Start difference. First operand 8841 states and 12551 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:16,687 INFO L93 Difference]: Finished difference Result 13261 states and 18761 transitions. [2022-04-27 15:10:16,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:16,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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 31 [2022-04-27 15:10:16,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:16,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 202 transitions. [2022-04-27 15:10:16,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 202 transitions. [2022-04-27 15:10:16,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 202 transitions. [2022-04-27 15:10:16,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:19,027 INFO L225 Difference]: With dead ends: 13261 [2022-04-27 15:10:19,027 INFO L226 Difference]: Without dead ends: 8971 [2022-04-27 15:10:19,030 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:19,030 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 150 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:19,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 112 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:19,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8971 states. [2022-04-27 15:10:19,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8971 to 8969. [2022-04-27 15:10:19,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:19,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8971 states. Second operand has 8969 states, 8965 states have (on average 1.399665365309537) internal successors, (12548), 8965 states have internal predecessors, (12548), 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:19,129 INFO L74 IsIncluded]: Start isIncluded. First operand 8971 states. Second operand has 8969 states, 8965 states have (on average 1.399665365309537) internal successors, (12548), 8965 states have internal predecessors, (12548), 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:19,137 INFO L87 Difference]: Start difference. First operand 8971 states. Second operand has 8969 states, 8965 states have (on average 1.399665365309537) internal successors, (12548), 8965 states have internal predecessors, (12548), 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:21,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:21,514 INFO L93 Difference]: Finished difference Result 8971 states and 12552 transitions. [2022-04-27 15:10:21,514 INFO L276 IsEmpty]: Start isEmpty. Operand 8971 states and 12552 transitions. [2022-04-27 15:10:21,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:21,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:21,528 INFO L74 IsIncluded]: Start isIncluded. First operand has 8969 states, 8965 states have (on average 1.399665365309537) internal successors, (12548), 8965 states have internal predecessors, (12548), 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 8971 states. [2022-04-27 15:10:21,536 INFO L87 Difference]: Start difference. First operand has 8969 states, 8965 states have (on average 1.399665365309537) internal successors, (12548), 8965 states have internal predecessors, (12548), 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 8971 states. [2022-04-27 15:10:23,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:23,990 INFO L93 Difference]: Finished difference Result 8971 states and 12552 transitions. [2022-04-27 15:10:23,990 INFO L276 IsEmpty]: Start isEmpty. Operand 8971 states and 12552 transitions. [2022-04-27 15:10:23,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:23,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:23,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:23,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:24,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8969 states, 8965 states have (on average 1.399665365309537) internal successors, (12548), 8965 states have internal predecessors, (12548), 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:26,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8969 states to 8969 states and 12551 transitions. [2022-04-27 15:10:26,357 INFO L78 Accepts]: Start accepts. Automaton has 8969 states and 12551 transitions. Word has length 31 [2022-04-27 15:10:26,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:26,358 INFO L495 AbstractCegarLoop]: Abstraction has 8969 states and 12551 transitions. [2022-04-27 15:10:26,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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:26,358 INFO L276 IsEmpty]: Start isEmpty. Operand 8969 states and 12551 transitions. [2022-04-27 15:10:26,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 15:10:26,362 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:26,362 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:26,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-27 15:10:26,362 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:26,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:26,363 INFO L85 PathProgramCache]: Analyzing trace with hash -51364689, now seen corresponding path program 1 times [2022-04-27 15:10:26,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:26,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46080918] [2022-04-27 15:10:26,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:26,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:26,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:26,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {232034#(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(16, 2);call #Ultimate.allocInit(12, 3); {232028#true} is VALID [2022-04-27 15:10:26,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {232028#true} assume true; {232028#true} is VALID [2022-04-27 15:10:26,411 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {232028#true} {232028#true} #234#return; {232028#true} is VALID [2022-04-27 15:10:26,412 INFO L272 TraceCheckUtils]: 0: Hoare triple {232028#true} call ULTIMATE.init(); {232034#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:26,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {232034#(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(16, 2);call #Ultimate.allocInit(12, 3); {232028#true} is VALID [2022-04-27 15:10:26,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {232028#true} assume true; {232028#true} is VALID [2022-04-27 15:10:26,412 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {232028#true} {232028#true} #234#return; {232028#true} is VALID [2022-04-27 15:10:26,412 INFO L272 TraceCheckUtils]: 4: Hoare triple {232028#true} call #t~ret17 := main(); {232028#true} is VALID [2022-04-27 15:10:26,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {232028#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {232028#true} is VALID [2022-04-27 15:10:26,412 INFO L290 TraceCheckUtils]: 6: Hoare triple {232028#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {232028#true} is VALID [2022-04-27 15:10:26,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {232028#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {232028#true} is VALID [2022-04-27 15:10:26,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {232028#true} assume !(0 != ~p1~0); {232028#true} is VALID [2022-04-27 15:10:26,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {232028#true} assume !(0 != ~p2~0); {232028#true} is VALID [2022-04-27 15:10:26,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {232028#true} assume !(0 != ~p3~0); {232028#true} is VALID [2022-04-27 15:10:26,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {232028#true} assume !(0 != ~p4~0); {232028#true} is VALID [2022-04-27 15:10:26,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {232028#true} assume !(0 != ~p5~0); {232028#true} is VALID [2022-04-27 15:10:26,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {232028#true} assume !(0 != ~p6~0); {232028#true} is VALID [2022-04-27 15:10:26,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {232028#true} assume !(0 != ~p7~0); {232028#true} is VALID [2022-04-27 15:10:26,413 INFO L290 TraceCheckUtils]: 15: Hoare triple {232028#true} assume !(0 != ~p8~0); {232028#true} is VALID [2022-04-27 15:10:26,422 INFO L290 TraceCheckUtils]: 16: Hoare triple {232028#true} assume 0 != ~p9~0;~lk9~0 := 1; {232033#(= main_~lk9~0 1)} is VALID [2022-04-27 15:10:26,423 INFO L290 TraceCheckUtils]: 17: Hoare triple {232033#(= main_~lk9~0 1)} assume !(0 != ~p10~0); {232033#(= main_~lk9~0 1)} is VALID [2022-04-27 15:10:26,423 INFO L290 TraceCheckUtils]: 18: Hoare triple {232033#(= main_~lk9~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {232033#(= main_~lk9~0 1)} is VALID [2022-04-27 15:10:26,423 INFO L290 TraceCheckUtils]: 19: Hoare triple {232033#(= main_~lk9~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {232033#(= main_~lk9~0 1)} is VALID [2022-04-27 15:10:26,423 INFO L290 TraceCheckUtils]: 20: Hoare triple {232033#(= main_~lk9~0 1)} assume !(0 != ~p1~0); {232033#(= main_~lk9~0 1)} is VALID [2022-04-27 15:10:26,424 INFO L290 TraceCheckUtils]: 21: Hoare triple {232033#(= main_~lk9~0 1)} assume !(0 != ~p2~0); {232033#(= main_~lk9~0 1)} is VALID [2022-04-27 15:10:26,424 INFO L290 TraceCheckUtils]: 22: Hoare triple {232033#(= main_~lk9~0 1)} assume !(0 != ~p3~0); {232033#(= main_~lk9~0 1)} is VALID [2022-04-27 15:10:26,424 INFO L290 TraceCheckUtils]: 23: Hoare triple {232033#(= main_~lk9~0 1)} assume !(0 != ~p4~0); {232033#(= main_~lk9~0 1)} is VALID [2022-04-27 15:10:26,424 INFO L290 TraceCheckUtils]: 24: Hoare triple {232033#(= main_~lk9~0 1)} assume !(0 != ~p5~0); {232033#(= main_~lk9~0 1)} is VALID [2022-04-27 15:10:26,425 INFO L290 TraceCheckUtils]: 25: Hoare triple {232033#(= main_~lk9~0 1)} assume !(0 != ~p6~0); {232033#(= main_~lk9~0 1)} is VALID [2022-04-27 15:10:26,425 INFO L290 TraceCheckUtils]: 26: Hoare triple {232033#(= main_~lk9~0 1)} assume !(0 != ~p7~0); {232033#(= main_~lk9~0 1)} is VALID [2022-04-27 15:10:26,425 INFO L290 TraceCheckUtils]: 27: Hoare triple {232033#(= main_~lk9~0 1)} assume !(0 != ~p8~0); {232033#(= main_~lk9~0 1)} is VALID [2022-04-27 15:10:26,425 INFO L290 TraceCheckUtils]: 28: Hoare triple {232033#(= main_~lk9~0 1)} assume 0 != ~p9~0; {232033#(= main_~lk9~0 1)} is VALID [2022-04-27 15:10:26,426 INFO L290 TraceCheckUtils]: 29: Hoare triple {232033#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {232029#false} is VALID [2022-04-27 15:10:26,426 INFO L290 TraceCheckUtils]: 30: Hoare triple {232029#false} assume !false; {232029#false} is VALID [2022-04-27 15:10:26,426 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:26,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:26,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46080918] [2022-04-27 15:10:26,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46080918] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:26,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:26,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:26,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625625999] [2022-04-27 15:10:26,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:26,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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 31 [2022-04-27 15:10:26,427 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:26,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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:26,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:26,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:26,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:26,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:26,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:26,444 INFO L87 Difference]: Start difference. First operand 8969 states and 12551 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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:33,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:33,980 INFO L93 Difference]: Finished difference Result 15373 states and 21897 transitions. [2022-04-27 15:10:33,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:33,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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 31 [2022-04-27 15:10:33,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:33,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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:33,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-27 15:10:33,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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:33,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-27 15:10:33,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 123 transitions. [2022-04-27 15:10:34,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:40,558 INFO L225 Difference]: With dead ends: 15373 [2022-04-27 15:10:40,558 INFO L226 Difference]: Without dead ends: 15371 [2022-04-27 15:10:40,559 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:40,560 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 146 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:40,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 82 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:40,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15371 states. [2022-04-27 15:10:40,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15371 to 13321. [2022-04-27 15:10:40,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:40,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15371 states. Second operand has 13321 states, 13317 states have (on average 1.355560561688068) internal successors, (18052), 13317 states have internal predecessors, (18052), 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:40,703 INFO L74 IsIncluded]: Start isIncluded. First operand 15371 states. Second operand has 13321 states, 13317 states have (on average 1.355560561688068) internal successors, (18052), 13317 states have internal predecessors, (18052), 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:40,712 INFO L87 Difference]: Start difference. First operand 15371 states. Second operand has 13321 states, 13317 states have (on average 1.355560561688068) internal successors, (18052), 13317 states have internal predecessors, (18052), 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:47,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:47,791 INFO L93 Difference]: Finished difference Result 15371 states and 21640 transitions. [2022-04-27 15:10:47,791 INFO L276 IsEmpty]: Start isEmpty. Operand 15371 states and 21640 transitions. [2022-04-27 15:10:47,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:47,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:47,812 INFO L74 IsIncluded]: Start isIncluded. First operand has 13321 states, 13317 states have (on average 1.355560561688068) internal successors, (18052), 13317 states have internal predecessors, (18052), 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 15371 states. [2022-04-27 15:10:47,822 INFO L87 Difference]: Start difference. First operand has 13321 states, 13317 states have (on average 1.355560561688068) internal successors, (18052), 13317 states have internal predecessors, (18052), 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 15371 states. [2022-04-27 15:10:54,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:54,683 INFO L93 Difference]: Finished difference Result 15371 states and 21640 transitions. [2022-04-27 15:10:54,683 INFO L276 IsEmpty]: Start isEmpty. Operand 15371 states and 21640 transitions. [2022-04-27 15:10:54,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:54,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:54,692 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:54,692 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:54,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13321 states, 13317 states have (on average 1.355560561688068) internal successors, (18052), 13317 states have internal predecessors, (18052), 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:11:00,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13321 states to 13321 states and 18055 transitions. [2022-04-27 15:11:00,398 INFO L78 Accepts]: Start accepts. Automaton has 13321 states and 18055 transitions. Word has length 31 [2022-04-27 15:11:00,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:11:00,399 INFO L495 AbstractCegarLoop]: Abstraction has 13321 states and 18055 transitions. [2022-04-27 15:11:00,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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:11:00,399 INFO L276 IsEmpty]: Start isEmpty. Operand 13321 states and 18055 transitions. [2022-04-27 15:11:00,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 15:11:00,405 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:11:00,405 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:11:00,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-27 15:11:00,405 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:11:00,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:11:00,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1331228367, now seen corresponding path program 1 times [2022-04-27 15:11:00,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:11:00,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869469070] [2022-04-27 15:11:00,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:11:00,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:11:00,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:11:00,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:11:00,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:11:00,434 INFO L290 TraceCheckUtils]: 0: Hoare triple {292264#(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(16, 2);call #Ultimate.allocInit(12, 3); {292258#true} is VALID [2022-04-27 15:11:00,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {292258#true} assume true; {292258#true} is VALID [2022-04-27 15:11:00,434 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {292258#true} {292258#true} #234#return; {292258#true} is VALID [2022-04-27 15:11:00,434 INFO L272 TraceCheckUtils]: 0: Hoare triple {292258#true} call ULTIMATE.init(); {292264#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:11:00,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {292264#(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(16, 2);call #Ultimate.allocInit(12, 3); {292258#true} is VALID [2022-04-27 15:11:00,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {292258#true} assume true; {292258#true} is VALID [2022-04-27 15:11:00,435 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {292258#true} {292258#true} #234#return; {292258#true} is VALID [2022-04-27 15:11:00,435 INFO L272 TraceCheckUtils]: 4: Hoare triple {292258#true} call #t~ret17 := main(); {292258#true} is VALID [2022-04-27 15:11:00,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {292258#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {292258#true} is VALID [2022-04-27 15:11:00,435 INFO L290 TraceCheckUtils]: 6: Hoare triple {292258#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {292258#true} is VALID [2022-04-27 15:11:00,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {292258#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {292258#true} is VALID [2022-04-27 15:11:00,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {292258#true} assume !(0 != ~p1~0); {292258#true} is VALID [2022-04-27 15:11:00,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {292258#true} assume !(0 != ~p2~0); {292258#true} is VALID [2022-04-27 15:11:00,435 INFO L290 TraceCheckUtils]: 10: Hoare triple {292258#true} assume !(0 != ~p3~0); {292258#true} is VALID [2022-04-27 15:11:00,435 INFO L290 TraceCheckUtils]: 11: Hoare triple {292258#true} assume !(0 != ~p4~0); {292258#true} is VALID [2022-04-27 15:11:00,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {292258#true} assume !(0 != ~p5~0); {292258#true} is VALID [2022-04-27 15:11:00,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {292258#true} assume !(0 != ~p6~0); {292258#true} is VALID [2022-04-27 15:11:00,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {292258#true} assume !(0 != ~p7~0); {292258#true} is VALID [2022-04-27 15:11:00,435 INFO L290 TraceCheckUtils]: 15: Hoare triple {292258#true} assume !(0 != ~p8~0); {292258#true} is VALID [2022-04-27 15:11:00,436 INFO L290 TraceCheckUtils]: 16: Hoare triple {292258#true} assume !(0 != ~p9~0); {292263#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:00,436 INFO L290 TraceCheckUtils]: 17: Hoare triple {292263#(= main_~p9~0 0)} assume !(0 != ~p10~0); {292263#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:00,436 INFO L290 TraceCheckUtils]: 18: Hoare triple {292263#(= main_~p9~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {292263#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:00,436 INFO L290 TraceCheckUtils]: 19: Hoare triple {292263#(= main_~p9~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {292263#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:00,437 INFO L290 TraceCheckUtils]: 20: Hoare triple {292263#(= main_~p9~0 0)} assume !(0 != ~p1~0); {292263#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:00,437 INFO L290 TraceCheckUtils]: 21: Hoare triple {292263#(= main_~p9~0 0)} assume !(0 != ~p2~0); {292263#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:00,437 INFO L290 TraceCheckUtils]: 22: Hoare triple {292263#(= main_~p9~0 0)} assume !(0 != ~p3~0); {292263#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:00,437 INFO L290 TraceCheckUtils]: 23: Hoare triple {292263#(= main_~p9~0 0)} assume !(0 != ~p4~0); {292263#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:00,437 INFO L290 TraceCheckUtils]: 24: Hoare triple {292263#(= main_~p9~0 0)} assume !(0 != ~p5~0); {292263#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:00,438 INFO L290 TraceCheckUtils]: 25: Hoare triple {292263#(= main_~p9~0 0)} assume !(0 != ~p6~0); {292263#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:00,438 INFO L290 TraceCheckUtils]: 26: Hoare triple {292263#(= main_~p9~0 0)} assume !(0 != ~p7~0); {292263#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:00,438 INFO L290 TraceCheckUtils]: 27: Hoare triple {292263#(= main_~p9~0 0)} assume !(0 != ~p8~0); {292263#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:00,438 INFO L290 TraceCheckUtils]: 28: Hoare triple {292263#(= main_~p9~0 0)} assume 0 != ~p9~0; {292259#false} is VALID [2022-04-27 15:11:00,438 INFO L290 TraceCheckUtils]: 29: Hoare triple {292259#false} assume 1 != ~lk9~0; {292259#false} is VALID [2022-04-27 15:11:00,439 INFO L290 TraceCheckUtils]: 30: Hoare triple {292259#false} assume !false; {292259#false} is VALID [2022-04-27 15:11:00,439 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:11:00,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:11:00,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869469070] [2022-04-27 15:11:00,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869469070] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:11:00,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:11:00,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:11:00,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002826678] [2022-04-27 15:11:00,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:11:00,439 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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 31 [2022-04-27 15:11:00,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:11:00,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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:11:00,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:11:00,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:11:00,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:11:00,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:11:00,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:11:00,454 INFO L87 Difference]: Start difference. First operand 13321 states and 18055 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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:11:30,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:11:30,077 INFO L93 Difference]: Finished difference Result 30477 states and 41353 transitions. [2022-04-27 15:11:30,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:11:30,077 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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 31 [2022-04-27 15:11:30,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:11:30,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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:11:30,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2022-04-27 15:11:30,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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:11:30,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2022-04-27 15:11:30,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 204 transitions. [2022-04-27 15:11:30,206 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:11:38,504 INFO L225 Difference]: With dead ends: 30477 [2022-04-27 15:11:38,504 INFO L226 Difference]: Without dead ends: 17419 [2022-04-27 15:11:38,514 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:11:38,514 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 130 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:11:38,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 127 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:11:38,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17419 states. [2022-04-27 15:11:38,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17419 to 17417. [2022-04-27 15:11:38,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:11:38,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17419 states. Second operand has 17417 states, 17413 states have (on average 1.3380807442715212) internal successors, (23300), 17413 states have internal predecessors, (23300), 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:11:38,735 INFO L74 IsIncluded]: Start isIncluded. First operand 17419 states. Second operand has 17417 states, 17413 states have (on average 1.3380807442715212) internal successors, (23300), 17413 states have internal predecessors, (23300), 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:11:38,751 INFO L87 Difference]: Start difference. First operand 17419 states. Second operand has 17417 states, 17413 states have (on average 1.3380807442715212) internal successors, (23300), 17413 states have internal predecessors, (23300), 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:11:47,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:11:47,901 INFO L93 Difference]: Finished difference Result 17419 states and 23304 transitions. [2022-04-27 15:11:47,901 INFO L276 IsEmpty]: Start isEmpty. Operand 17419 states and 23304 transitions. [2022-04-27 15:11:47,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:11:47,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:11:47,928 INFO L74 IsIncluded]: Start isIncluded. First operand has 17417 states, 17413 states have (on average 1.3380807442715212) internal successors, (23300), 17413 states have internal predecessors, (23300), 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 17419 states. [2022-04-27 15:11:47,979 INFO L87 Difference]: Start difference. First operand has 17417 states, 17413 states have (on average 1.3380807442715212) internal successors, (23300), 17413 states have internal predecessors, (23300), 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 17419 states. [2022-04-27 15:11:57,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:11:57,427 INFO L93 Difference]: Finished difference Result 17419 states and 23304 transitions. [2022-04-27 15:11:57,427 INFO L276 IsEmpty]: Start isEmpty. Operand 17419 states and 23304 transitions. [2022-04-27 15:11:57,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:11:57,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:11:57,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:11:57,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:11:57,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17417 states, 17413 states have (on average 1.3380807442715212) internal successors, (23300), 17413 states have internal predecessors, (23300), 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:12:07,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17417 states to 17417 states and 23303 transitions. [2022-04-27 15:12:07,091 INFO L78 Accepts]: Start accepts. Automaton has 17417 states and 23303 transitions. Word has length 31 [2022-04-27 15:12:07,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:12:07,091 INFO L495 AbstractCegarLoop]: Abstraction has 17417 states and 23303 transitions. [2022-04-27 15:12:07,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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:12:07,091 INFO L276 IsEmpty]: Start isEmpty. Operand 17417 states and 23303 transitions. [2022-04-27 15:12:07,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 15:12:07,097 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:12:07,097 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:12:07,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-27 15:12:07,098 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:12:07,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:12:07,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1592089896, now seen corresponding path program 1 times [2022-04-27 15:12:07,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:12:07,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224766248] [2022-04-27 15:12:07,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:12:07,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:12:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:12:07,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:12:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:12:07,139 INFO L290 TraceCheckUtils]: 0: Hoare triple {376302#(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(16, 2);call #Ultimate.allocInit(12, 3); {376296#true} is VALID [2022-04-27 15:12:07,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {376296#true} assume true; {376296#true} is VALID [2022-04-27 15:12:07,139 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {376296#true} {376296#true} #234#return; {376296#true} is VALID [2022-04-27 15:12:07,139 INFO L272 TraceCheckUtils]: 0: Hoare triple {376296#true} call ULTIMATE.init(); {376302#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:12:07,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {376302#(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(16, 2);call #Ultimate.allocInit(12, 3); {376296#true} is VALID [2022-04-27 15:12:07,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {376296#true} assume true; {376296#true} is VALID [2022-04-27 15:12:07,139 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {376296#true} {376296#true} #234#return; {376296#true} is VALID [2022-04-27 15:12:07,139 INFO L272 TraceCheckUtils]: 4: Hoare triple {376296#true} call #t~ret17 := main(); {376296#true} is VALID [2022-04-27 15:12:07,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {376296#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {376296#true} is VALID [2022-04-27 15:12:07,140 INFO L290 TraceCheckUtils]: 6: Hoare triple {376296#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {376296#true} is VALID [2022-04-27 15:12:07,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {376296#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {376296#true} is VALID [2022-04-27 15:12:07,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {376296#true} assume !(0 != ~p1~0); {376296#true} is VALID [2022-04-27 15:12:07,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {376296#true} assume !(0 != ~p2~0); {376296#true} is VALID [2022-04-27 15:12:07,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {376296#true} assume !(0 != ~p3~0); {376296#true} is VALID [2022-04-27 15:12:07,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {376296#true} assume !(0 != ~p4~0); {376296#true} is VALID [2022-04-27 15:12:07,140 INFO L290 TraceCheckUtils]: 12: Hoare triple {376296#true} assume !(0 != ~p5~0); {376296#true} is VALID [2022-04-27 15:12:07,140 INFO L290 TraceCheckUtils]: 13: Hoare triple {376296#true} assume !(0 != ~p6~0); {376296#true} is VALID [2022-04-27 15:12:07,140 INFO L290 TraceCheckUtils]: 14: Hoare triple {376296#true} assume !(0 != ~p7~0); {376296#true} is VALID [2022-04-27 15:12:07,140 INFO L290 TraceCheckUtils]: 15: Hoare triple {376296#true} assume !(0 != ~p8~0); {376296#true} is VALID [2022-04-27 15:12:07,140 INFO L290 TraceCheckUtils]: 16: Hoare triple {376296#true} assume 0 != ~p9~0;~lk9~0 := 1; {376301#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:12:07,141 INFO L290 TraceCheckUtils]: 17: Hoare triple {376301#(not (= main_~p9~0 0))} assume !(0 != ~p10~0); {376301#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:12:07,141 INFO L290 TraceCheckUtils]: 18: Hoare triple {376301#(not (= main_~p9~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {376301#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:12:07,141 INFO L290 TraceCheckUtils]: 19: Hoare triple {376301#(not (= main_~p9~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {376301#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:12:07,141 INFO L290 TraceCheckUtils]: 20: Hoare triple {376301#(not (= main_~p9~0 0))} assume !(0 != ~p1~0); {376301#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:12:07,141 INFO L290 TraceCheckUtils]: 21: Hoare triple {376301#(not (= main_~p9~0 0))} assume !(0 != ~p2~0); {376301#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:12:07,142 INFO L290 TraceCheckUtils]: 22: Hoare triple {376301#(not (= main_~p9~0 0))} assume !(0 != ~p3~0); {376301#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:12:07,142 INFO L290 TraceCheckUtils]: 23: Hoare triple {376301#(not (= main_~p9~0 0))} assume !(0 != ~p4~0); {376301#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:12:07,142 INFO L290 TraceCheckUtils]: 24: Hoare triple {376301#(not (= main_~p9~0 0))} assume !(0 != ~p5~0); {376301#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:12:07,142 INFO L290 TraceCheckUtils]: 25: Hoare triple {376301#(not (= main_~p9~0 0))} assume !(0 != ~p6~0); {376301#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:12:07,143 INFO L290 TraceCheckUtils]: 26: Hoare triple {376301#(not (= main_~p9~0 0))} assume !(0 != ~p7~0); {376301#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:12:07,143 INFO L290 TraceCheckUtils]: 27: Hoare triple {376301#(not (= main_~p9~0 0))} assume !(0 != ~p8~0); {376301#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:12:07,143 INFO L290 TraceCheckUtils]: 28: Hoare triple {376301#(not (= main_~p9~0 0))} assume !(0 != ~p9~0); {376297#false} is VALID [2022-04-27 15:12:07,143 INFO L290 TraceCheckUtils]: 29: Hoare triple {376297#false} assume 0 != ~p10~0; {376297#false} is VALID [2022-04-27 15:12:07,143 INFO L290 TraceCheckUtils]: 30: Hoare triple {376297#false} assume 1 != ~lk10~0; {376297#false} is VALID [2022-04-27 15:12:07,143 INFO L290 TraceCheckUtils]: 31: Hoare triple {376297#false} assume !false; {376297#false} is VALID [2022-04-27 15:12:07,143 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:12:07,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:12:07,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224766248] [2022-04-27 15:12:07,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224766248] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:12:07,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:12:07,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:12:07,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214551941] [2022-04-27 15:12:07,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:12:07,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 32 [2022-04-27 15:12:07,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:12:07,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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:12:07,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:12:07,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:12:07,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:12:07,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:12:07,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:12:07,160 INFO L87 Difference]: Start difference. First operand 17417 states and 23303 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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:12:28,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:12:28,793 INFO L93 Difference]: Finished difference Result 26125 states and 34825 transitions. [2022-04-27 15:12:28,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:12:28,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 32 [2022-04-27 15:12:28,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:12:28,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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:12:28,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2022-04-27 15:12:28,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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:12:28,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2022-04-27 15:12:28,795 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 199 transitions. [2022-04-27 15:12:28,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:12:37,391 INFO L225 Difference]: With dead ends: 26125 [2022-04-27 15:12:37,392 INFO L226 Difference]: Without dead ends: 17675 [2022-04-27 15:12:37,398 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:12:37,398 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 149 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:12:37,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 109 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:12:37,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17675 states. [2022-04-27 15:12:37,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17675 to 17673. [2022-04-27 15:12:37,574 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:12:37,592 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17675 states. Second operand has 17673 states, 17669 states have (on average 1.3186937574282642) internal successors, (23300), 17669 states have internal predecessors, (23300), 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:12:37,608 INFO L74 IsIncluded]: Start isIncluded. First operand 17675 states. Second operand has 17673 states, 17669 states have (on average 1.3186937574282642) internal successors, (23300), 17669 states have internal predecessors, (23300), 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:12:37,624 INFO L87 Difference]: Start difference. First operand 17675 states. Second operand has 17673 states, 17669 states have (on average 1.3186937574282642) internal successors, (23300), 17669 states have internal predecessors, (23300), 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:12:46,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:12:46,053 INFO L93 Difference]: Finished difference Result 17675 states and 23304 transitions. [2022-04-27 15:12:46,053 INFO L276 IsEmpty]: Start isEmpty. Operand 17675 states and 23304 transitions. [2022-04-27 15:12:46,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:12:46,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:12:46,076 INFO L74 IsIncluded]: Start isIncluded. First operand has 17673 states, 17669 states have (on average 1.3186937574282642) internal successors, (23300), 17669 states have internal predecessors, (23300), 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 17675 states. [2022-04-27 15:12:46,087 INFO L87 Difference]: Start difference. First operand has 17673 states, 17669 states have (on average 1.3186937574282642) internal successors, (23300), 17669 states have internal predecessors, (23300), 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 17675 states. [2022-04-27 15:12:55,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:12:55,311 INFO L93 Difference]: Finished difference Result 17675 states and 23304 transitions. [2022-04-27 15:12:55,311 INFO L276 IsEmpty]: Start isEmpty. Operand 17675 states and 23304 transitions. [2022-04-27 15:12:55,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:12:55,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:12:55,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:12:55,322 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:12:55,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17673 states, 17669 states have (on average 1.3186937574282642) internal successors, (23300), 17669 states have internal predecessors, (23300), 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:13:04,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17673 states to 17673 states and 23303 transitions. [2022-04-27 15:13:04,660 INFO L78 Accepts]: Start accepts. Automaton has 17673 states and 23303 transitions. Word has length 32 [2022-04-27 15:13:04,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:13:04,661 INFO L495 AbstractCegarLoop]: Abstraction has 17673 states and 23303 transitions. [2022-04-27 15:13:04,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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:13:04,661 INFO L276 IsEmpty]: Start isEmpty. Operand 17673 states and 23303 transitions. [2022-04-27 15:13:04,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 15:13:04,667 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:13:04,667 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:13:04,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-27 15:13:04,667 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:13:04,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:13:04,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1681809046, now seen corresponding path program 1 times [2022-04-27 15:13:04,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:13:04,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692672452] [2022-04-27 15:13:04,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:13:04,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:13:04,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:13:04,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:13:04,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:13:04,706 INFO L290 TraceCheckUtils]: 0: Hoare triple {456756#(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(16, 2);call #Ultimate.allocInit(12, 3); {456750#true} is VALID [2022-04-27 15:13:04,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {456750#true} assume true; {456750#true} is VALID [2022-04-27 15:13:04,706 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {456750#true} {456750#true} #234#return; {456750#true} is VALID [2022-04-27 15:13:04,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {456750#true} call ULTIMATE.init(); {456756#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:13:04,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {456756#(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(16, 2);call #Ultimate.allocInit(12, 3); {456750#true} is VALID [2022-04-27 15:13:04,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {456750#true} assume true; {456750#true} is VALID [2022-04-27 15:13:04,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {456750#true} {456750#true} #234#return; {456750#true} is VALID [2022-04-27 15:13:04,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {456750#true} call #t~ret17 := main(); {456750#true} is VALID [2022-04-27 15:13:04,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {456750#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {456750#true} is VALID [2022-04-27 15:13:04,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {456750#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {456750#true} is VALID [2022-04-27 15:13:04,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {456750#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {456750#true} is VALID [2022-04-27 15:13:04,707 INFO L290 TraceCheckUtils]: 8: Hoare triple {456750#true} assume !(0 != ~p1~0); {456750#true} is VALID [2022-04-27 15:13:04,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {456750#true} assume !(0 != ~p2~0); {456750#true} is VALID [2022-04-27 15:13:04,707 INFO L290 TraceCheckUtils]: 10: Hoare triple {456750#true} assume !(0 != ~p3~0); {456750#true} is VALID [2022-04-27 15:13:04,707 INFO L290 TraceCheckUtils]: 11: Hoare triple {456750#true} assume !(0 != ~p4~0); {456750#true} is VALID [2022-04-27 15:13:04,707 INFO L290 TraceCheckUtils]: 12: Hoare triple {456750#true} assume !(0 != ~p5~0); {456750#true} is VALID [2022-04-27 15:13:04,707 INFO L290 TraceCheckUtils]: 13: Hoare triple {456750#true} assume !(0 != ~p6~0); {456750#true} is VALID [2022-04-27 15:13:04,707 INFO L290 TraceCheckUtils]: 14: Hoare triple {456750#true} assume !(0 != ~p7~0); {456750#true} is VALID [2022-04-27 15:13:04,707 INFO L290 TraceCheckUtils]: 15: Hoare triple {456750#true} assume !(0 != ~p8~0); {456750#true} is VALID [2022-04-27 15:13:04,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {456750#true} assume !(0 != ~p9~0); {456750#true} is VALID [2022-04-27 15:13:04,708 INFO L290 TraceCheckUtils]: 17: Hoare triple {456750#true} assume !(0 != ~p10~0); {456755#(= main_~p10~0 0)} is VALID [2022-04-27 15:13:04,708 INFO L290 TraceCheckUtils]: 18: Hoare triple {456755#(= main_~p10~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {456755#(= main_~p10~0 0)} is VALID [2022-04-27 15:13:04,708 INFO L290 TraceCheckUtils]: 19: Hoare triple {456755#(= main_~p10~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {456755#(= main_~p10~0 0)} is VALID [2022-04-27 15:13:04,709 INFO L290 TraceCheckUtils]: 20: Hoare triple {456755#(= main_~p10~0 0)} assume !(0 != ~p1~0); {456755#(= main_~p10~0 0)} is VALID [2022-04-27 15:13:04,709 INFO L290 TraceCheckUtils]: 21: Hoare triple {456755#(= main_~p10~0 0)} assume !(0 != ~p2~0); {456755#(= main_~p10~0 0)} is VALID [2022-04-27 15:13:04,709 INFO L290 TraceCheckUtils]: 22: Hoare triple {456755#(= main_~p10~0 0)} assume !(0 != ~p3~0); {456755#(= main_~p10~0 0)} is VALID [2022-04-27 15:13:04,710 INFO L290 TraceCheckUtils]: 23: Hoare triple {456755#(= main_~p10~0 0)} assume !(0 != ~p4~0); {456755#(= main_~p10~0 0)} is VALID [2022-04-27 15:13:04,710 INFO L290 TraceCheckUtils]: 24: Hoare triple {456755#(= main_~p10~0 0)} assume !(0 != ~p5~0); {456755#(= main_~p10~0 0)} is VALID [2022-04-27 15:13:04,710 INFO L290 TraceCheckUtils]: 25: Hoare triple {456755#(= main_~p10~0 0)} assume !(0 != ~p6~0); {456755#(= main_~p10~0 0)} is VALID [2022-04-27 15:13:04,710 INFO L290 TraceCheckUtils]: 26: Hoare triple {456755#(= main_~p10~0 0)} assume !(0 != ~p7~0); {456755#(= main_~p10~0 0)} is VALID [2022-04-27 15:13:04,711 INFO L290 TraceCheckUtils]: 27: Hoare triple {456755#(= main_~p10~0 0)} assume !(0 != ~p8~0); {456755#(= main_~p10~0 0)} is VALID [2022-04-27 15:13:04,711 INFO L290 TraceCheckUtils]: 28: Hoare triple {456755#(= main_~p10~0 0)} assume !(0 != ~p9~0); {456755#(= main_~p10~0 0)} is VALID [2022-04-27 15:13:04,711 INFO L290 TraceCheckUtils]: 29: Hoare triple {456755#(= main_~p10~0 0)} assume 0 != ~p10~0; {456751#false} is VALID [2022-04-27 15:13:04,711 INFO L290 TraceCheckUtils]: 30: Hoare triple {456751#false} assume 1 != ~lk10~0; {456751#false} is VALID [2022-04-27 15:13:04,711 INFO L290 TraceCheckUtils]: 31: Hoare triple {456751#false} assume !false; {456751#false} is VALID [2022-04-27 15:13:04,712 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:13:04,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:13:04,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692672452] [2022-04-27 15:13:04,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692672452] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:13:04,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:13:04,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:13:04,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808125295] [2022-04-27 15:13:04,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:13:04,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 32 [2022-04-27 15:13:04,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:13:04,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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:13:04,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:13:04,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:13:04,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:13:04,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:13:04,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:13:04,729 INFO L87 Difference]: Start difference. First operand 17673 states and 23303 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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:14:35,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:14:35,721 INFO L93 Difference]: Finished difference Result 51469 states and 66825 transitions. [2022-04-27 15:14:35,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:14:35,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 32 [2022-04-27 15:14:35,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:14:35,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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:14:35,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 202 transitions. [2022-04-27 15:14:35,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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:14:35,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 202 transitions. [2022-04-27 15:14:35,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 202 transitions. [2022-04-27 15:14:35,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:15:08,233 INFO L225 Difference]: With dead ends: 51469 [2022-04-27 15:15:08,234 INFO L226 Difference]: Without dead ends: 34315 [2022-04-27 15:15:08,246 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:15:08,247 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 157 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:15:08,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 99 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:15:08,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34315 states. [2022-04-27 15:15:08,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34315 to 34313. [2022-04-27 15:15:08,671 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:15:08,702 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34315 states. Second operand has 34313 states, 34309 states have (on average 1.2685884170334314) internal successors, (43524), 34309 states have internal predecessors, (43524), 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:15:08,729 INFO L74 IsIncluded]: Start isIncluded. First operand 34315 states. Second operand has 34313 states, 34309 states have (on average 1.2685884170334314) internal successors, (43524), 34309 states have internal predecessors, (43524), 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:15:08,756 INFO L87 Difference]: Start difference. First operand 34315 states. Second operand has 34313 states, 34309 states have (on average 1.2685884170334314) internal successors, (43524), 34309 states have internal predecessors, (43524), 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:15:40,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:15:40,157 INFO L93 Difference]: Finished difference Result 34315 states and 43528 transitions. [2022-04-27 15:15:40,157 INFO L276 IsEmpty]: Start isEmpty. Operand 34315 states and 43528 transitions. [2022-04-27 15:15:40,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:15:40,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:15:40,202 INFO L74 IsIncluded]: Start isIncluded. First operand has 34313 states, 34309 states have (on average 1.2685884170334314) internal successors, (43524), 34309 states have internal predecessors, (43524), 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 34315 states. [2022-04-27 15:15:40,229 INFO L87 Difference]: Start difference. First operand has 34313 states, 34309 states have (on average 1.2685884170334314) internal successors, (43524), 34309 states have internal predecessors, (43524), 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 34315 states. [2022-04-27 15:16:13,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:16:13,797 INFO L93 Difference]: Finished difference Result 34315 states and 43528 transitions. [2022-04-27 15:16:13,798 INFO L276 IsEmpty]: Start isEmpty. Operand 34315 states and 43528 transitions. [2022-04-27 15:16:13,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:16:13,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:16:13,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:16:13,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:16:13,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34313 states, 34309 states have (on average 1.2685884170334314) internal successors, (43524), 34309 states have internal predecessors, (43524), 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:16:47,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34313 states to 34313 states and 43527 transitions. [2022-04-27 15:16:47,978 INFO L78 Accepts]: Start accepts. Automaton has 34313 states and 43527 transitions. Word has length 32 [2022-04-27 15:16:47,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:16:47,978 INFO L495 AbstractCegarLoop]: Abstraction has 34313 states and 43527 transitions. [2022-04-27 15:16:47,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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:16:47,979 INFO L276 IsEmpty]: Start isEmpty. Operand 34313 states and 43527 transitions. [2022-04-27 15:16:47,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 15:16:47,995 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:16:47,995 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:16:47,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-27 15:16:47,995 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:16:47,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:16:47,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1333294572, now seen corresponding path program 1 times [2022-04-27 15:16:47,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:16:47,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946452716] [2022-04-27 15:16:47,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:16:47,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:16:48,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:16:48,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:16:48,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:16:48,030 INFO L290 TraceCheckUtils]: 0: Hoare triple {613754#(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(16, 2);call #Ultimate.allocInit(12, 3); {613748#true} is VALID [2022-04-27 15:16:48,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {613748#true} assume true; {613748#true} is VALID [2022-04-27 15:16:48,031 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {613748#true} {613748#true} #234#return; {613748#true} is VALID [2022-04-27 15:16:48,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {613748#true} call ULTIMATE.init(); {613754#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:16:48,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {613754#(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(16, 2);call #Ultimate.allocInit(12, 3); {613748#true} is VALID [2022-04-27 15:16:48,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {613748#true} assume true; {613748#true} is VALID [2022-04-27 15:16:48,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {613748#true} {613748#true} #234#return; {613748#true} is VALID [2022-04-27 15:16:48,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {613748#true} call #t~ret17 := main(); {613748#true} is VALID [2022-04-27 15:16:48,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {613748#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {613748#true} is VALID [2022-04-27 15:16:48,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {613748#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {613748#true} is VALID [2022-04-27 15:16:48,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {613748#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {613748#true} is VALID [2022-04-27 15:16:48,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {613748#true} assume !(0 != ~p1~0); {613748#true} is VALID [2022-04-27 15:16:48,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {613748#true} assume !(0 != ~p2~0); {613748#true} is VALID [2022-04-27 15:16:48,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {613748#true} assume !(0 != ~p3~0); {613748#true} is VALID [2022-04-27 15:16:48,032 INFO L290 TraceCheckUtils]: 11: Hoare triple {613748#true} assume !(0 != ~p4~0); {613748#true} is VALID [2022-04-27 15:16:48,032 INFO L290 TraceCheckUtils]: 12: Hoare triple {613748#true} assume !(0 != ~p5~0); {613748#true} is VALID [2022-04-27 15:16:48,032 INFO L290 TraceCheckUtils]: 13: Hoare triple {613748#true} assume !(0 != ~p6~0); {613748#true} is VALID [2022-04-27 15:16:48,032 INFO L290 TraceCheckUtils]: 14: Hoare triple {613748#true} assume !(0 != ~p7~0); {613748#true} is VALID [2022-04-27 15:16:48,032 INFO L290 TraceCheckUtils]: 15: Hoare triple {613748#true} assume !(0 != ~p8~0); {613748#true} is VALID [2022-04-27 15:16:48,032 INFO L290 TraceCheckUtils]: 16: Hoare triple {613748#true} assume !(0 != ~p9~0); {613748#true} is VALID [2022-04-27 15:16:48,032 INFO L290 TraceCheckUtils]: 17: Hoare triple {613748#true} assume 0 != ~p10~0;~lk10~0 := 1; {613753#(= main_~lk10~0 1)} is VALID [2022-04-27 15:16:48,032 INFO L290 TraceCheckUtils]: 18: Hoare triple {613753#(= main_~lk10~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {613753#(= main_~lk10~0 1)} is VALID [2022-04-27 15:16:48,033 INFO L290 TraceCheckUtils]: 19: Hoare triple {613753#(= main_~lk10~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {613753#(= main_~lk10~0 1)} is VALID [2022-04-27 15:16:48,033 INFO L290 TraceCheckUtils]: 20: Hoare triple {613753#(= main_~lk10~0 1)} assume !(0 != ~p1~0); {613753#(= main_~lk10~0 1)} is VALID [2022-04-27 15:16:48,033 INFO L290 TraceCheckUtils]: 21: Hoare triple {613753#(= main_~lk10~0 1)} assume !(0 != ~p2~0); {613753#(= main_~lk10~0 1)} is VALID [2022-04-27 15:16:48,033 INFO L290 TraceCheckUtils]: 22: Hoare triple {613753#(= main_~lk10~0 1)} assume !(0 != ~p3~0); {613753#(= main_~lk10~0 1)} is VALID [2022-04-27 15:16:48,034 INFO L290 TraceCheckUtils]: 23: Hoare triple {613753#(= main_~lk10~0 1)} assume !(0 != ~p4~0); {613753#(= main_~lk10~0 1)} is VALID [2022-04-27 15:16:48,034 INFO L290 TraceCheckUtils]: 24: Hoare triple {613753#(= main_~lk10~0 1)} assume !(0 != ~p5~0); {613753#(= main_~lk10~0 1)} is VALID [2022-04-27 15:16:48,034 INFO L290 TraceCheckUtils]: 25: Hoare triple {613753#(= main_~lk10~0 1)} assume !(0 != ~p6~0); {613753#(= main_~lk10~0 1)} is VALID [2022-04-27 15:16:48,034 INFO L290 TraceCheckUtils]: 26: Hoare triple {613753#(= main_~lk10~0 1)} assume !(0 != ~p7~0); {613753#(= main_~lk10~0 1)} is VALID [2022-04-27 15:16:48,035 INFO L290 TraceCheckUtils]: 27: Hoare triple {613753#(= main_~lk10~0 1)} assume !(0 != ~p8~0); {613753#(= main_~lk10~0 1)} is VALID [2022-04-27 15:16:48,035 INFO L290 TraceCheckUtils]: 28: Hoare triple {613753#(= main_~lk10~0 1)} assume !(0 != ~p9~0); {613753#(= main_~lk10~0 1)} is VALID [2022-04-27 15:16:48,035 INFO L290 TraceCheckUtils]: 29: Hoare triple {613753#(= main_~lk10~0 1)} assume 0 != ~p10~0; {613753#(= main_~lk10~0 1)} is VALID [2022-04-27 15:16:48,035 INFO L290 TraceCheckUtils]: 30: Hoare triple {613753#(= main_~lk10~0 1)} assume 1 != ~lk10~0; {613749#false} is VALID [2022-04-27 15:16:48,035 INFO L290 TraceCheckUtils]: 31: Hoare triple {613749#false} assume !false; {613749#false} is VALID [2022-04-27 15:16:48,036 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:16:48,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:16:48,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946452716] [2022-04-27 15:16:48,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946452716] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:16:48,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:16:48,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:16:48,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622295035] [2022-04-27 15:16:48,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:16:48,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 32 [2022-04-27 15:16:48,040 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:16:48,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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:16:48,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:16:48,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:16:48,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:16:48,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:16:48,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:16:48,058 INFO L87 Difference]: Start difference. First operand 34313 states and 43527 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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:17:33,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:17:33,561 INFO L93 Difference]: Finished difference Result 37389 states and 48649 transitions. [2022-04-27 15:17:33,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:17:33,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 32 [2022-04-27 15:17:33,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:17:33,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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:17:33,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2022-04-27 15:17:33,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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:17:33,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2022-04-27 15:17:33,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 116 transitions. [2022-04-27 15:17:33,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:18:13,412 INFO L225 Difference]: With dead ends: 37389 [2022-04-27 15:18:13,413 INFO L226 Difference]: Without dead ends: 37387 [2022-04-27 15:18:13,417 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:18:13,418 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 96 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:18:13,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 120 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:18:13,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37387 states. [2022-04-27 15:18:13,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37387 to 34313. [2022-04-27 15:18:13,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:18:13,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37387 states. Second operand has 34313 states, 34309 states have (on average 1.2536652190387363) internal successors, (43012), 34309 states have internal predecessors, (43012), 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:18:13,856 INFO L74 IsIncluded]: Start isIncluded. First operand 37387 states. Second operand has 34313 states, 34309 states have (on average 1.2536652190387363) internal successors, (43012), 34309 states have internal predecessors, (43012), 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:18:13,891 INFO L87 Difference]: Start difference. First operand 37387 states. Second operand has 34313 states, 34309 states have (on average 1.2536652190387363) internal successors, (43012), 34309 states have internal predecessors, (43012), 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:18:51,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:18:51,953 INFO L93 Difference]: Finished difference Result 37387 states and 48136 transitions. [2022-04-27 15:18:51,953 INFO L276 IsEmpty]: Start isEmpty. Operand 37387 states and 48136 transitions. [2022-04-27 15:18:51,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:18:51,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:18:52,009 INFO L74 IsIncluded]: Start isIncluded. First operand has 34313 states, 34309 states have (on average 1.2536652190387363) internal successors, (43012), 34309 states have internal predecessors, (43012), 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 37387 states. [2022-04-27 15:18:52,043 INFO L87 Difference]: Start difference. First operand has 34313 states, 34309 states have (on average 1.2536652190387363) internal successors, (43012), 34309 states have internal predecessors, (43012), 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 37387 states. [2022-04-27 15:19:30,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:19:30,504 INFO L93 Difference]: Finished difference Result 37387 states and 48136 transitions. [2022-04-27 15:19:30,504 INFO L276 IsEmpty]: Start isEmpty. Operand 37387 states and 48136 transitions. [2022-04-27 15:19:30,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:19:30,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:19:30,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:19:30,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:19:30,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34313 states, 34309 states have (on average 1.2536652190387363) internal successors, (43012), 34309 states have internal predecessors, (43012), 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:20:07,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34313 states to 34313 states and 43015 transitions. [2022-04-27 15:20:07,157 INFO L78 Accepts]: Start accepts. Automaton has 34313 states and 43015 transitions. Word has length 32 [2022-04-27 15:20:07,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:20:07,157 INFO L495 AbstractCegarLoop]: Abstraction has 34313 states and 43015 transitions. [2022-04-27 15:20:07,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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:20:07,157 INFO L276 IsEmpty]: Start isEmpty. Operand 34313 states and 43015 transitions. [2022-04-27 15:20:07,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 15:20:07,169 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:20:07,169 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:20:07,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-27 15:20:07,170 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:20:07,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:20:07,170 INFO L85 PathProgramCache]: Analyzing trace with hash 596688678, now seen corresponding path program 1 times [2022-04-27 15:20:07,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:20:07,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944606293] [2022-04-27 15:20:07,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:20:07,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:20:07,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:20:07,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:20:07,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:20:07,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {762816#(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(16, 2);call #Ultimate.allocInit(12, 3); {762810#true} is VALID [2022-04-27 15:20:07,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {762810#true} assume true; {762810#true} is VALID [2022-04-27 15:20:07,200 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {762810#true} {762810#true} #234#return; {762810#true} is VALID [2022-04-27 15:20:07,200 INFO L272 TraceCheckUtils]: 0: Hoare triple {762810#true} call ULTIMATE.init(); {762816#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:20:07,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {762816#(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(16, 2);call #Ultimate.allocInit(12, 3); {762810#true} is VALID [2022-04-27 15:20:07,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {762810#true} assume true; {762810#true} is VALID [2022-04-27 15:20:07,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {762810#true} {762810#true} #234#return; {762810#true} is VALID [2022-04-27 15:20:07,201 INFO L272 TraceCheckUtils]: 4: Hoare triple {762810#true} call #t~ret17 := main(); {762810#true} is VALID [2022-04-27 15:20:07,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {762810#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {762810#true} is VALID [2022-04-27 15:20:07,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {762810#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {762810#true} is VALID [2022-04-27 15:20:07,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {762810#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {762810#true} is VALID [2022-04-27 15:20:07,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {762810#true} assume !(0 != ~p1~0); {762810#true} is VALID [2022-04-27 15:20:07,201 INFO L290 TraceCheckUtils]: 9: Hoare triple {762810#true} assume !(0 != ~p2~0); {762810#true} is VALID [2022-04-27 15:20:07,201 INFO L290 TraceCheckUtils]: 10: Hoare triple {762810#true} assume !(0 != ~p3~0); {762810#true} is VALID [2022-04-27 15:20:07,201 INFO L290 TraceCheckUtils]: 11: Hoare triple {762810#true} assume !(0 != ~p4~0); {762810#true} is VALID [2022-04-27 15:20:07,201 INFO L290 TraceCheckUtils]: 12: Hoare triple {762810#true} assume !(0 != ~p5~0); {762810#true} is VALID [2022-04-27 15:20:07,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {762810#true} assume !(0 != ~p6~0); {762810#true} is VALID [2022-04-27 15:20:07,201 INFO L290 TraceCheckUtils]: 14: Hoare triple {762810#true} assume !(0 != ~p7~0); {762810#true} is VALID [2022-04-27 15:20:07,201 INFO L290 TraceCheckUtils]: 15: Hoare triple {762810#true} assume !(0 != ~p8~0); {762810#true} is VALID [2022-04-27 15:20:07,201 INFO L290 TraceCheckUtils]: 16: Hoare triple {762810#true} assume !(0 != ~p9~0); {762810#true} is VALID [2022-04-27 15:20:07,202 INFO L290 TraceCheckUtils]: 17: Hoare triple {762810#true} assume !(0 != ~p10~0); {762810#true} is VALID [2022-04-27 15:20:07,202 INFO L290 TraceCheckUtils]: 18: Hoare triple {762810#true} assume 0 != ~p11~0;~lk11~0 := 1; {762815#(= main_~lk11~0 1)} is VALID [2022-04-27 15:20:07,202 INFO L290 TraceCheckUtils]: 19: Hoare triple {762815#(= main_~lk11~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {762815#(= main_~lk11~0 1)} is VALID [2022-04-27 15:20:07,202 INFO L290 TraceCheckUtils]: 20: Hoare triple {762815#(= main_~lk11~0 1)} assume !(0 != ~p1~0); {762815#(= main_~lk11~0 1)} is VALID [2022-04-27 15:20:07,202 INFO L290 TraceCheckUtils]: 21: Hoare triple {762815#(= main_~lk11~0 1)} assume !(0 != ~p2~0); {762815#(= main_~lk11~0 1)} is VALID [2022-04-27 15:20:07,203 INFO L290 TraceCheckUtils]: 22: Hoare triple {762815#(= main_~lk11~0 1)} assume !(0 != ~p3~0); {762815#(= main_~lk11~0 1)} is VALID [2022-04-27 15:20:07,203 INFO L290 TraceCheckUtils]: 23: Hoare triple {762815#(= main_~lk11~0 1)} assume !(0 != ~p4~0); {762815#(= main_~lk11~0 1)} is VALID [2022-04-27 15:20:07,203 INFO L290 TraceCheckUtils]: 24: Hoare triple {762815#(= main_~lk11~0 1)} assume !(0 != ~p5~0); {762815#(= main_~lk11~0 1)} is VALID [2022-04-27 15:20:07,204 INFO L290 TraceCheckUtils]: 25: Hoare triple {762815#(= main_~lk11~0 1)} assume !(0 != ~p6~0); {762815#(= main_~lk11~0 1)} is VALID [2022-04-27 15:20:07,204 INFO L290 TraceCheckUtils]: 26: Hoare triple {762815#(= main_~lk11~0 1)} assume !(0 != ~p7~0); {762815#(= main_~lk11~0 1)} is VALID [2022-04-27 15:20:07,204 INFO L290 TraceCheckUtils]: 27: Hoare triple {762815#(= main_~lk11~0 1)} assume !(0 != ~p8~0); {762815#(= main_~lk11~0 1)} is VALID [2022-04-27 15:20:07,204 INFO L290 TraceCheckUtils]: 28: Hoare triple {762815#(= main_~lk11~0 1)} assume !(0 != ~p9~0); {762815#(= main_~lk11~0 1)} is VALID [2022-04-27 15:20:07,205 INFO L290 TraceCheckUtils]: 29: Hoare triple {762815#(= main_~lk11~0 1)} assume !(0 != ~p10~0); {762815#(= main_~lk11~0 1)} is VALID [2022-04-27 15:20:07,205 INFO L290 TraceCheckUtils]: 30: Hoare triple {762815#(= main_~lk11~0 1)} assume 0 != ~p11~0; {762815#(= main_~lk11~0 1)} is VALID [2022-04-27 15:20:07,205 INFO L290 TraceCheckUtils]: 31: Hoare triple {762815#(= main_~lk11~0 1)} assume 1 != ~lk11~0; {762811#false} is VALID [2022-04-27 15:20:07,205 INFO L290 TraceCheckUtils]: 32: Hoare triple {762811#false} assume !false; {762811#false} is VALID [2022-04-27 15:20:07,205 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:20:07,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:20:07,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944606293] [2022-04-27 15:20:07,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944606293] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:20:07,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:20:07,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:20:07,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711917025] [2022-04-27 15:20:07,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:20:07,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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 33 [2022-04-27 15:20:07,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:20:07,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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:20:07,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:20:07,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:20:07,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:20:07,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:20:07,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:20:07,222 INFO L87 Difference]: Start difference. First operand 34313 states and 43015 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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:22:49,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:22:49,463 INFO L93 Difference]: Finished difference Result 56845 states and 71689 transitions. [2022-04-27 15:22:49,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:22:49,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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 33 [2022-04-27 15:22:49,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:22:49,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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:22:49,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-27 15:22:49,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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:22:49,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-27 15:22:49,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 115 transitions. [2022-04-27 15:22:49,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.