/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_13.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 08:16:03,616 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 08:16:03,617 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 08:16:03,649 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 08:16:03,649 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 08:16:03,650 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 08:16:03,651 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 08:16:03,653 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 08:16:03,664 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 08:16:03,665 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 08:16:03,666 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 08:16:03,667 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 08:16:03,667 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 08:16:03,668 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 08:16:03,669 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 08:16:03,671 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 08:16:03,672 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 08:16:03,676 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 08:16:03,692 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 08:16:03,693 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 08:16:03,694 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 08:16:03,694 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 08:16:03,695 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 08:16:03,695 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 08:16:03,696 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 08:16:03,698 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 08:16:03,698 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 08:16:03,698 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 08:16:03,699 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 08:16:03,699 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 08:16:03,700 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 08:16:03,700 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 08:16:03,701 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 08:16:03,702 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 08:16:03,702 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 08:16:03,703 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 08:16:03,703 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 08:16:03,704 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 08:16:03,704 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 08:16:03,704 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 08:16:03,705 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 08:16:03,706 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 08:16:03,707 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 08:16:03,714 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 08:16:03,715 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 08:16:03,716 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 08:16:03,716 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 08:16:03,716 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 08:16:03,716 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 08:16:03,716 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 08:16:03,716 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 08:16:03,717 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 08:16:03,717 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 08:16:03,717 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 08:16:03,717 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 08:16:03,717 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 08:16:03,717 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 08:16:03,717 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 08:16:03,717 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 08:16:03,718 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 08:16:03,718 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 08:16:03,718 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:16:03,718 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 08:16:03,718 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 08:16:03,718 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 08:16:03,718 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 08:16:03,718 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 08:16:03,719 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 08:16:03,719 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 08:16:03,909 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 08:16:03,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 08:16:03,940 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 08:16:03,941 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 08:16:03,942 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 08:16:03,942 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_13.c [2022-04-28 08:16:03,983 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aca5642da/152867b4127a4537a984342f6366e656/FLAG72a759dcf [2022-04-28 08:16:04,282 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 08:16:04,282 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_13.c [2022-04-28 08:16:04,290 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aca5642da/152867b4127a4537a984342f6366e656/FLAG72a759dcf [2022-04-28 08:16:04,706 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aca5642da/152867b4127a4537a984342f6366e656 [2022-04-28 08:16:04,707 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 08:16:04,708 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 08:16:04,711 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 08:16:04,711 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 08:16:04,714 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 08:16:04,714 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:16:04" (1/1) ... [2022-04-28 08:16:04,715 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69da9afe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:16:04, skipping insertion in model container [2022-04-28 08:16:04,715 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:16:04" (1/1) ... [2022-04-28 08:16:04,721 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 08:16:04,735 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 08:16:04,856 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_13.c[4936,4949] [2022-04-28 08:16:04,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:16:04,863 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 08:16:04,883 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_13.c[4936,4949] [2022-04-28 08:16:04,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:16:04,894 INFO L208 MainTranslator]: Completed translation [2022-04-28 08:16:04,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:16:04 WrapperNode [2022-04-28 08:16:04,894 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 08:16:04,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 08:16:04,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 08:16:04,895 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 08:16:04,901 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:16:04" (1/1) ... [2022-04-28 08:16:04,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:16:04" (1/1) ... [2022-04-28 08:16:04,905 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:16:04" (1/1) ... [2022-04-28 08:16:04,905 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:16:04" (1/1) ... [2022-04-28 08:16:04,910 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:16:04" (1/1) ... [2022-04-28 08:16:04,925 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:16:04" (1/1) ... [2022-04-28 08:16:04,926 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:16:04" (1/1) ... [2022-04-28 08:16:04,927 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 08:16:04,928 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 08:16:04,928 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 08:16:04,928 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 08:16:04,935 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:16:04" (1/1) ... [2022-04-28 08:16:04,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:16:04,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:16:04,959 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-28 08:16:04,981 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-28 08:16:04,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 08:16:04,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 08:16:04,996 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 08:16:04,996 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 08:16:04,996 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 08:16:04,996 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 08:16:04,996 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 08:16:04,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 08:16:04,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 08:16:04,996 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 08:16:04,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 08:16:04,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 08:16:04,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 08:16:04,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 08:16:04,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 08:16:04,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 08:16:05,051 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 08:16:05,052 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 08:16:05,287 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 08:16:05,292 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 08:16:05,292 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 08:16:05,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:16:05 BoogieIcfgContainer [2022-04-28 08:16:05,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 08:16:05,294 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 08:16:05,295 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 08:16:05,297 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 08:16:05,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 08:16:04" (1/3) ... [2022-04-28 08:16:05,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66ef33b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:16:05, skipping insertion in model container [2022-04-28 08:16:05,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:16:04" (2/3) ... [2022-04-28 08:16:05,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66ef33b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:16:05, skipping insertion in model container [2022-04-28 08:16:05,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:16:05" (3/3) ... [2022-04-28 08:16:05,298 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_13.c [2022-04-28 08:16:05,307 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 08:16:05,307 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 08:16:05,340 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 08:16:05,346 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3575634, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7448290f [2022-04-28 08:16:05,346 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 08:16:05,368 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 49 states have internal predecessors, (91), 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-28 08:16:05,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 08:16:05,373 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:05,374 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-28 08:16:05,374 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:05,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:05,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1751582771, now seen corresponding path program 1 times [2022-04-28 08:16:05,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:05,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1640378183] [2022-04-28 08:16:05,397 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:05,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1751582771, now seen corresponding path program 2 times [2022-04-28 08:16:05,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:05,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995007801] [2022-04-28 08:16:05,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:05,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:05,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:05,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:05,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:05,652 INFO L290 TraceCheckUtils]: 0: Hoare triple {63#(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); {57#true} is VALID [2022-04-28 08:16:05,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {57#true} assume true; {57#true} is VALID [2022-04-28 08:16:05,653 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57#true} {57#true} #251#return; {57#true} is VALID [2022-04-28 08:16:05,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {57#true} call ULTIMATE.init(); {63#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:05,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {63#(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); {57#true} is VALID [2022-04-28 08:16:05,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {57#true} assume true; {57#true} is VALID [2022-04-28 08:16:05,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57#true} {57#true} #251#return; {57#true} is VALID [2022-04-28 08:16:05,656 INFO L272 TraceCheckUtils]: 4: Hoare triple {57#true} call #t~ret18 := main(); {57#true} is VALID [2022-04-28 08:16:05,657 INFO L290 TraceCheckUtils]: 5: Hoare triple {57#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {57#true} is VALID [2022-04-28 08:16:05,657 INFO L290 TraceCheckUtils]: 6: Hoare triple {57#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {57#true} is VALID [2022-04-28 08:16:05,657 INFO L290 TraceCheckUtils]: 7: Hoare triple {57#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {57#true} is VALID [2022-04-28 08:16:05,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {57#true} assume 0 != ~p1~0;~lk1~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:05,658 INFO L290 TraceCheckUtils]: 9: Hoare triple {62#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {62#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:05,659 INFO L290 TraceCheckUtils]: 10: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:05,660 INFO L290 TraceCheckUtils]: 11: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:05,661 INFO L290 TraceCheckUtils]: 12: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:05,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:05,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:05,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:05,663 INFO L290 TraceCheckUtils]: 16: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:05,664 INFO L290 TraceCheckUtils]: 17: Hoare triple {62#(= main_~lk1~0 1)} assume !(0 != ~p10~0); {62#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:05,664 INFO L290 TraceCheckUtils]: 18: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:05,666 INFO L290 TraceCheckUtils]: 19: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:05,666 INFO L290 TraceCheckUtils]: 20: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:05,667 INFO L290 TraceCheckUtils]: 21: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p1~0; {62#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:05,667 INFO L290 TraceCheckUtils]: 22: Hoare triple {62#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {58#false} is VALID [2022-04-28 08:16:05,667 INFO L290 TraceCheckUtils]: 23: Hoare triple {58#false} assume !false; {58#false} is VALID [2022-04-28 08:16:05,668 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-28 08:16:05,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:05,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995007801] [2022-04-28 08:16:05,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995007801] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:05,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:05,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:05,672 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:05,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1640378183] [2022-04-28 08:16:05,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1640378183] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:05,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:05,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:05,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203718095] [2022-04-28 08:16:05,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:05,677 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-28 08:16:05,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:05,681 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-28 08:16:05,706 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-28 08:16:05,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:05,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:05,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:05,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:05,729 INFO L87 Difference]: Start difference. First operand has 54 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 49 states have internal predecessors, (91), 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.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-28 08:16:06,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:06,119 INFO L93 Difference]: Finished difference Result 106 states and 187 transitions. [2022-04-28 08:16:06,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:06,121 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-28 08:16:06,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:06,122 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-28 08:16:06,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2022-04-28 08:16:06,135 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-28 08:16:06,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2022-04-28 08:16:06,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 187 transitions. [2022-04-28 08:16:06,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:06,285 INFO L225 Difference]: With dead ends: 106 [2022-04-28 08:16:06,285 INFO L226 Difference]: Without dead ends: 91 [2022-04-28 08:16:06,287 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-28 08:16:06,289 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 225 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:06,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 107 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:16:06,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-28 08:16:06,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 63. [2022-04-28 08:16:06,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:06,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 63 states, 59 states have (on average 1.88135593220339) internal successors, (111), 59 states have internal predecessors, (111), 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-28 08:16:06,315 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 63 states, 59 states have (on average 1.88135593220339) internal successors, (111), 59 states have internal predecessors, (111), 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-28 08:16:06,315 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 63 states, 59 states have (on average 1.88135593220339) internal successors, (111), 59 states have internal predecessors, (111), 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-28 08:16:06,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:06,319 INFO L93 Difference]: Finished difference Result 91 states and 165 transitions. [2022-04-28 08:16:06,319 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 165 transitions. [2022-04-28 08:16:06,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:06,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:06,321 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 59 states have (on average 1.88135593220339) internal successors, (111), 59 states have internal predecessors, (111), 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 91 states. [2022-04-28 08:16:06,321 INFO L87 Difference]: Start difference. First operand has 63 states, 59 states have (on average 1.88135593220339) internal successors, (111), 59 states have internal predecessors, (111), 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 91 states. [2022-04-28 08:16:06,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:06,328 INFO L93 Difference]: Finished difference Result 91 states and 165 transitions. [2022-04-28 08:16:06,328 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 165 transitions. [2022-04-28 08:16:06,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:06,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:06,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:06,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:06,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 59 states have (on average 1.88135593220339) internal successors, (111), 59 states have internal predecessors, (111), 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-28 08:16:06,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 114 transitions. [2022-04-28 08:16:06,340 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 114 transitions. Word has length 24 [2022-04-28 08:16:06,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:06,340 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 114 transitions. [2022-04-28 08:16:06,340 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-28 08:16:06,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 114 transitions. [2022-04-28 08:16:06,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:06,440 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 114 transitions. [2022-04-28 08:16:06,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 08:16:06,445 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:06,445 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-28 08:16:06,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 08:16:06,446 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:06,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:06,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1522316171, now seen corresponding path program 1 times [2022-04-28 08:16:06,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:06,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [383019220] [2022-04-28 08:16:06,447 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:06,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1522316171, now seen corresponding path program 2 times [2022-04-28 08:16:06,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:06,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923846952] [2022-04-28 08:16:06,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:06,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:06,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:06,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:06,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {595#(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); {589#true} is VALID [2022-04-28 08:16:06,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {589#true} assume true; {589#true} is VALID [2022-04-28 08:16:06,536 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {589#true} {589#true} #251#return; {589#true} is VALID [2022-04-28 08:16:06,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {589#true} call ULTIMATE.init(); {595#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:06,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {595#(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); {589#true} is VALID [2022-04-28 08:16:06,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {589#true} assume true; {589#true} is VALID [2022-04-28 08:16:06,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {589#true} {589#true} #251#return; {589#true} is VALID [2022-04-28 08:16:06,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {589#true} call #t~ret18 := main(); {589#true} is VALID [2022-04-28 08:16:06,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {589#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {589#true} is VALID [2022-04-28 08:16:06,538 INFO L290 TraceCheckUtils]: 6: Hoare triple {589#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {589#true} is VALID [2022-04-28 08:16:06,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {589#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {589#true} is VALID [2022-04-28 08:16:06,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {589#true} assume !(0 != ~p1~0); {594#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:06,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {594#(= main_~p1~0 0)} assume !(0 != ~p2~0); {594#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:06,539 INFO L290 TraceCheckUtils]: 10: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {594#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:06,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {594#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:06,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {594#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:06,540 INFO L290 TraceCheckUtils]: 13: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {594#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:06,541 INFO L290 TraceCheckUtils]: 14: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {594#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:06,541 INFO L290 TraceCheckUtils]: 15: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {594#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:06,541 INFO L290 TraceCheckUtils]: 16: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {594#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:06,542 INFO L290 TraceCheckUtils]: 17: Hoare triple {594#(= main_~p1~0 0)} assume !(0 != ~p10~0); {594#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:06,542 INFO L290 TraceCheckUtils]: 18: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {594#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:06,542 INFO L290 TraceCheckUtils]: 19: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {594#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:06,543 INFO L290 TraceCheckUtils]: 20: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {594#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:06,543 INFO L290 TraceCheckUtils]: 21: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p1~0; {590#false} is VALID [2022-04-28 08:16:06,543 INFO L290 TraceCheckUtils]: 22: Hoare triple {590#false} assume 1 != ~lk1~0; {590#false} is VALID [2022-04-28 08:16:06,543 INFO L290 TraceCheckUtils]: 23: Hoare triple {590#false} assume !false; {590#false} is VALID [2022-04-28 08:16:06,544 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-28 08:16:06,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:06,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923846952] [2022-04-28 08:16:06,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923846952] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:06,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:06,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:06,544 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:06,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [383019220] [2022-04-28 08:16:06,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [383019220] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:06,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:06,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:06,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117099904] [2022-04-28 08:16:06,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:06,546 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-28 08:16:06,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:06,546 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-28 08:16:06,563 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-28 08:16:06,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:06,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:06,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:06,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:06,564 INFO L87 Difference]: Start difference. First operand 63 states and 114 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-28 08:16:06,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:06,808 INFO L93 Difference]: Finished difference Result 148 states and 273 transitions. [2022-04-28 08:16:06,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:06,808 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-28 08:16:06,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:06,809 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-28 08:16:06,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 246 transitions. [2022-04-28 08:16:06,812 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-28 08:16:06,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 246 transitions. [2022-04-28 08:16:06,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 246 transitions. [2022-04-28 08:16:06,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 246 edges. 246 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:07,001 INFO L225 Difference]: With dead ends: 148 [2022-04-28 08:16:07,001 INFO L226 Difference]: Without dead ends: 91 [2022-04-28 08:16:07,001 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-28 08:16:07,002 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 193 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:07,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 119 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:16:07,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-28 08:16:07,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2022-04-28 08:16:07,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:07,013 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 89 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 85 states have internal predecessors, (159), 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-28 08:16:07,013 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 89 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 85 states have internal predecessors, (159), 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-28 08:16:07,014 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 89 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 85 states have internal predecessors, (159), 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-28 08:16:07,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:07,016 INFO L93 Difference]: Finished difference Result 91 states and 163 transitions. [2022-04-28 08:16:07,016 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 163 transitions. [2022-04-28 08:16:07,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:07,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:07,017 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 85 states have internal predecessors, (159), 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 91 states. [2022-04-28 08:16:07,018 INFO L87 Difference]: Start difference. First operand has 89 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 85 states have internal predecessors, (159), 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 91 states. [2022-04-28 08:16:07,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:07,020 INFO L93 Difference]: Finished difference Result 91 states and 163 transitions. [2022-04-28 08:16:07,020 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 163 transitions. [2022-04-28 08:16:07,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:07,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:07,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:07,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:07,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 85 states have internal predecessors, (159), 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-28 08:16:07,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 162 transitions. [2022-04-28 08:16:07,024 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 162 transitions. Word has length 24 [2022-04-28 08:16:07,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:07,024 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 162 transitions. [2022-04-28 08:16:07,024 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-28 08:16:07,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 162 transitions. [2022-04-28 08:16:07,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:07,168 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 162 transitions. [2022-04-28 08:16:07,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 08:16:07,169 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16: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] [2022-04-28 08:16:07,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 08:16:07,172 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:07,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:07,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1535721358, now seen corresponding path program 1 times [2022-04-28 08:16:07,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:07,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [816704876] [2022-04-28 08:16:07,178 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:07,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1535721358, now seen corresponding path program 2 times [2022-04-28 08:16:07,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:07,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959654443] [2022-04-28 08:16:07,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:07,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:07,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:07,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:07,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:07,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {1263#(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); {1257#true} is VALID [2022-04-28 08:16:07,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {1257#true} assume true; {1257#true} is VALID [2022-04-28 08:16:07,266 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1257#true} {1257#true} #251#return; {1257#true} is VALID [2022-04-28 08:16:07,266 INFO L272 TraceCheckUtils]: 0: Hoare triple {1257#true} call ULTIMATE.init(); {1263#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:07,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {1263#(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); {1257#true} is VALID [2022-04-28 08:16:07,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {1257#true} assume true; {1257#true} is VALID [2022-04-28 08:16:07,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1257#true} {1257#true} #251#return; {1257#true} is VALID [2022-04-28 08:16:07,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {1257#true} call #t~ret18 := main(); {1257#true} is VALID [2022-04-28 08:16:07,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {1257#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {1257#true} is VALID [2022-04-28 08:16:07,267 INFO L290 TraceCheckUtils]: 6: Hoare triple {1257#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {1257#true} is VALID [2022-04-28 08:16:07,267 INFO L290 TraceCheckUtils]: 7: Hoare triple {1257#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {1257#true} is VALID [2022-04-28 08:16:07,267 INFO L290 TraceCheckUtils]: 8: Hoare triple {1257#true} assume 0 != ~p1~0;~lk1~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:07,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {1262#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {1262#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:07,268 INFO L290 TraceCheckUtils]: 10: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:07,268 INFO L290 TraceCheckUtils]: 11: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:07,268 INFO L290 TraceCheckUtils]: 12: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:07,269 INFO L290 TraceCheckUtils]: 13: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:07,269 INFO L290 TraceCheckUtils]: 14: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:07,269 INFO L290 TraceCheckUtils]: 15: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:07,270 INFO L290 TraceCheckUtils]: 16: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:07,270 INFO L290 TraceCheckUtils]: 17: Hoare triple {1262#(not (= main_~p1~0 0))} assume !(0 != ~p10~0); {1262#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:07,270 INFO L290 TraceCheckUtils]: 18: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:07,270 INFO L290 TraceCheckUtils]: 19: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:07,271 INFO L290 TraceCheckUtils]: 20: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:07,271 INFO L290 TraceCheckUtils]: 21: Hoare triple {1262#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {1258#false} is VALID [2022-04-28 08:16:07,271 INFO L290 TraceCheckUtils]: 22: Hoare triple {1258#false} assume 0 != ~p2~0; {1258#false} is VALID [2022-04-28 08:16:07,271 INFO L290 TraceCheckUtils]: 23: Hoare triple {1258#false} assume 1 != ~lk2~0; {1258#false} is VALID [2022-04-28 08:16:07,271 INFO L290 TraceCheckUtils]: 24: Hoare triple {1258#false} assume !false; {1258#false} is VALID [2022-04-28 08:16:07,272 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-28 08:16:07,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:07,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959654443] [2022-04-28 08:16:07,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959654443] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:07,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:07,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:07,272 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:07,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [816704876] [2022-04-28 08:16:07,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [816704876] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:07,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:07,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:07,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961028780] [2022-04-28 08:16:07,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:07,273 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-28 08:16:07,273 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:07,273 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-28 08:16:07,287 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-28 08:16:07,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:07,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:07,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:07,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:07,288 INFO L87 Difference]: Start difference. First operand 89 states and 162 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-28 08:16:07,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:07,482 INFO L93 Difference]: Finished difference Result 136 states and 244 transitions. [2022-04-28 08:16:07,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:07,482 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-28 08:16:07,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:07,483 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-28 08:16:07,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 241 transitions. [2022-04-28 08:16:07,485 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-28 08:16:07,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 241 transitions. [2022-04-28 08:16:07,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 241 transitions. [2022-04-28 08:16:07,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 241 edges. 241 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:07,642 INFO L225 Difference]: With dead ends: 136 [2022-04-28 08:16:07,642 INFO L226 Difference]: Without dead ends: 94 [2022-04-28 08:16:07,642 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-28 08:16:07,643 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 170 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:07,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 143 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:16:07,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-28 08:16:07,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2022-04-28 08:16:07,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:07,654 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 92 states, 88 states have (on average 1.8295454545454546) internal successors, (161), 88 states have internal predecessors, (161), 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-28 08:16:07,654 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 92 states, 88 states have (on average 1.8295454545454546) internal successors, (161), 88 states have internal predecessors, (161), 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-28 08:16:07,655 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 92 states, 88 states have (on average 1.8295454545454546) internal successors, (161), 88 states have internal predecessors, (161), 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-28 08:16:07,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:07,657 INFO L93 Difference]: Finished difference Result 94 states and 165 transitions. [2022-04-28 08:16:07,657 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 165 transitions. [2022-04-28 08:16:07,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:07,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:07,658 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 88 states have (on average 1.8295454545454546) internal successors, (161), 88 states have internal predecessors, (161), 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 94 states. [2022-04-28 08:16:07,658 INFO L87 Difference]: Start difference. First operand has 92 states, 88 states have (on average 1.8295454545454546) internal successors, (161), 88 states have internal predecessors, (161), 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 94 states. [2022-04-28 08:16:07,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:07,661 INFO L93 Difference]: Finished difference Result 94 states and 165 transitions. [2022-04-28 08:16:07,661 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 165 transitions. [2022-04-28 08:16:07,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:07,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:07,661 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:07,661 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:07,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 88 states have (on average 1.8295454545454546) internal successors, (161), 88 states have internal predecessors, (161), 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-28 08:16:07,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 164 transitions. [2022-04-28 08:16:07,668 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 164 transitions. Word has length 25 [2022-04-28 08:16:07,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:07,668 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 164 transitions. [2022-04-28 08:16:07,668 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-28 08:16:07,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 164 transitions. [2022-04-28 08:16:07,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:07,794 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 164 transitions. [2022-04-28 08:16:07,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 08:16:07,795 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:07,795 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-28 08:16:07,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 08:16:07,795 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:07,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:07,795 INFO L85 PathProgramCache]: Analyzing trace with hash -52626544, now seen corresponding path program 1 times [2022-04-28 08:16:07,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:07,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1929059109] [2022-04-28 08:16:07,796 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:07,796 INFO L85 PathProgramCache]: Analyzing trace with hash -52626544, now seen corresponding path program 2 times [2022-04-28 08:16:07,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:07,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417195256] [2022-04-28 08:16:07,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:07,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:07,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:07,836 INFO L290 TraceCheckUtils]: 0: Hoare triple {1919#(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); {1913#true} is VALID [2022-04-28 08:16:07,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {1913#true} assume true; {1913#true} is VALID [2022-04-28 08:16:07,836 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1913#true} {1913#true} #251#return; {1913#true} is VALID [2022-04-28 08:16:07,836 INFO L272 TraceCheckUtils]: 0: Hoare triple {1913#true} call ULTIMATE.init(); {1919#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:07,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {1919#(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); {1913#true} is VALID [2022-04-28 08:16:07,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {1913#true} assume true; {1913#true} is VALID [2022-04-28 08:16:07,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1913#true} {1913#true} #251#return; {1913#true} is VALID [2022-04-28 08:16:07,837 INFO L272 TraceCheckUtils]: 4: Hoare triple {1913#true} call #t~ret18 := main(); {1913#true} is VALID [2022-04-28 08:16:07,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {1913#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {1913#true} is VALID [2022-04-28 08:16:07,837 INFO L290 TraceCheckUtils]: 6: Hoare triple {1913#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {1913#true} is VALID [2022-04-28 08:16:07,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {1913#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {1913#true} is VALID [2022-04-28 08:16:07,837 INFO L290 TraceCheckUtils]: 8: Hoare triple {1913#true} assume !(0 != ~p1~0); {1913#true} is VALID [2022-04-28 08:16:07,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {1913#true} assume !(0 != ~p2~0); {1918#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:07,838 INFO L290 TraceCheckUtils]: 10: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1918#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:07,838 INFO L290 TraceCheckUtils]: 11: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1918#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:07,838 INFO L290 TraceCheckUtils]: 12: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1918#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:07,839 INFO L290 TraceCheckUtils]: 13: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1918#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:07,839 INFO L290 TraceCheckUtils]: 14: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {1918#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:07,839 INFO L290 TraceCheckUtils]: 15: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {1918#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:07,840 INFO L290 TraceCheckUtils]: 16: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {1918#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:07,840 INFO L290 TraceCheckUtils]: 17: Hoare triple {1918#(= main_~p2~0 0)} assume !(0 != ~p10~0); {1918#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:07,840 INFO L290 TraceCheckUtils]: 18: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {1918#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:07,840 INFO L290 TraceCheckUtils]: 19: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {1918#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:07,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {1918#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:07,841 INFO L290 TraceCheckUtils]: 21: Hoare triple {1918#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1918#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:07,841 INFO L290 TraceCheckUtils]: 22: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p2~0; {1914#false} is VALID [2022-04-28 08:16:07,841 INFO L290 TraceCheckUtils]: 23: Hoare triple {1914#false} assume 1 != ~lk2~0; {1914#false} is VALID [2022-04-28 08:16:07,842 INFO L290 TraceCheckUtils]: 24: Hoare triple {1914#false} assume !false; {1914#false} is VALID [2022-04-28 08:16:07,842 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-28 08:16:07,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:07,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417195256] [2022-04-28 08:16:07,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417195256] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:07,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:07,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:07,842 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:07,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1929059109] [2022-04-28 08:16:07,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1929059109] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:07,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:07,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:07,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351638012] [2022-04-28 08:16:07,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:07,843 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-28 08:16:07,843 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:07,843 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-28 08:16:07,856 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-28 08:16:07,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:07,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:07,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:07,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:07,856 INFO L87 Difference]: Start difference. First operand 92 states and 164 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-28 08:16:08,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:08,046 INFO L93 Difference]: Finished difference Result 256 states and 468 transitions. [2022-04-28 08:16:08,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:08,046 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-28 08:16:08,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:08,046 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-28 08:16:08,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 244 transitions. [2022-04-28 08:16:08,048 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-28 08:16:08,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 244 transitions. [2022-04-28 08:16:08,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 244 transitions. [2022-04-28 08:16:08,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 244 edges. 244 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:08,207 INFO L225 Difference]: With dead ends: 256 [2022-04-28 08:16:08,207 INFO L226 Difference]: Without dead ends: 173 [2022-04-28 08:16:08,207 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-28 08:16:08,208 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 214 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:08,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 97 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:08,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-28 08:16:08,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2022-04-28 08:16:08,221 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:08,221 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 171 states, 167 states have (on average 1.8323353293413174) internal successors, (306), 167 states have internal predecessors, (306), 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-28 08:16:08,222 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 171 states, 167 states have (on average 1.8323353293413174) internal successors, (306), 167 states have internal predecessors, (306), 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-28 08:16:08,222 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 171 states, 167 states have (on average 1.8323353293413174) internal successors, (306), 167 states have internal predecessors, (306), 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-28 08:16:08,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:08,226 INFO L93 Difference]: Finished difference Result 173 states and 310 transitions. [2022-04-28 08:16:08,226 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 310 transitions. [2022-04-28 08:16:08,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:08,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:08,227 INFO L74 IsIncluded]: Start isIncluded. First operand has 171 states, 167 states have (on average 1.8323353293413174) internal successors, (306), 167 states have internal predecessors, (306), 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 173 states. [2022-04-28 08:16:08,227 INFO L87 Difference]: Start difference. First operand has 171 states, 167 states have (on average 1.8323353293413174) internal successors, (306), 167 states have internal predecessors, (306), 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 173 states. [2022-04-28 08:16:08,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:08,232 INFO L93 Difference]: Finished difference Result 173 states and 310 transitions. [2022-04-28 08:16:08,232 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 310 transitions. [2022-04-28 08:16:08,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:08,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:08,233 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:08,233 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:08,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 167 states have (on average 1.8323353293413174) internal successors, (306), 167 states have internal predecessors, (306), 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-28 08:16:08,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 309 transitions. [2022-04-28 08:16:08,237 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 309 transitions. Word has length 25 [2022-04-28 08:16:08,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:08,237 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 309 transitions. [2022-04-28 08:16:08,237 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-28 08:16:08,238 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 171 states and 309 transitions. [2022-04-28 08:16:08,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 309 edges. 309 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:08,460 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 309 transitions. [2022-04-28 08:16:08,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 08:16:08,461 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:08,461 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-28 08:16:08,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 08:16:08,461 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:08,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:08,461 INFO L85 PathProgramCache]: Analyzing trace with hash 968441810, now seen corresponding path program 1 times [2022-04-28 08:16:08,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:08,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1540453814] [2022-04-28 08:16:08,462 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:08,462 INFO L85 PathProgramCache]: Analyzing trace with hash 968441810, now seen corresponding path program 2 times [2022-04-28 08:16:08,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:08,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627336712] [2022-04-28 08:16:08,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:08,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:08,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:08,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:08,499 INFO L290 TraceCheckUtils]: 0: Hoare triple {3131#(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); {3125#true} is VALID [2022-04-28 08:16:08,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {3125#true} assume true; {3125#true} is VALID [2022-04-28 08:16:08,500 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3125#true} {3125#true} #251#return; {3125#true} is VALID [2022-04-28 08:16:08,500 INFO L272 TraceCheckUtils]: 0: Hoare triple {3125#true} call ULTIMATE.init(); {3131#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:08,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {3131#(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); {3125#true} is VALID [2022-04-28 08:16:08,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {3125#true} assume true; {3125#true} is VALID [2022-04-28 08:16:08,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3125#true} {3125#true} #251#return; {3125#true} is VALID [2022-04-28 08:16:08,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {3125#true} call #t~ret18 := main(); {3125#true} is VALID [2022-04-28 08:16:08,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {3125#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {3125#true} is VALID [2022-04-28 08:16:08,501 INFO L290 TraceCheckUtils]: 6: Hoare triple {3125#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {3125#true} is VALID [2022-04-28 08:16:08,501 INFO L290 TraceCheckUtils]: 7: Hoare triple {3125#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {3125#true} is VALID [2022-04-28 08:16:08,501 INFO L290 TraceCheckUtils]: 8: Hoare triple {3125#true} assume !(0 != ~p1~0); {3125#true} is VALID [2022-04-28 08:16:08,501 INFO L290 TraceCheckUtils]: 9: Hoare triple {3125#true} assume 0 != ~p2~0;~lk2~0 := 1; {3130#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:08,502 INFO L290 TraceCheckUtils]: 10: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {3130#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:08,502 INFO L290 TraceCheckUtils]: 11: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {3130#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:08,502 INFO L290 TraceCheckUtils]: 12: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {3130#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:08,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {3130#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:08,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {3130#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:08,503 INFO L290 TraceCheckUtils]: 15: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {3130#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:08,503 INFO L290 TraceCheckUtils]: 16: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {3130#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:08,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {3130#(= main_~lk2~0 1)} assume !(0 != ~p10~0); {3130#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:08,504 INFO L290 TraceCheckUtils]: 18: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {3130#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:08,504 INFO L290 TraceCheckUtils]: 19: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {3130#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:08,505 INFO L290 TraceCheckUtils]: 20: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {3130#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:08,505 INFO L290 TraceCheckUtils]: 21: Hoare triple {3130#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {3130#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:08,505 INFO L290 TraceCheckUtils]: 22: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p2~0; {3130#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:08,505 INFO L290 TraceCheckUtils]: 23: Hoare triple {3130#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {3126#false} is VALID [2022-04-28 08:16:08,506 INFO L290 TraceCheckUtils]: 24: Hoare triple {3126#false} assume !false; {3126#false} is VALID [2022-04-28 08:16:08,506 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-28 08:16:08,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:08,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627336712] [2022-04-28 08:16:08,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627336712] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:08,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:08,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:08,506 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:08,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1540453814] [2022-04-28 08:16:08,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1540453814] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:08,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:08,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:08,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773787880] [2022-04-28 08:16:08,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:08,507 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-28 08:16:08,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:08,507 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-28 08:16:08,520 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-28 08:16:08,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:08,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:08,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:08,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:08,521 INFO L87 Difference]: Start difference. First operand 171 states and 309 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-28 08:16:08,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:08,709 INFO L93 Difference]: Finished difference Result 223 states and 403 transitions. [2022-04-28 08:16:08,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:08,709 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-28 08:16:08,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:08,709 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-28 08:16:08,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2022-04-28 08:16:08,711 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-28 08:16:08,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2022-04-28 08:16:08,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 160 transitions. [2022-04-28 08:16:08,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:08,822 INFO L225 Difference]: With dead ends: 223 [2022-04-28 08:16:08,822 INFO L226 Difference]: Without dead ends: 221 [2022-04-28 08:16:08,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-28 08:16:08,824 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 139 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:08,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 164 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:08,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-04-28 08:16:08,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 171. [2022-04-28 08:16:08,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:08,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 221 states. Second operand has 171 states, 167 states have (on average 1.8203592814371257) internal successors, (304), 167 states have internal predecessors, (304), 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-28 08:16:08,842 INFO L74 IsIncluded]: Start isIncluded. First operand 221 states. Second operand has 171 states, 167 states have (on average 1.8203592814371257) internal successors, (304), 167 states have internal predecessors, (304), 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-28 08:16:08,842 INFO L87 Difference]: Start difference. First operand 221 states. Second operand has 171 states, 167 states have (on average 1.8203592814371257) internal successors, (304), 167 states have internal predecessors, (304), 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-28 08:16:08,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:08,847 INFO L93 Difference]: Finished difference Result 221 states and 400 transitions. [2022-04-28 08:16:08,847 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 400 transitions. [2022-04-28 08:16:08,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:08,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:08,848 INFO L74 IsIncluded]: Start isIncluded. First operand has 171 states, 167 states have (on average 1.8203592814371257) internal successors, (304), 167 states have internal predecessors, (304), 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 221 states. [2022-04-28 08:16:08,848 INFO L87 Difference]: Start difference. First operand has 171 states, 167 states have (on average 1.8203592814371257) internal successors, (304), 167 states have internal predecessors, (304), 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 221 states. [2022-04-28 08:16:08,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:08,853 INFO L93 Difference]: Finished difference Result 221 states and 400 transitions. [2022-04-28 08:16:08,853 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 400 transitions. [2022-04-28 08:16:08,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:08,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:08,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:08,854 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:08,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 167 states have (on average 1.8203592814371257) internal successors, (304), 167 states have internal predecessors, (304), 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-28 08:16:08,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 307 transitions. [2022-04-28 08:16:08,857 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 307 transitions. Word has length 25 [2022-04-28 08:16:08,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:08,858 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 307 transitions. [2022-04-28 08:16:08,858 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-28 08:16:08,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 171 states and 307 transitions. [2022-04-28 08:16:09,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 307 edges. 307 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:09,092 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 307 transitions. [2022-04-28 08:16:09,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 08:16:09,092 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:09,092 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-28 08:16:09,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 08:16:09,093 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:09,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:09,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1631210112, now seen corresponding path program 1 times [2022-04-28 08:16:09,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:09,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [584850725] [2022-04-28 08:16:09,094 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:09,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1631210112, now seen corresponding path program 2 times [2022-04-28 08:16:09,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:09,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855655300] [2022-04-28 08:16:09,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:09,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:09,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:09,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:09,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:09,159 INFO L290 TraceCheckUtils]: 0: Hoare triple {4373#(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); {4367#true} is VALID [2022-04-28 08:16:09,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {4367#true} assume true; {4367#true} is VALID [2022-04-28 08:16:09,159 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4367#true} {4367#true} #251#return; {4367#true} is VALID [2022-04-28 08:16:09,160 INFO L272 TraceCheckUtils]: 0: Hoare triple {4367#true} call ULTIMATE.init(); {4373#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:09,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {4373#(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); {4367#true} is VALID [2022-04-28 08:16:09,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {4367#true} assume true; {4367#true} is VALID [2022-04-28 08:16:09,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4367#true} {4367#true} #251#return; {4367#true} is VALID [2022-04-28 08:16:09,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {4367#true} call #t~ret18 := main(); {4367#true} is VALID [2022-04-28 08:16:09,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {4367#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {4367#true} is VALID [2022-04-28 08:16:09,162 INFO L290 TraceCheckUtils]: 6: Hoare triple {4367#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {4367#true} is VALID [2022-04-28 08:16:09,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {4367#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {4367#true} is VALID [2022-04-28 08:16:09,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {4367#true} assume !(0 != ~p1~0); {4367#true} is VALID [2022-04-28 08:16:09,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {4367#true} assume !(0 != ~p2~0); {4367#true} is VALID [2022-04-28 08:16:09,162 INFO L290 TraceCheckUtils]: 10: Hoare triple {4367#true} assume 0 != ~p3~0;~lk3~0 := 1; {4372#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:09,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {4372#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:09,163 INFO L290 TraceCheckUtils]: 12: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {4372#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:09,163 INFO L290 TraceCheckUtils]: 13: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {4372#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:09,163 INFO L290 TraceCheckUtils]: 14: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {4372#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:09,164 INFO L290 TraceCheckUtils]: 15: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {4372#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:09,164 INFO L290 TraceCheckUtils]: 16: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {4372#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:09,164 INFO L290 TraceCheckUtils]: 17: Hoare triple {4372#(= main_~lk3~0 1)} assume !(0 != ~p10~0); {4372#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:09,165 INFO L290 TraceCheckUtils]: 18: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {4372#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:09,165 INFO L290 TraceCheckUtils]: 19: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {4372#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:09,165 INFO L290 TraceCheckUtils]: 20: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {4372#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:09,165 INFO L290 TraceCheckUtils]: 21: Hoare triple {4372#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {4372#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:09,166 INFO L290 TraceCheckUtils]: 22: Hoare triple {4372#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {4372#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:09,166 INFO L290 TraceCheckUtils]: 23: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p3~0; {4372#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:09,166 INFO L290 TraceCheckUtils]: 24: Hoare triple {4372#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {4368#false} is VALID [2022-04-28 08:16:09,166 INFO L290 TraceCheckUtils]: 25: Hoare triple {4368#false} assume !false; {4368#false} is VALID [2022-04-28 08:16:09,166 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-28 08:16:09,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:09,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855655300] [2022-04-28 08:16:09,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855655300] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:09,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:09,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:09,167 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:09,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [584850725] [2022-04-28 08:16:09,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [584850725] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:09,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:09,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:09,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194846955] [2022-04-28 08:16:09,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:09,168 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-28 08:16:09,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:09,168 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-28 08:16:09,181 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-28 08:16:09,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:09,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:09,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:09,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:09,183 INFO L87 Difference]: Start difference. First operand 171 states and 307 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-28 08:16:09,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:09,371 INFO L93 Difference]: Finished difference Result 323 states and 587 transitions. [2022-04-28 08:16:09,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:09,371 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-28 08:16:09,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:09,372 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-28 08:16:09,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-28 08:16:09,373 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-28 08:16:09,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-28 08:16:09,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 159 transitions. [2022-04-28 08:16:09,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:09,480 INFO L225 Difference]: With dead ends: 323 [2022-04-28 08:16:09,480 INFO L226 Difference]: Without dead ends: 321 [2022-04-28 08:16:09,480 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-28 08:16:09,481 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 205 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:09,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 94 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:09,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-04-28 08:16:09,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 231. [2022-04-28 08:16:09,517 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:09,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 321 states. Second operand has 231 states, 227 states have (on average 1.8061674008810573) internal successors, (410), 227 states have internal predecessors, (410), 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-28 08:16:09,518 INFO L74 IsIncluded]: Start isIncluded. First operand 321 states. Second operand has 231 states, 227 states have (on average 1.8061674008810573) internal successors, (410), 227 states have internal predecessors, (410), 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-28 08:16:09,519 INFO L87 Difference]: Start difference. First operand 321 states. Second operand has 231 states, 227 states have (on average 1.8061674008810573) internal successors, (410), 227 states have internal predecessors, (410), 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-28 08:16:09,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:09,524 INFO L93 Difference]: Finished difference Result 321 states and 582 transitions. [2022-04-28 08:16:09,524 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 582 transitions. [2022-04-28 08:16:09,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:09,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:09,525 INFO L74 IsIncluded]: Start isIncluded. First operand has 231 states, 227 states have (on average 1.8061674008810573) internal successors, (410), 227 states have internal predecessors, (410), 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 321 states. [2022-04-28 08:16:09,525 INFO L87 Difference]: Start difference. First operand has 231 states, 227 states have (on average 1.8061674008810573) internal successors, (410), 227 states have internal predecessors, (410), 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 321 states. [2022-04-28 08:16:09,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:09,530 INFO L93 Difference]: Finished difference Result 321 states and 582 transitions. [2022-04-28 08:16:09,530 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 582 transitions. [2022-04-28 08:16:09,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:09,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:09,531 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:09,531 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:09,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 227 states have (on average 1.8061674008810573) internal successors, (410), 227 states have internal predecessors, (410), 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-28 08:16:09,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 413 transitions. [2022-04-28 08:16:09,535 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 413 transitions. Word has length 26 [2022-04-28 08:16:09,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:09,535 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 413 transitions. [2022-04-28 08:16:09,535 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-28 08:16:09,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 231 states and 413 transitions. [2022-04-28 08:16:09,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 413 edges. 413 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:09,875 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 413 transitions. [2022-04-28 08:16:09,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 08:16:09,875 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:09,875 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-28 08:16:09,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 08:16:09,875 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:09,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:09,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1642688830, now seen corresponding path program 1 times [2022-04-28 08:16:09,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:09,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [838970642] [2022-04-28 08:16:09,876 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:09,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1642688830, now seen corresponding path program 2 times [2022-04-28 08:16:09,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:09,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403255382] [2022-04-28 08:16:09,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:09,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:09,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:09,918 INFO L290 TraceCheckUtils]: 0: Hoare triple {6135#(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); {6129#true} is VALID [2022-04-28 08:16:09,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {6129#true} assume true; {6129#true} is VALID [2022-04-28 08:16:09,918 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6129#true} {6129#true} #251#return; {6129#true} is VALID [2022-04-28 08:16:09,918 INFO L272 TraceCheckUtils]: 0: Hoare triple {6129#true} call ULTIMATE.init(); {6135#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:09,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {6135#(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); {6129#true} is VALID [2022-04-28 08:16:09,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {6129#true} assume true; {6129#true} is VALID [2022-04-28 08:16:09,919 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6129#true} {6129#true} #251#return; {6129#true} is VALID [2022-04-28 08:16:09,919 INFO L272 TraceCheckUtils]: 4: Hoare triple {6129#true} call #t~ret18 := main(); {6129#true} is VALID [2022-04-28 08:16:09,919 INFO L290 TraceCheckUtils]: 5: Hoare triple {6129#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {6129#true} is VALID [2022-04-28 08:16:09,919 INFO L290 TraceCheckUtils]: 6: Hoare triple {6129#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {6129#true} is VALID [2022-04-28 08:16:09,919 INFO L290 TraceCheckUtils]: 7: Hoare triple {6129#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {6129#true} is VALID [2022-04-28 08:16:09,919 INFO L290 TraceCheckUtils]: 8: Hoare triple {6129#true} assume !(0 != ~p1~0); {6129#true} is VALID [2022-04-28 08:16:09,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {6129#true} assume !(0 != ~p2~0); {6129#true} is VALID [2022-04-28 08:16:09,919 INFO L290 TraceCheckUtils]: 10: Hoare triple {6129#true} assume !(0 != ~p3~0); {6134#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:09,920 INFO L290 TraceCheckUtils]: 11: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {6134#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:09,920 INFO L290 TraceCheckUtils]: 12: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {6134#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:09,920 INFO L290 TraceCheckUtils]: 13: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {6134#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:09,921 INFO L290 TraceCheckUtils]: 14: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {6134#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:09,921 INFO L290 TraceCheckUtils]: 15: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {6134#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:09,921 INFO L290 TraceCheckUtils]: 16: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {6134#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:09,921 INFO L290 TraceCheckUtils]: 17: Hoare triple {6134#(= main_~p3~0 0)} assume !(0 != ~p10~0); {6134#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:09,922 INFO L290 TraceCheckUtils]: 18: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {6134#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:09,922 INFO L290 TraceCheckUtils]: 19: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {6134#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:09,922 INFO L290 TraceCheckUtils]: 20: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {6134#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:09,922 INFO L290 TraceCheckUtils]: 21: Hoare triple {6134#(= main_~p3~0 0)} assume !(0 != ~p1~0); {6134#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:09,923 INFO L290 TraceCheckUtils]: 22: Hoare triple {6134#(= main_~p3~0 0)} assume !(0 != ~p2~0); {6134#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:09,923 INFO L290 TraceCheckUtils]: 23: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p3~0; {6130#false} is VALID [2022-04-28 08:16:09,923 INFO L290 TraceCheckUtils]: 24: Hoare triple {6130#false} assume 1 != ~lk3~0; {6130#false} is VALID [2022-04-28 08:16:09,923 INFO L290 TraceCheckUtils]: 25: Hoare triple {6130#false} assume !false; {6130#false} is VALID [2022-04-28 08:16:09,923 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-28 08:16:09,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:09,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403255382] [2022-04-28 08:16:09,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403255382] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:09,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:09,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:09,924 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:09,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [838970642] [2022-04-28 08:16:09,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [838970642] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:09,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:09,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:09,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026268261] [2022-04-28 08:16:09,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:09,924 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-28 08:16:09,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:09,925 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-28 08:16:09,938 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-28 08:16:09,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:09,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:09,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:09,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:09,938 INFO L87 Difference]: Start difference. First operand 231 states and 413 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-28 08:16:10,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:10,145 INFO L93 Difference]: Finished difference Result 551 states and 995 transitions. [2022-04-28 08:16:10,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:10,145 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-28 08:16:10,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:10,145 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-28 08:16:10,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 240 transitions. [2022-04-28 08:16:10,146 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-28 08:16:10,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 240 transitions. [2022-04-28 08:16:10,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 240 transitions. [2022-04-28 08:16:10,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 240 edges. 240 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:10,299 INFO L225 Difference]: With dead ends: 551 [2022-04-28 08:16:10,299 INFO L226 Difference]: Without dead ends: 329 [2022-04-28 08:16:10,300 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-28 08:16:10,301 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 181 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:10,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 123 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:10,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-04-28 08:16:10,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 327. [2022-04-28 08:16:10,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:10,329 INFO L82 GeneralOperation]: Start isEquivalent. First operand 329 states. Second operand has 327 states, 323 states have (on average 1.7956656346749227) internal successors, (580), 323 states have internal predecessors, (580), 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-28 08:16:10,329 INFO L74 IsIncluded]: Start isIncluded. First operand 329 states. Second operand has 327 states, 323 states have (on average 1.7956656346749227) internal successors, (580), 323 states have internal predecessors, (580), 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-28 08:16:10,330 INFO L87 Difference]: Start difference. First operand 329 states. Second operand has 327 states, 323 states have (on average 1.7956656346749227) internal successors, (580), 323 states have internal predecessors, (580), 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-28 08:16:10,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:10,337 INFO L93 Difference]: Finished difference Result 329 states and 584 transitions. [2022-04-28 08:16:10,337 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 584 transitions. [2022-04-28 08:16:10,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:10,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:10,339 INFO L74 IsIncluded]: Start isIncluded. First operand has 327 states, 323 states have (on average 1.7956656346749227) internal successors, (580), 323 states have internal predecessors, (580), 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 329 states. [2022-04-28 08:16:10,340 INFO L87 Difference]: Start difference. First operand has 327 states, 323 states have (on average 1.7956656346749227) internal successors, (580), 323 states have internal predecessors, (580), 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 329 states. [2022-04-28 08:16:10,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:10,346 INFO L93 Difference]: Finished difference Result 329 states and 584 transitions. [2022-04-28 08:16:10,346 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 584 transitions. [2022-04-28 08:16:10,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:10,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:10,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:10,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:10,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 323 states have (on average 1.7956656346749227) internal successors, (580), 323 states have internal predecessors, (580), 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-28 08:16:10,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 583 transitions. [2022-04-28 08:16:10,354 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 583 transitions. Word has length 26 [2022-04-28 08:16:10,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:10,355 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 583 transitions. [2022-04-28 08:16:10,355 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-28 08:16:10,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 327 states and 583 transitions. [2022-04-28 08:16:10,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 583 edges. 583 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:10,868 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 583 transitions. [2022-04-28 08:16:10,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 08:16:10,869 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:10,869 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-28 08:16:10,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 08:16:10,869 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:10,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:10,870 INFO L85 PathProgramCache]: Analyzing trace with hash 972307173, now seen corresponding path program 1 times [2022-04-28 08:16:10,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:10,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1672106386] [2022-04-28 08:16:10,871 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:10,871 INFO L85 PathProgramCache]: Analyzing trace with hash 972307173, now seen corresponding path program 2 times [2022-04-28 08:16:10,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:10,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373612229] [2022-04-28 08:16:10,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:10,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:10,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:10,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:10,921 INFO L290 TraceCheckUtils]: 0: Hoare triple {8561#(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); {8555#true} is VALID [2022-04-28 08:16:10,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {8555#true} assume true; {8555#true} is VALID [2022-04-28 08:16:10,922 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8555#true} {8555#true} #251#return; {8555#true} is VALID [2022-04-28 08:16:10,922 INFO L272 TraceCheckUtils]: 0: Hoare triple {8555#true} call ULTIMATE.init(); {8561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:10,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {8561#(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); {8555#true} is VALID [2022-04-28 08:16:10,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {8555#true} assume true; {8555#true} is VALID [2022-04-28 08:16:10,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8555#true} {8555#true} #251#return; {8555#true} is VALID [2022-04-28 08:16:10,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {8555#true} call #t~ret18 := main(); {8555#true} is VALID [2022-04-28 08:16:10,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {8555#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {8555#true} is VALID [2022-04-28 08:16:10,925 INFO L290 TraceCheckUtils]: 6: Hoare triple {8555#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {8555#true} is VALID [2022-04-28 08:16:10,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {8555#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {8555#true} is VALID [2022-04-28 08:16:10,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {8555#true} assume !(0 != ~p1~0); {8555#true} is VALID [2022-04-28 08:16:10,925 INFO L290 TraceCheckUtils]: 9: Hoare triple {8555#true} assume !(0 != ~p2~0); {8555#true} is VALID [2022-04-28 08:16:10,926 INFO L290 TraceCheckUtils]: 10: Hoare triple {8555#true} assume 0 != ~p3~0;~lk3~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:10,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {8560#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:10,926 INFO L290 TraceCheckUtils]: 12: Hoare triple {8560#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:10,927 INFO L290 TraceCheckUtils]: 13: Hoare triple {8560#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:10,927 INFO L290 TraceCheckUtils]: 14: Hoare triple {8560#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:10,927 INFO L290 TraceCheckUtils]: 15: Hoare triple {8560#(not (= main_~p3~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:10,928 INFO L290 TraceCheckUtils]: 16: Hoare triple {8560#(not (= main_~p3~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:10,928 INFO L290 TraceCheckUtils]: 17: Hoare triple {8560#(not (= main_~p3~0 0))} assume !(0 != ~p10~0); {8560#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:10,928 INFO L290 TraceCheckUtils]: 18: Hoare triple {8560#(not (= main_~p3~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:10,929 INFO L290 TraceCheckUtils]: 19: Hoare triple {8560#(not (= main_~p3~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:10,929 INFO L290 TraceCheckUtils]: 20: Hoare triple {8560#(not (= main_~p3~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:10,929 INFO L290 TraceCheckUtils]: 21: Hoare triple {8560#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {8560#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:10,929 INFO L290 TraceCheckUtils]: 22: Hoare triple {8560#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {8560#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:10,930 INFO L290 TraceCheckUtils]: 23: Hoare triple {8560#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {8556#false} is VALID [2022-04-28 08:16:10,930 INFO L290 TraceCheckUtils]: 24: Hoare triple {8556#false} assume 0 != ~p4~0; {8556#false} is VALID [2022-04-28 08:16:10,933 INFO L290 TraceCheckUtils]: 25: Hoare triple {8556#false} assume 1 != ~lk4~0; {8556#false} is VALID [2022-04-28 08:16:10,933 INFO L290 TraceCheckUtils]: 26: Hoare triple {8556#false} assume !false; {8556#false} is VALID [2022-04-28 08:16:10,934 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-28 08:16:10,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:10,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373612229] [2022-04-28 08:16:10,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373612229] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:10,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:10,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:10,934 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:10,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1672106386] [2022-04-28 08:16:10,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1672106386] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:10,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:10,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:10,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780917561] [2022-04-28 08:16:10,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:10,935 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-28 08:16:10,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:10,935 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-28 08:16:10,951 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-28 08:16:10,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:10,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:10,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:10,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:10,952 INFO L87 Difference]: Start difference. First operand 327 states and 583 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-28 08:16:11,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:11,170 INFO L93 Difference]: Finished difference Result 493 states and 877 transitions. [2022-04-28 08:16:11,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:11,170 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-28 08:16:11,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:11,171 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-28 08:16:11,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 235 transitions. [2022-04-28 08:16:11,172 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-28 08:16:11,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 235 transitions. [2022-04-28 08:16:11,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 235 transitions. [2022-04-28 08:16:11,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:11,321 INFO L225 Difference]: With dead ends: 493 [2022-04-28 08:16:11,321 INFO L226 Difference]: Without dead ends: 335 [2022-04-28 08:16:11,322 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-28 08:16:11,323 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 168 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:11,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 137 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:16:11,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2022-04-28 08:16:11,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 333. [2022-04-28 08:16:11,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:11,365 INFO L82 GeneralOperation]: Start isEquivalent. First operand 335 states. Second operand has 333 states, 329 states have (on average 1.7750759878419453) internal successors, (584), 329 states have internal predecessors, (584), 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-28 08:16:11,366 INFO L74 IsIncluded]: Start isIncluded. First operand 335 states. Second operand has 333 states, 329 states have (on average 1.7750759878419453) internal successors, (584), 329 states have internal predecessors, (584), 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-28 08:16:11,367 INFO L87 Difference]: Start difference. First operand 335 states. Second operand has 333 states, 329 states have (on average 1.7750759878419453) internal successors, (584), 329 states have internal predecessors, (584), 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-28 08:16:11,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:11,372 INFO L93 Difference]: Finished difference Result 335 states and 588 transitions. [2022-04-28 08:16:11,372 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 588 transitions. [2022-04-28 08:16:11,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:11,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:11,373 INFO L74 IsIncluded]: Start isIncluded. First operand has 333 states, 329 states have (on average 1.7750759878419453) internal successors, (584), 329 states have internal predecessors, (584), 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 335 states. [2022-04-28 08:16:11,374 INFO L87 Difference]: Start difference. First operand has 333 states, 329 states have (on average 1.7750759878419453) internal successors, (584), 329 states have internal predecessors, (584), 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 335 states. [2022-04-28 08:16:11,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:11,379 INFO L93 Difference]: Finished difference Result 335 states and 588 transitions. [2022-04-28 08:16:11,379 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 588 transitions. [2022-04-28 08:16:11,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:11,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:11,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:11,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:11,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 329 states have (on average 1.7750759878419453) internal successors, (584), 329 states have internal predecessors, (584), 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-28 08:16:11,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 587 transitions. [2022-04-28 08:16:11,386 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 587 transitions. Word has length 27 [2022-04-28 08:16:11,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:11,387 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 587 transitions. [2022-04-28 08:16:11,387 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-28 08:16:11,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 333 states and 587 transitions. [2022-04-28 08:16:11,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 587 edges. 587 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:11,863 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 587 transitions. [2022-04-28 08:16:11,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 08:16:11,863 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:11,864 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-28 08:16:11,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 08:16:11,864 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:11,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:11,864 INFO L85 PathProgramCache]: Analyzing trace with hash -616040729, now seen corresponding path program 1 times [2022-04-28 08:16:11,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:11,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1694172252] [2022-04-28 08:16:11,864 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:11,864 INFO L85 PathProgramCache]: Analyzing trace with hash -616040729, now seen corresponding path program 2 times [2022-04-28 08:16:11,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:11,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027414298] [2022-04-28 08:16:11,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:11,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:11,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:11,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:11,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:11,906 INFO L290 TraceCheckUtils]: 0: Hoare triple {10895#(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); {10889#true} is VALID [2022-04-28 08:16:11,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {10889#true} assume true; {10889#true} is VALID [2022-04-28 08:16:11,906 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10889#true} {10889#true} #251#return; {10889#true} is VALID [2022-04-28 08:16:11,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {10889#true} call ULTIMATE.init(); {10895#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:11,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {10895#(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); {10889#true} is VALID [2022-04-28 08:16:11,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {10889#true} assume true; {10889#true} is VALID [2022-04-28 08:16:11,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10889#true} {10889#true} #251#return; {10889#true} is VALID [2022-04-28 08:16:11,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {10889#true} call #t~ret18 := main(); {10889#true} is VALID [2022-04-28 08:16:11,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {10889#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {10889#true} is VALID [2022-04-28 08:16:11,907 INFO L290 TraceCheckUtils]: 6: Hoare triple {10889#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {10889#true} is VALID [2022-04-28 08:16:11,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {10889#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {10889#true} is VALID [2022-04-28 08:16:11,907 INFO L290 TraceCheckUtils]: 8: Hoare triple {10889#true} assume !(0 != ~p1~0); {10889#true} is VALID [2022-04-28 08:16:11,907 INFO L290 TraceCheckUtils]: 9: Hoare triple {10889#true} assume !(0 != ~p2~0); {10889#true} is VALID [2022-04-28 08:16:11,907 INFO L290 TraceCheckUtils]: 10: Hoare triple {10889#true} assume !(0 != ~p3~0); {10889#true} is VALID [2022-04-28 08:16:11,908 INFO L290 TraceCheckUtils]: 11: Hoare triple {10889#true} assume 0 != ~p4~0;~lk4~0 := 1; {10894#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:11,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {10894#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {10894#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:11,908 INFO L290 TraceCheckUtils]: 13: Hoare triple {10894#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {10894#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:11,908 INFO L290 TraceCheckUtils]: 14: Hoare triple {10894#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {10894#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:11,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {10894#(= main_~lk4~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {10894#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:11,909 INFO L290 TraceCheckUtils]: 16: Hoare triple {10894#(= main_~lk4~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {10894#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:11,909 INFO L290 TraceCheckUtils]: 17: Hoare triple {10894#(= main_~lk4~0 1)} assume !(0 != ~p10~0); {10894#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:11,909 INFO L290 TraceCheckUtils]: 18: Hoare triple {10894#(= main_~lk4~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {10894#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:11,910 INFO L290 TraceCheckUtils]: 19: Hoare triple {10894#(= main_~lk4~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {10894#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:11,910 INFO L290 TraceCheckUtils]: 20: Hoare triple {10894#(= main_~lk4~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {10894#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:11,911 INFO L290 TraceCheckUtils]: 21: Hoare triple {10894#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {10894#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:11,912 INFO L290 TraceCheckUtils]: 22: Hoare triple {10894#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {10894#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:11,915 INFO L290 TraceCheckUtils]: 23: Hoare triple {10894#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {10894#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:11,915 INFO L290 TraceCheckUtils]: 24: Hoare triple {10894#(= main_~lk4~0 1)} assume 0 != ~p4~0; {10894#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:11,915 INFO L290 TraceCheckUtils]: 25: Hoare triple {10894#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {10890#false} is VALID [2022-04-28 08:16:11,915 INFO L290 TraceCheckUtils]: 26: Hoare triple {10890#false} assume !false; {10890#false} is VALID [2022-04-28 08:16:11,915 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-28 08:16:11,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:11,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027414298] [2022-04-28 08:16:11,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027414298] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:11,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:11,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:11,916 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:11,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1694172252] [2022-04-28 08:16:11,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1694172252] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:11,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:11,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:11,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240110266] [2022-04-28 08:16:11,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:11,917 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-28 08:16:11,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:11,917 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-28 08:16:11,930 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-28 08:16:11,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:11,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:11,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:11,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:11,930 INFO L87 Difference]: Start difference. First operand 333 states and 587 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-28 08:16:12,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:12,142 INFO L93 Difference]: Finished difference Result 621 states and 1109 transitions. [2022-04-28 08:16:12,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:12,142 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-28 08:16:12,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:12,143 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-28 08:16:12,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2022-04-28 08:16:12,144 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-28 08:16:12,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2022-04-28 08:16:12,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 155 transitions. [2022-04-28 08:16:12,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:12,278 INFO L225 Difference]: With dead ends: 621 [2022-04-28 08:16:12,278 INFO L226 Difference]: Without dead ends: 619 [2022-04-28 08:16:12,278 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-28 08:16:12,278 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 198 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:12,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 93 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:12,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2022-04-28 08:16:12,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 457. [2022-04-28 08:16:12,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:12,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 619 states. Second operand has 457 states, 453 states have (on average 1.7483443708609272) internal successors, (792), 453 states have internal predecessors, (792), 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-28 08:16:12,301 INFO L74 IsIncluded]: Start isIncluded. First operand 619 states. Second operand has 457 states, 453 states have (on average 1.7483443708609272) internal successors, (792), 453 states have internal predecessors, (792), 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-28 08:16:12,301 INFO L87 Difference]: Start difference. First operand 619 states. Second operand has 457 states, 453 states have (on average 1.7483443708609272) internal successors, (792), 453 states have internal predecessors, (792), 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-28 08:16:12,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:12,315 INFO L93 Difference]: Finished difference Result 619 states and 1100 transitions. [2022-04-28 08:16:12,315 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 1100 transitions. [2022-04-28 08:16:12,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:12,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:12,317 INFO L74 IsIncluded]: Start isIncluded. First operand has 457 states, 453 states have (on average 1.7483443708609272) internal successors, (792), 453 states have internal predecessors, (792), 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 619 states. [2022-04-28 08:16:12,317 INFO L87 Difference]: Start difference. First operand has 457 states, 453 states have (on average 1.7483443708609272) internal successors, (792), 453 states have internal predecessors, (792), 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 619 states. [2022-04-28 08:16:12,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:12,331 INFO L93 Difference]: Finished difference Result 619 states and 1100 transitions. [2022-04-28 08:16:12,331 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 1100 transitions. [2022-04-28 08:16:12,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:12,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:12,332 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:12,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:12,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 453 states have (on average 1.7483443708609272) internal successors, (792), 453 states have internal predecessors, (792), 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-28 08:16:12,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 795 transitions. [2022-04-28 08:16:12,343 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 795 transitions. Word has length 27 [2022-04-28 08:16:12,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:12,343 INFO L495 AbstractCegarLoop]: Abstraction has 457 states and 795 transitions. [2022-04-28 08:16:12,343 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-28 08:16:12,344 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 457 states and 795 transitions. [2022-04-28 08:16:12,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 795 edges. 795 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:12,969 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 795 transitions. [2022-04-28 08:16:12,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 08:16:12,970 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:12,970 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-28 08:16:12,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 08:16:12,970 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:12,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:12,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1637109083, now seen corresponding path program 1 times [2022-04-28 08:16:12,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:12,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [633368808] [2022-04-28 08:16:12,971 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:12,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1637109083, now seen corresponding path program 2 times [2022-04-28 08:16:12,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:12,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60465726] [2022-04-28 08:16:12,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:12,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:13,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:13,017 INFO L290 TraceCheckUtils]: 0: Hoare triple {14301#(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); {14295#true} is VALID [2022-04-28 08:16:13,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-28 08:16:13,017 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14295#true} {14295#true} #251#return; {14295#true} is VALID [2022-04-28 08:16:13,017 INFO L272 TraceCheckUtils]: 0: Hoare triple {14295#true} call ULTIMATE.init(); {14301#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:13,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {14301#(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); {14295#true} is VALID [2022-04-28 08:16:13,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-28 08:16:13,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14295#true} {14295#true} #251#return; {14295#true} is VALID [2022-04-28 08:16:13,018 INFO L272 TraceCheckUtils]: 4: Hoare triple {14295#true} call #t~ret18 := main(); {14295#true} is VALID [2022-04-28 08:16:13,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {14295#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {14295#true} is VALID [2022-04-28 08:16:13,018 INFO L290 TraceCheckUtils]: 6: Hoare triple {14295#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {14295#true} is VALID [2022-04-28 08:16:13,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {14295#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {14295#true} is VALID [2022-04-28 08:16:13,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {14295#true} assume !(0 != ~p1~0); {14295#true} is VALID [2022-04-28 08:16:13,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {14295#true} assume !(0 != ~p2~0); {14295#true} is VALID [2022-04-28 08:16:13,018 INFO L290 TraceCheckUtils]: 10: Hoare triple {14295#true} assume !(0 != ~p3~0); {14295#true} is VALID [2022-04-28 08:16:13,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {14295#true} assume !(0 != ~p4~0); {14300#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:13,020 INFO L290 TraceCheckUtils]: 12: Hoare triple {14300#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {14300#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:13,020 INFO L290 TraceCheckUtils]: 13: Hoare triple {14300#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {14300#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:13,020 INFO L290 TraceCheckUtils]: 14: Hoare triple {14300#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {14300#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:13,021 INFO L290 TraceCheckUtils]: 15: Hoare triple {14300#(= main_~p4~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {14300#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:13,021 INFO L290 TraceCheckUtils]: 16: Hoare triple {14300#(= main_~p4~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {14300#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:13,021 INFO L290 TraceCheckUtils]: 17: Hoare triple {14300#(= main_~p4~0 0)} assume !(0 != ~p10~0); {14300#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:13,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {14300#(= main_~p4~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {14300#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:13,022 INFO L290 TraceCheckUtils]: 19: Hoare triple {14300#(= main_~p4~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {14300#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:13,022 INFO L290 TraceCheckUtils]: 20: Hoare triple {14300#(= main_~p4~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {14300#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:13,022 INFO L290 TraceCheckUtils]: 21: Hoare triple {14300#(= main_~p4~0 0)} assume !(0 != ~p1~0); {14300#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:13,022 INFO L290 TraceCheckUtils]: 22: Hoare triple {14300#(= main_~p4~0 0)} assume !(0 != ~p2~0); {14300#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:13,023 INFO L290 TraceCheckUtils]: 23: Hoare triple {14300#(= main_~p4~0 0)} assume !(0 != ~p3~0); {14300#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:13,023 INFO L290 TraceCheckUtils]: 24: Hoare triple {14300#(= main_~p4~0 0)} assume 0 != ~p4~0; {14296#false} is VALID [2022-04-28 08:16:13,023 INFO L290 TraceCheckUtils]: 25: Hoare triple {14296#false} assume 1 != ~lk4~0; {14296#false} is VALID [2022-04-28 08:16:13,023 INFO L290 TraceCheckUtils]: 26: Hoare triple {14296#false} assume !false; {14296#false} is VALID [2022-04-28 08:16:13,023 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-28 08:16:13,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:13,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60465726] [2022-04-28 08:16:13,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60465726] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:13,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:13,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:13,024 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:13,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [633368808] [2022-04-28 08:16:13,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [633368808] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:13,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:13,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:13,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754972302] [2022-04-28 08:16:13,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:13,044 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-28 08:16:13,044 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:13,044 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-28 08:16:13,058 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-28 08:16:13,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:13,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:13,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:13,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:13,058 INFO L87 Difference]: Start difference. First operand 457 states and 795 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-28 08:16:13,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:13,276 INFO L93 Difference]: Finished difference Result 1085 states and 1901 transitions. [2022-04-28 08:16:13,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:13,276 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-28 08:16:13,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:13,277 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-28 08:16:13,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 237 transitions. [2022-04-28 08:16:13,279 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-28 08:16:13,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 237 transitions. [2022-04-28 08:16:13,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 237 transitions. [2022-04-28 08:16:13,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 237 edges. 237 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:13,450 INFO L225 Difference]: With dead ends: 1085 [2022-04-28 08:16:13,450 INFO L226 Difference]: Without dead ends: 643 [2022-04-28 08:16:13,451 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-28 08:16:13,452 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 175 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:13,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 125 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:13,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2022-04-28 08:16:13,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 641. [2022-04-28 08:16:13,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:13,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 643 states. Second operand has 641 states, 637 states have (on average 1.739403453689168) internal successors, (1108), 637 states have internal predecessors, (1108), 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-28 08:16:13,490 INFO L74 IsIncluded]: Start isIncluded. First operand 643 states. Second operand has 641 states, 637 states have (on average 1.739403453689168) internal successors, (1108), 637 states have internal predecessors, (1108), 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-28 08:16:13,492 INFO L87 Difference]: Start difference. First operand 643 states. Second operand has 641 states, 637 states have (on average 1.739403453689168) internal successors, (1108), 637 states have internal predecessors, (1108), 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-28 08:16:13,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:13,507 INFO L93 Difference]: Finished difference Result 643 states and 1112 transitions. [2022-04-28 08:16:13,507 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1112 transitions. [2022-04-28 08:16:13,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:13,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:13,509 INFO L74 IsIncluded]: Start isIncluded. First operand has 641 states, 637 states have (on average 1.739403453689168) internal successors, (1108), 637 states have internal predecessors, (1108), 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 643 states. [2022-04-28 08:16:13,510 INFO L87 Difference]: Start difference. First operand has 641 states, 637 states have (on average 1.739403453689168) internal successors, (1108), 637 states have internal predecessors, (1108), 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 643 states. [2022-04-28 08:16:13,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:13,529 INFO L93 Difference]: Finished difference Result 643 states and 1112 transitions. [2022-04-28 08:16:13,529 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1112 transitions. [2022-04-28 08:16:13,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:13,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:13,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:13,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:13,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 637 states have (on average 1.739403453689168) internal successors, (1108), 637 states have internal predecessors, (1108), 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-28 08:16:13,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 1111 transitions. [2022-04-28 08:16:13,569 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 1111 transitions. Word has length 27 [2022-04-28 08:16:13,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:13,569 INFO L495 AbstractCegarLoop]: Abstraction has 641 states and 1111 transitions. [2022-04-28 08:16:13,569 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-28 08:16:13,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 641 states and 1111 transitions. [2022-04-28 08:16:14,543 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1111 edges. 1111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:14,543 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 1111 transitions. [2022-04-28 08:16:14,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 08:16:14,544 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:14,544 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-28 08:16:14,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 08:16:14,544 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:14,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:14,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1917179981, now seen corresponding path program 1 times [2022-04-28 08:16:14,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:14,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2097824968] [2022-04-28 08:16:14,545 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:14,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1917179981, now seen corresponding path program 2 times [2022-04-28 08:16:14,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:14,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262807492] [2022-04-28 08:16:14,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:14,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:14,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:14,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:14,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:14,597 INFO L290 TraceCheckUtils]: 0: Hoare triple {19051#(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); {19045#true} is VALID [2022-04-28 08:16:14,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {19045#true} assume true; {19045#true} is VALID [2022-04-28 08:16:14,597 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19045#true} {19045#true} #251#return; {19045#true} is VALID [2022-04-28 08:16:14,598 INFO L272 TraceCheckUtils]: 0: Hoare triple {19045#true} call ULTIMATE.init(); {19051#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:14,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {19051#(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); {19045#true} is VALID [2022-04-28 08:16:14,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {19045#true} assume true; {19045#true} is VALID [2022-04-28 08:16:14,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19045#true} {19045#true} #251#return; {19045#true} is VALID [2022-04-28 08:16:14,598 INFO L272 TraceCheckUtils]: 4: Hoare triple {19045#true} call #t~ret18 := main(); {19045#true} is VALID [2022-04-28 08:16:14,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {19045#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {19045#true} is VALID [2022-04-28 08:16:14,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {19045#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {19045#true} is VALID [2022-04-28 08:16:14,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {19045#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {19045#true} is VALID [2022-04-28 08:16:14,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {19045#true} assume !(0 != ~p1~0); {19045#true} is VALID [2022-04-28 08:16:14,598 INFO L290 TraceCheckUtils]: 9: Hoare triple {19045#true} assume !(0 != ~p2~0); {19045#true} is VALID [2022-04-28 08:16:14,599 INFO L290 TraceCheckUtils]: 10: Hoare triple {19045#true} assume !(0 != ~p3~0); {19045#true} is VALID [2022-04-28 08:16:14,599 INFO L290 TraceCheckUtils]: 11: Hoare triple {19045#true} assume 0 != ~p4~0;~lk4~0 := 1; {19050#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:14,599 INFO L290 TraceCheckUtils]: 12: Hoare triple {19050#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {19050#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:14,600 INFO L290 TraceCheckUtils]: 13: Hoare triple {19050#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {19050#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:14,600 INFO L290 TraceCheckUtils]: 14: Hoare triple {19050#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {19050#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:14,600 INFO L290 TraceCheckUtils]: 15: Hoare triple {19050#(not (= main_~p4~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {19050#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:14,600 INFO L290 TraceCheckUtils]: 16: Hoare triple {19050#(not (= main_~p4~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {19050#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:14,601 INFO L290 TraceCheckUtils]: 17: Hoare triple {19050#(not (= main_~p4~0 0))} assume !(0 != ~p10~0); {19050#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:14,601 INFO L290 TraceCheckUtils]: 18: Hoare triple {19050#(not (= main_~p4~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {19050#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:14,601 INFO L290 TraceCheckUtils]: 19: Hoare triple {19050#(not (= main_~p4~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {19050#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:14,602 INFO L290 TraceCheckUtils]: 20: Hoare triple {19050#(not (= main_~p4~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {19050#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:14,603 INFO L290 TraceCheckUtils]: 21: Hoare triple {19050#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {19050#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:14,603 INFO L290 TraceCheckUtils]: 22: Hoare triple {19050#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {19050#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:14,603 INFO L290 TraceCheckUtils]: 23: Hoare triple {19050#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {19050#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:14,603 INFO L290 TraceCheckUtils]: 24: Hoare triple {19050#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {19046#false} is VALID [2022-04-28 08:16:14,604 INFO L290 TraceCheckUtils]: 25: Hoare triple {19046#false} assume 0 != ~p5~0; {19046#false} is VALID [2022-04-28 08:16:14,605 INFO L290 TraceCheckUtils]: 26: Hoare triple {19046#false} assume 1 != ~lk5~0; {19046#false} is VALID [2022-04-28 08:16:14,605 INFO L290 TraceCheckUtils]: 27: Hoare triple {19046#false} assume !false; {19046#false} is VALID [2022-04-28 08:16:14,605 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-28 08:16:14,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:14,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262807492] [2022-04-28 08:16:14,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262807492] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:14,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:14,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:14,605 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:14,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2097824968] [2022-04-28 08:16:14,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2097824968] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:14,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:14,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:14,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705718845] [2022-04-28 08:16:14,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:14,606 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-28 08:16:14,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:14,606 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-28 08:16:14,620 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-28 08:16:14,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:14,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:14,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:14,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:14,621 INFO L87 Difference]: Start difference. First operand 641 states and 1111 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-28 08:16:14,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:14,844 INFO L93 Difference]: Finished difference Result 961 states and 1661 transitions. [2022-04-28 08:16:14,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:14,844 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-28 08:16:14,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:14,845 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-28 08:16:14,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 232 transitions. [2022-04-28 08:16:14,847 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-28 08:16:14,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 232 transitions. [2022-04-28 08:16:14,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 232 transitions. [2022-04-28 08:16:14,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 232 edges. 232 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:14,995 INFO L225 Difference]: With dead ends: 961 [2022-04-28 08:16:14,995 INFO L226 Difference]: Without dead ends: 651 [2022-04-28 08:16:14,996 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-28 08:16:14,996 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 167 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:14,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 134 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:14,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2022-04-28 08:16:15,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 649. [2022-04-28 08:16:15,029 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:15,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 651 states. Second operand has 649 states, 645 states have (on average 1.7178294573643411) internal successors, (1108), 645 states have internal predecessors, (1108), 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-28 08:16:15,031 INFO L74 IsIncluded]: Start isIncluded. First operand 651 states. Second operand has 649 states, 645 states have (on average 1.7178294573643411) internal successors, (1108), 645 states have internal predecessors, (1108), 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-28 08:16:15,032 INFO L87 Difference]: Start difference. First operand 651 states. Second operand has 649 states, 645 states have (on average 1.7178294573643411) internal successors, (1108), 645 states have internal predecessors, (1108), 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-28 08:16:15,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:15,050 INFO L93 Difference]: Finished difference Result 651 states and 1112 transitions. [2022-04-28 08:16:15,050 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1112 transitions. [2022-04-28 08:16:15,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:15,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:15,052 INFO L74 IsIncluded]: Start isIncluded. First operand has 649 states, 645 states have (on average 1.7178294573643411) internal successors, (1108), 645 states have internal predecessors, (1108), 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 651 states. [2022-04-28 08:16:15,052 INFO L87 Difference]: Start difference. First operand has 649 states, 645 states have (on average 1.7178294573643411) internal successors, (1108), 645 states have internal predecessors, (1108), 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 651 states. [2022-04-28 08:16:15,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:15,067 INFO L93 Difference]: Finished difference Result 651 states and 1112 transitions. [2022-04-28 08:16:15,067 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1112 transitions. [2022-04-28 08:16:15,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:15,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:15,068 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:15,068 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:15,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 645 states have (on average 1.7178294573643411) internal successors, (1108), 645 states have internal predecessors, (1108), 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-28 08:16:15,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1111 transitions. [2022-04-28 08:16:15,087 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1111 transitions. Word has length 28 [2022-04-28 08:16:15,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:15,087 INFO L495 AbstractCegarLoop]: Abstraction has 649 states and 1111 transitions. [2022-04-28 08:16:15,087 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-28 08:16:15,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 649 states and 1111 transitions. [2022-04-28 08:16:16,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1111 edges. 1111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:16,006 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1111 transitions. [2022-04-28 08:16:16,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 08:16:16,007 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:16,007 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-28 08:16:16,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 08:16:16,008 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:16,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:16,008 INFO L85 PathProgramCache]: Analyzing trace with hash 789439413, now seen corresponding path program 1 times [2022-04-28 08:16:16,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:16,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [579075799] [2022-04-28 08:16:16,008 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:16,008 INFO L85 PathProgramCache]: Analyzing trace with hash 789439413, now seen corresponding path program 2 times [2022-04-28 08:16:16,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:16,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971427792] [2022-04-28 08:16:16,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:16,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:16,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:16,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:16,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {23585#(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); {23579#true} is VALID [2022-04-28 08:16:16,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {23579#true} assume true; {23579#true} is VALID [2022-04-28 08:16:16,050 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23579#true} {23579#true} #251#return; {23579#true} is VALID [2022-04-28 08:16:16,050 INFO L272 TraceCheckUtils]: 0: Hoare triple {23579#true} call ULTIMATE.init(); {23585#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:16,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {23585#(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); {23579#true} is VALID [2022-04-28 08:16:16,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {23579#true} assume true; {23579#true} is VALID [2022-04-28 08:16:16,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23579#true} {23579#true} #251#return; {23579#true} is VALID [2022-04-28 08:16:16,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {23579#true} call #t~ret18 := main(); {23579#true} is VALID [2022-04-28 08:16:16,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {23579#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {23579#true} is VALID [2022-04-28 08:16:16,051 INFO L290 TraceCheckUtils]: 6: Hoare triple {23579#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {23579#true} is VALID [2022-04-28 08:16:16,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {23579#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {23579#true} is VALID [2022-04-28 08:16:16,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {23579#true} assume !(0 != ~p1~0); {23579#true} is VALID [2022-04-28 08:16:16,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {23579#true} assume !(0 != ~p2~0); {23579#true} is VALID [2022-04-28 08:16:16,051 INFO L290 TraceCheckUtils]: 10: Hoare triple {23579#true} assume !(0 != ~p3~0); {23579#true} is VALID [2022-04-28 08:16:16,051 INFO L290 TraceCheckUtils]: 11: Hoare triple {23579#true} assume !(0 != ~p4~0); {23579#true} is VALID [2022-04-28 08:16:16,051 INFO L290 TraceCheckUtils]: 12: Hoare triple {23579#true} assume 0 != ~p5~0;~lk5~0 := 1; {23584#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:16,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {23584#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {23584#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:16,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {23584#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {23584#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:16,056 INFO L290 TraceCheckUtils]: 15: Hoare triple {23584#(= main_~lk5~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {23584#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:16,056 INFO L290 TraceCheckUtils]: 16: Hoare triple {23584#(= main_~lk5~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {23584#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:16,056 INFO L290 TraceCheckUtils]: 17: Hoare triple {23584#(= main_~lk5~0 1)} assume !(0 != ~p10~0); {23584#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:16,057 INFO L290 TraceCheckUtils]: 18: Hoare triple {23584#(= main_~lk5~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {23584#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:16,057 INFO L290 TraceCheckUtils]: 19: Hoare triple {23584#(= main_~lk5~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {23584#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:16,057 INFO L290 TraceCheckUtils]: 20: Hoare triple {23584#(= main_~lk5~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {23584#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:16,057 INFO L290 TraceCheckUtils]: 21: Hoare triple {23584#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {23584#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:16,058 INFO L290 TraceCheckUtils]: 22: Hoare triple {23584#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {23584#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:16,058 INFO L290 TraceCheckUtils]: 23: Hoare triple {23584#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {23584#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:16,058 INFO L290 TraceCheckUtils]: 24: Hoare triple {23584#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {23584#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:16,058 INFO L290 TraceCheckUtils]: 25: Hoare triple {23584#(= main_~lk5~0 1)} assume 0 != ~p5~0; {23584#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:16,059 INFO L290 TraceCheckUtils]: 26: Hoare triple {23584#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {23580#false} is VALID [2022-04-28 08:16:16,059 INFO L290 TraceCheckUtils]: 27: Hoare triple {23580#false} assume !false; {23580#false} is VALID [2022-04-28 08:16:16,059 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-28 08:16:16,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:16,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971427792] [2022-04-28 08:16:16,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971427792] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:16,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:16,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:16,060 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:16,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [579075799] [2022-04-28 08:16:16,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [579075799] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:16,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:16,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:16,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037557586] [2022-04-28 08:16:16,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:16,061 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-28 08:16:16,061 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:16,061 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-28 08:16:16,075 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-28 08:16:16,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:16,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:16,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:16,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:16,076 INFO L87 Difference]: Start difference. First operand 649 states and 1111 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-28 08:16:16,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:16,357 INFO L93 Difference]: Finished difference Result 1197 states and 2081 transitions. [2022-04-28 08:16:16,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:16,358 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-28 08:16:16,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:16,358 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-28 08:16:16,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-28 08:16:16,359 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-28 08:16:16,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-28 08:16:16,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 151 transitions. [2022-04-28 08:16:16,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:16,550 INFO L225 Difference]: With dead ends: 1197 [2022-04-28 08:16:16,550 INFO L226 Difference]: Without dead ends: 1195 [2022-04-28 08:16:16,550 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-28 08:16:16,552 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 191 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:16,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 92 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:16,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2022-04-28 08:16:16,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 905. [2022-04-28 08:16:16,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:16,601 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1195 states. Second operand has 905 states, 901 states have (on average 1.6825749167591566) internal successors, (1516), 901 states have internal predecessors, (1516), 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-28 08:16:16,602 INFO L74 IsIncluded]: Start isIncluded. First operand 1195 states. Second operand has 905 states, 901 states have (on average 1.6825749167591566) internal successors, (1516), 901 states have internal predecessors, (1516), 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-28 08:16:16,603 INFO L87 Difference]: Start difference. First operand 1195 states. Second operand has 905 states, 901 states have (on average 1.6825749167591566) internal successors, (1516), 901 states have internal predecessors, (1516), 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-28 08:16:16,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:16,653 INFO L93 Difference]: Finished difference Result 1195 states and 2064 transitions. [2022-04-28 08:16:16,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 2064 transitions. [2022-04-28 08:16:16,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:16,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:16,656 INFO L74 IsIncluded]: Start isIncluded. First operand has 905 states, 901 states have (on average 1.6825749167591566) internal successors, (1516), 901 states have internal predecessors, (1516), 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 1195 states. [2022-04-28 08:16:16,657 INFO L87 Difference]: Start difference. First operand has 905 states, 901 states have (on average 1.6825749167591566) internal successors, (1516), 901 states have internal predecessors, (1516), 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 1195 states. [2022-04-28 08:16:16,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:16,714 INFO L93 Difference]: Finished difference Result 1195 states and 2064 transitions. [2022-04-28 08:16:16,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 2064 transitions. [2022-04-28 08:16:16,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:16,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:16,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:16,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:16,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 901 states have (on average 1.6825749167591566) internal successors, (1516), 901 states have internal predecessors, (1516), 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-28 08:16:16,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1519 transitions. [2022-04-28 08:16:16,750 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1519 transitions. Word has length 28 [2022-04-28 08:16:16,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:16,750 INFO L495 AbstractCegarLoop]: Abstraction has 905 states and 1519 transitions. [2022-04-28 08:16:16,750 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-28 08:16:16,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 905 states and 1519 transitions. [2022-04-28 08:16:18,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1519 edges. 1519 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:18,080 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1519 transitions. [2022-04-28 08:16:18,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 08:16:18,081 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:18,081 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-28 08:16:18,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 08:16:18,082 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:18,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:18,082 INFO L85 PathProgramCache]: Analyzing trace with hash -231628941, now seen corresponding path program 1 times [2022-04-28 08:16:18,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:18,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1295297438] [2022-04-28 08:16:18,082 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:18,082 INFO L85 PathProgramCache]: Analyzing trace with hash -231628941, now seen corresponding path program 2 times [2022-04-28 08:16:18,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:18,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283870432] [2022-04-28 08:16:18,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:18,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:18,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:18,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:18,116 INFO L290 TraceCheckUtils]: 0: Hoare triple {30191#(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); {30185#true} is VALID [2022-04-28 08:16:18,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {30185#true} assume true; {30185#true} is VALID [2022-04-28 08:16:18,116 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30185#true} {30185#true} #251#return; {30185#true} is VALID [2022-04-28 08:16:18,117 INFO L272 TraceCheckUtils]: 0: Hoare triple {30185#true} call ULTIMATE.init(); {30191#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:18,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {30191#(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); {30185#true} is VALID [2022-04-28 08:16:18,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {30185#true} assume true; {30185#true} is VALID [2022-04-28 08:16:18,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30185#true} {30185#true} #251#return; {30185#true} is VALID [2022-04-28 08:16:18,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {30185#true} call #t~ret18 := main(); {30185#true} is VALID [2022-04-28 08:16:18,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {30185#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {30185#true} is VALID [2022-04-28 08:16:18,117 INFO L290 TraceCheckUtils]: 6: Hoare triple {30185#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {30185#true} is VALID [2022-04-28 08:16:18,117 INFO L290 TraceCheckUtils]: 7: Hoare triple {30185#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {30185#true} is VALID [2022-04-28 08:16:18,117 INFO L290 TraceCheckUtils]: 8: Hoare triple {30185#true} assume !(0 != ~p1~0); {30185#true} is VALID [2022-04-28 08:16:18,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {30185#true} assume !(0 != ~p2~0); {30185#true} is VALID [2022-04-28 08:16:18,117 INFO L290 TraceCheckUtils]: 10: Hoare triple {30185#true} assume !(0 != ~p3~0); {30185#true} is VALID [2022-04-28 08:16:18,117 INFO L290 TraceCheckUtils]: 11: Hoare triple {30185#true} assume !(0 != ~p4~0); {30185#true} is VALID [2022-04-28 08:16:18,118 INFO L290 TraceCheckUtils]: 12: Hoare triple {30185#true} assume !(0 != ~p5~0); {30190#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:18,118 INFO L290 TraceCheckUtils]: 13: Hoare triple {30190#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {30190#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:18,118 INFO L290 TraceCheckUtils]: 14: Hoare triple {30190#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {30190#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:18,119 INFO L290 TraceCheckUtils]: 15: Hoare triple {30190#(= main_~p5~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {30190#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:18,119 INFO L290 TraceCheckUtils]: 16: Hoare triple {30190#(= main_~p5~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {30190#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:18,119 INFO L290 TraceCheckUtils]: 17: Hoare triple {30190#(= main_~p5~0 0)} assume !(0 != ~p10~0); {30190#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:18,119 INFO L290 TraceCheckUtils]: 18: Hoare triple {30190#(= main_~p5~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {30190#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:18,120 INFO L290 TraceCheckUtils]: 19: Hoare triple {30190#(= main_~p5~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {30190#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:18,120 INFO L290 TraceCheckUtils]: 20: Hoare triple {30190#(= main_~p5~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {30190#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:18,120 INFO L290 TraceCheckUtils]: 21: Hoare triple {30190#(= main_~p5~0 0)} assume !(0 != ~p1~0); {30190#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:18,121 INFO L290 TraceCheckUtils]: 22: Hoare triple {30190#(= main_~p5~0 0)} assume !(0 != ~p2~0); {30190#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:18,121 INFO L290 TraceCheckUtils]: 23: Hoare triple {30190#(= main_~p5~0 0)} assume !(0 != ~p3~0); {30190#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:18,121 INFO L290 TraceCheckUtils]: 24: Hoare triple {30190#(= main_~p5~0 0)} assume !(0 != ~p4~0); {30190#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:18,121 INFO L290 TraceCheckUtils]: 25: Hoare triple {30190#(= main_~p5~0 0)} assume 0 != ~p5~0; {30186#false} is VALID [2022-04-28 08:16:18,124 INFO L290 TraceCheckUtils]: 26: Hoare triple {30186#false} assume 1 != ~lk5~0; {30186#false} is VALID [2022-04-28 08:16:18,124 INFO L290 TraceCheckUtils]: 27: Hoare triple {30186#false} assume !false; {30186#false} is VALID [2022-04-28 08:16:18,124 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-28 08:16:18,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:18,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283870432] [2022-04-28 08:16:18,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283870432] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:18,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:18,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:18,125 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:18,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1295297438] [2022-04-28 08:16:18,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1295297438] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:18,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:18,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:18,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673179359] [2022-04-28 08:16:18,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:18,126 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-28 08:16:18,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:18,126 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-28 08:16:18,141 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-28 08:16:18,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:18,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:18,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:18,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:18,142 INFO L87 Difference]: Start difference. First operand 905 states and 1519 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-28 08:16:18,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:18,613 INFO L93 Difference]: Finished difference Result 2141 states and 3617 transitions. [2022-04-28 08:16:18,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:18,613 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-28 08:16:18,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:18,613 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-28 08:16:18,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 234 transitions. [2022-04-28 08:16:18,615 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-28 08:16:18,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 234 transitions. [2022-04-28 08:16:18,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 234 transitions. [2022-04-28 08:16:18,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:18,823 INFO L225 Difference]: With dead ends: 2141 [2022-04-28 08:16:18,823 INFO L226 Difference]: Without dead ends: 1259 [2022-04-28 08:16:18,824 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-28 08:16:18,824 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 169 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:18,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 127 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:16:18,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2022-04-28 08:16:18,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 1257. [2022-04-28 08:16:18,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:18,896 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1259 states. Second operand has 1257 states, 1253 states have (on average 1.675977653631285) internal successors, (2100), 1253 states have internal predecessors, (2100), 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-28 08:16:18,897 INFO L74 IsIncluded]: Start isIncluded. First operand 1259 states. Second operand has 1257 states, 1253 states have (on average 1.675977653631285) internal successors, (2100), 1253 states have internal predecessors, (2100), 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-28 08:16:18,898 INFO L87 Difference]: Start difference. First operand 1259 states. Second operand has 1257 states, 1253 states have (on average 1.675977653631285) internal successors, (2100), 1253 states have internal predecessors, (2100), 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-28 08:16:18,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:18,940 INFO L93 Difference]: Finished difference Result 1259 states and 2104 transitions. [2022-04-28 08:16:18,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 2104 transitions. [2022-04-28 08:16:18,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:18,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:18,943 INFO L74 IsIncluded]: Start isIncluded. First operand has 1257 states, 1253 states have (on average 1.675977653631285) internal successors, (2100), 1253 states have internal predecessors, (2100), 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 1259 states. [2022-04-28 08:16:18,944 INFO L87 Difference]: Start difference. First operand has 1257 states, 1253 states have (on average 1.675977653631285) internal successors, (2100), 1253 states have internal predecessors, (2100), 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 1259 states. [2022-04-28 08:16:18,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:18,986 INFO L93 Difference]: Finished difference Result 1259 states and 2104 transitions. [2022-04-28 08:16:18,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 2104 transitions. [2022-04-28 08:16:18,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:18,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:18,987 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:18,987 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:18,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1257 states, 1253 states have (on average 1.675977653631285) internal successors, (2100), 1253 states have internal predecessors, (2100), 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-28 08:16:19,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 2103 transitions. [2022-04-28 08:16:19,064 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 2103 transitions. Word has length 28 [2022-04-28 08:16:19,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:19,064 INFO L495 AbstractCegarLoop]: Abstraction has 1257 states and 2103 transitions. [2022-04-28 08:16:19,064 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-28 08:16:19,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1257 states and 2103 transitions. [2022-04-28 08:16:20,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2103 edges. 2103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:20,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 2103 transitions. [2022-04-28 08:16:20,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 08:16:20,899 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:20,899 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-28 08:16:20,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 08:16:20,900 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:20,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:20,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1296968198, now seen corresponding path program 1 times [2022-04-28 08:16:20,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:20,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1960913319] [2022-04-28 08:16:20,900 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:20,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1296968198, now seen corresponding path program 2 times [2022-04-28 08:16:20,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:20,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725123819] [2022-04-28 08:16:20,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:20,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:20,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:20,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:20,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:20,937 INFO L290 TraceCheckUtils]: 0: Hoare triple {39517#(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); {39511#true} is VALID [2022-04-28 08:16:20,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {39511#true} assume true; {39511#true} is VALID [2022-04-28 08:16:20,937 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39511#true} {39511#true} #251#return; {39511#true} is VALID [2022-04-28 08:16:20,942 INFO L272 TraceCheckUtils]: 0: Hoare triple {39511#true} call ULTIMATE.init(); {39517#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:20,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {39517#(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); {39511#true} is VALID [2022-04-28 08:16:20,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {39511#true} assume true; {39511#true} is VALID [2022-04-28 08:16:20,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39511#true} {39511#true} #251#return; {39511#true} is VALID [2022-04-28 08:16:20,942 INFO L272 TraceCheckUtils]: 4: Hoare triple {39511#true} call #t~ret18 := main(); {39511#true} is VALID [2022-04-28 08:16:20,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {39511#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {39511#true} is VALID [2022-04-28 08:16:20,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {39511#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {39511#true} is VALID [2022-04-28 08:16:20,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {39511#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {39511#true} is VALID [2022-04-28 08:16:20,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {39511#true} assume !(0 != ~p1~0); {39511#true} is VALID [2022-04-28 08:16:20,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {39511#true} assume !(0 != ~p2~0); {39511#true} is VALID [2022-04-28 08:16:20,942 INFO L290 TraceCheckUtils]: 10: Hoare triple {39511#true} assume !(0 != ~p3~0); {39511#true} is VALID [2022-04-28 08:16:20,942 INFO L290 TraceCheckUtils]: 11: Hoare triple {39511#true} assume !(0 != ~p4~0); {39511#true} is VALID [2022-04-28 08:16:20,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {39511#true} assume 0 != ~p5~0;~lk5~0 := 1; {39516#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:20,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {39516#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {39516#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:20,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {39516#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {39516#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:20,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {39516#(not (= main_~p5~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {39516#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:20,946 INFO L290 TraceCheckUtils]: 16: Hoare triple {39516#(not (= main_~p5~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {39516#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:20,946 INFO L290 TraceCheckUtils]: 17: Hoare triple {39516#(not (= main_~p5~0 0))} assume !(0 != ~p10~0); {39516#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:20,946 INFO L290 TraceCheckUtils]: 18: Hoare triple {39516#(not (= main_~p5~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {39516#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:20,947 INFO L290 TraceCheckUtils]: 19: Hoare triple {39516#(not (= main_~p5~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {39516#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:20,947 INFO L290 TraceCheckUtils]: 20: Hoare triple {39516#(not (= main_~p5~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {39516#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:20,947 INFO L290 TraceCheckUtils]: 21: Hoare triple {39516#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {39516#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:20,947 INFO L290 TraceCheckUtils]: 22: Hoare triple {39516#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {39516#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:20,948 INFO L290 TraceCheckUtils]: 23: Hoare triple {39516#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {39516#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:20,948 INFO L290 TraceCheckUtils]: 24: Hoare triple {39516#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {39516#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:20,948 INFO L290 TraceCheckUtils]: 25: Hoare triple {39516#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {39512#false} is VALID [2022-04-28 08:16:20,948 INFO L290 TraceCheckUtils]: 26: Hoare triple {39512#false} assume 0 != ~p6~0; {39512#false} is VALID [2022-04-28 08:16:20,948 INFO L290 TraceCheckUtils]: 27: Hoare triple {39512#false} assume 1 != ~lk6~0; {39512#false} is VALID [2022-04-28 08:16:20,948 INFO L290 TraceCheckUtils]: 28: Hoare triple {39512#false} assume !false; {39512#false} is VALID [2022-04-28 08:16:20,948 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-28 08:16:20,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:20,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725123819] [2022-04-28 08:16:20,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725123819] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:20,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:20,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:20,949 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:20,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1960913319] [2022-04-28 08:16:20,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1960913319] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:20,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:20,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:20,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136177829] [2022-04-28 08:16:20,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:20,950 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-28 08:16:20,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:20,950 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-28 08:16:20,966 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-28 08:16:20,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:20,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:20,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:20,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:20,967 INFO L87 Difference]: Start difference. First operand 1257 states and 2103 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-28 08:16:21,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:21,349 INFO L93 Difference]: Finished difference Result 1885 states and 3145 transitions. [2022-04-28 08:16:21,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:21,349 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-28 08:16:21,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:21,350 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-28 08:16:21,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 229 transitions. [2022-04-28 08:16:21,352 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-28 08:16:21,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 229 transitions. [2022-04-28 08:16:21,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 229 transitions. [2022-04-28 08:16:21,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 229 edges. 229 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:21,540 INFO L225 Difference]: With dead ends: 1885 [2022-04-28 08:16:21,541 INFO L226 Difference]: Without dead ends: 1275 [2022-04-28 08:16:21,542 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-28 08:16:21,542 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 166 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:21,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 131 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:21,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2022-04-28 08:16:21,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1273. [2022-04-28 08:16:21,614 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:21,616 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1275 states. Second operand has 1273 states, 1269 states have (on average 1.6548463356973995) internal successors, (2100), 1269 states have internal predecessors, (2100), 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-28 08:16:21,617 INFO L74 IsIncluded]: Start isIncluded. First operand 1275 states. Second operand has 1273 states, 1269 states have (on average 1.6548463356973995) internal successors, (2100), 1269 states have internal predecessors, (2100), 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-28 08:16:21,618 INFO L87 Difference]: Start difference. First operand 1275 states. Second operand has 1273 states, 1269 states have (on average 1.6548463356973995) internal successors, (2100), 1269 states have internal predecessors, (2100), 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-28 08:16:21,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:21,661 INFO L93 Difference]: Finished difference Result 1275 states and 2104 transitions. [2022-04-28 08:16:21,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 2104 transitions. [2022-04-28 08:16:21,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:21,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:21,663 INFO L74 IsIncluded]: Start isIncluded. First operand has 1273 states, 1269 states have (on average 1.6548463356973995) internal successors, (2100), 1269 states have internal predecessors, (2100), 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 1275 states. [2022-04-28 08:16:21,664 INFO L87 Difference]: Start difference. First operand has 1273 states, 1269 states have (on average 1.6548463356973995) internal successors, (2100), 1269 states have internal predecessors, (2100), 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 1275 states. [2022-04-28 08:16:21,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:21,708 INFO L93 Difference]: Finished difference Result 1275 states and 2104 transitions. [2022-04-28 08:16:21,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 2104 transitions. [2022-04-28 08:16:21,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:21,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:21,709 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:21,709 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:21,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1273 states, 1269 states have (on average 1.6548463356973995) internal successors, (2100), 1269 states have internal predecessors, (2100), 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-28 08:16:21,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 2103 transitions. [2022-04-28 08:16:21,776 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 2103 transitions. Word has length 29 [2022-04-28 08:16:21,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:21,776 INFO L495 AbstractCegarLoop]: Abstraction has 1273 states and 2103 transitions. [2022-04-28 08:16:21,776 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-28 08:16:21,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1273 states and 2103 transitions. [2022-04-28 08:16:23,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2103 edges. 2103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:23,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 2103 transitions. [2022-04-28 08:16:23,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 08:16:23,677 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:23,680 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-28 08:16:23,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 08:16:23,681 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:23,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:23,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1409651196, now seen corresponding path program 1 times [2022-04-28 08:16:23,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:23,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [990535035] [2022-04-28 08:16:23,681 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:23,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1409651196, now seen corresponding path program 2 times [2022-04-28 08:16:23,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:23,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978618492] [2022-04-28 08:16:23,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:23,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:23,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:23,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:23,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:23,729 INFO L290 TraceCheckUtils]: 0: Hoare triple {48395#(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); {48389#true} is VALID [2022-04-28 08:16:23,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {48389#true} assume true; {48389#true} is VALID [2022-04-28 08:16:23,729 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48389#true} {48389#true} #251#return; {48389#true} is VALID [2022-04-28 08:16:23,731 INFO L272 TraceCheckUtils]: 0: Hoare triple {48389#true} call ULTIMATE.init(); {48395#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:23,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {48395#(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); {48389#true} is VALID [2022-04-28 08:16:23,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {48389#true} assume true; {48389#true} is VALID [2022-04-28 08:16:23,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48389#true} {48389#true} #251#return; {48389#true} is VALID [2022-04-28 08:16:23,732 INFO L272 TraceCheckUtils]: 4: Hoare triple {48389#true} call #t~ret18 := main(); {48389#true} is VALID [2022-04-28 08:16:23,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {48389#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {48389#true} is VALID [2022-04-28 08:16:23,732 INFO L290 TraceCheckUtils]: 6: Hoare triple {48389#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {48389#true} is VALID [2022-04-28 08:16:23,732 INFO L290 TraceCheckUtils]: 7: Hoare triple {48389#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {48389#true} is VALID [2022-04-28 08:16:23,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {48389#true} assume !(0 != ~p1~0); {48389#true} is VALID [2022-04-28 08:16:23,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {48389#true} assume !(0 != ~p2~0); {48389#true} is VALID [2022-04-28 08:16:23,732 INFO L290 TraceCheckUtils]: 10: Hoare triple {48389#true} assume !(0 != ~p3~0); {48389#true} is VALID [2022-04-28 08:16:23,732 INFO L290 TraceCheckUtils]: 11: Hoare triple {48389#true} assume !(0 != ~p4~0); {48389#true} is VALID [2022-04-28 08:16:23,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {48389#true} assume !(0 != ~p5~0); {48389#true} is VALID [2022-04-28 08:16:23,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {48389#true} assume 0 != ~p6~0;~lk6~0 := 1; {48394#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:23,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {48394#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {48394#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:23,733 INFO L290 TraceCheckUtils]: 15: Hoare triple {48394#(= main_~lk6~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {48394#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:23,733 INFO L290 TraceCheckUtils]: 16: Hoare triple {48394#(= main_~lk6~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {48394#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:23,733 INFO L290 TraceCheckUtils]: 17: Hoare triple {48394#(= main_~lk6~0 1)} assume !(0 != ~p10~0); {48394#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:23,734 INFO L290 TraceCheckUtils]: 18: Hoare triple {48394#(= main_~lk6~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {48394#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:23,734 INFO L290 TraceCheckUtils]: 19: Hoare triple {48394#(= main_~lk6~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {48394#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:23,734 INFO L290 TraceCheckUtils]: 20: Hoare triple {48394#(= main_~lk6~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {48394#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:23,734 INFO L290 TraceCheckUtils]: 21: Hoare triple {48394#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {48394#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:23,735 INFO L290 TraceCheckUtils]: 22: Hoare triple {48394#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {48394#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:23,735 INFO L290 TraceCheckUtils]: 23: Hoare triple {48394#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {48394#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:23,735 INFO L290 TraceCheckUtils]: 24: Hoare triple {48394#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {48394#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:23,735 INFO L290 TraceCheckUtils]: 25: Hoare triple {48394#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {48394#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:23,736 INFO L290 TraceCheckUtils]: 26: Hoare triple {48394#(= main_~lk6~0 1)} assume 0 != ~p6~0; {48394#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:23,736 INFO L290 TraceCheckUtils]: 27: Hoare triple {48394#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {48390#false} is VALID [2022-04-28 08:16:23,737 INFO L290 TraceCheckUtils]: 28: Hoare triple {48390#false} assume !false; {48390#false} is VALID [2022-04-28 08:16:23,737 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-28 08:16:23,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:23,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978618492] [2022-04-28 08:16:23,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978618492] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:23,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:23,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:23,737 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:23,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [990535035] [2022-04-28 08:16:23,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [990535035] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:23,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:23,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:23,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569075045] [2022-04-28 08:16:23,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:23,739 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-28 08:16:23,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:23,739 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-28 08:16:23,754 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-28 08:16:23,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:23,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:23,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:23,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:23,755 INFO L87 Difference]: Start difference. First operand 1273 states and 2103 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-28 08:16:24,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:24,264 INFO L93 Difference]: Finished difference Result 2317 states and 3897 transitions. [2022-04-28 08:16:24,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:24,264 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-28 08:16:24,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:24,265 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-28 08:16:24,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-28 08:16:24,266 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-28 08:16:24,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-28 08:16:24,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 147 transitions. [2022-04-28 08:16:24,367 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-28 08:16:24,601 INFO L225 Difference]: With dead ends: 2317 [2022-04-28 08:16:24,601 INFO L226 Difference]: Without dead ends: 2315 [2022-04-28 08:16:24,601 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-28 08:16:24,603 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 184 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:24,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 91 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:24,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2315 states. [2022-04-28 08:16:24,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2315 to 1801. [2022-04-28 08:16:24,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:24,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2315 states. Second operand has 1801 states, 1797 states have (on average 1.613800779076238) internal successors, (2900), 1797 states have internal predecessors, (2900), 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-28 08:16:24,727 INFO L74 IsIncluded]: Start isIncluded. First operand 2315 states. Second operand has 1801 states, 1797 states have (on average 1.613800779076238) internal successors, (2900), 1797 states have internal predecessors, (2900), 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-28 08:16:24,728 INFO L87 Difference]: Start difference. First operand 2315 states. Second operand has 1801 states, 1797 states have (on average 1.613800779076238) internal successors, (2900), 1797 states have internal predecessors, (2900), 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-28 08:16:24,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:24,865 INFO L93 Difference]: Finished difference Result 2315 states and 3864 transitions. [2022-04-28 08:16:24,865 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3864 transitions. [2022-04-28 08:16:24,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:24,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:24,869 INFO L74 IsIncluded]: Start isIncluded. First operand has 1801 states, 1797 states have (on average 1.613800779076238) internal successors, (2900), 1797 states have internal predecessors, (2900), 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-28 08:16:24,870 INFO L87 Difference]: Start difference. First operand has 1801 states, 1797 states have (on average 1.613800779076238) internal successors, (2900), 1797 states have internal predecessors, (2900), 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-28 08:16:25,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:25,016 INFO L93 Difference]: Finished difference Result 2315 states and 3864 transitions. [2022-04-28 08:16:25,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3864 transitions. [2022-04-28 08:16:25,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:25,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:25,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:25,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:25,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1801 states, 1797 states have (on average 1.613800779076238) internal successors, (2900), 1797 states have internal predecessors, (2900), 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-28 08:16:25,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 2903 transitions. [2022-04-28 08:16:25,152 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 2903 transitions. Word has length 29 [2022-04-28 08:16:25,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:25,152 INFO L495 AbstractCegarLoop]: Abstraction has 1801 states and 2903 transitions. [2022-04-28 08:16:25,153 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-28 08:16:25,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1801 states and 2903 transitions. [2022-04-28 08:16:27,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2903 edges. 2903 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:27,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2903 transitions. [2022-04-28 08:16:27,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 08:16:27,707 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:27,707 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-28 08:16:27,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 08:16:27,707 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:27,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:27,707 INFO L85 PathProgramCache]: Analyzing trace with hash 388582842, now seen corresponding path program 1 times [2022-04-28 08:16:27,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:27,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1738747483] [2022-04-28 08:16:27,711 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:27,711 INFO L85 PathProgramCache]: Analyzing trace with hash 388582842, now seen corresponding path program 2 times [2022-04-28 08:16:27,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:27,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266327745] [2022-04-28 08:16:27,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:27,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:27,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:27,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:27,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:27,747 INFO L290 TraceCheckUtils]: 0: Hoare triple {61273#(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); {61267#true} is VALID [2022-04-28 08:16:27,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {61267#true} assume true; {61267#true} is VALID [2022-04-28 08:16:27,747 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {61267#true} {61267#true} #251#return; {61267#true} is VALID [2022-04-28 08:16:27,748 INFO L272 TraceCheckUtils]: 0: Hoare triple {61267#true} call ULTIMATE.init(); {61273#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:27,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {61273#(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); {61267#true} is VALID [2022-04-28 08:16:27,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {61267#true} assume true; {61267#true} is VALID [2022-04-28 08:16:27,748 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61267#true} {61267#true} #251#return; {61267#true} is VALID [2022-04-28 08:16:27,748 INFO L272 TraceCheckUtils]: 4: Hoare triple {61267#true} call #t~ret18 := main(); {61267#true} is VALID [2022-04-28 08:16:27,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {61267#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {61267#true} is VALID [2022-04-28 08:16:27,748 INFO L290 TraceCheckUtils]: 6: Hoare triple {61267#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {61267#true} is VALID [2022-04-28 08:16:27,748 INFO L290 TraceCheckUtils]: 7: Hoare triple {61267#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {61267#true} is VALID [2022-04-28 08:16:27,748 INFO L290 TraceCheckUtils]: 8: Hoare triple {61267#true} assume !(0 != ~p1~0); {61267#true} is VALID [2022-04-28 08:16:27,748 INFO L290 TraceCheckUtils]: 9: Hoare triple {61267#true} assume !(0 != ~p2~0); {61267#true} is VALID [2022-04-28 08:16:27,749 INFO L290 TraceCheckUtils]: 10: Hoare triple {61267#true} assume !(0 != ~p3~0); {61267#true} is VALID [2022-04-28 08:16:27,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {61267#true} assume !(0 != ~p4~0); {61267#true} is VALID [2022-04-28 08:16:27,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {61267#true} assume !(0 != ~p5~0); {61267#true} is VALID [2022-04-28 08:16:27,749 INFO L290 TraceCheckUtils]: 13: Hoare triple {61267#true} assume !(0 != ~p6~0); {61272#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:27,749 INFO L290 TraceCheckUtils]: 14: Hoare triple {61272#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {61272#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:27,749 INFO L290 TraceCheckUtils]: 15: Hoare triple {61272#(= main_~p6~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {61272#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:27,750 INFO L290 TraceCheckUtils]: 16: Hoare triple {61272#(= main_~p6~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {61272#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:27,750 INFO L290 TraceCheckUtils]: 17: Hoare triple {61272#(= main_~p6~0 0)} assume !(0 != ~p10~0); {61272#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:27,750 INFO L290 TraceCheckUtils]: 18: Hoare triple {61272#(= main_~p6~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {61272#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:27,751 INFO L290 TraceCheckUtils]: 19: Hoare triple {61272#(= main_~p6~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {61272#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:27,751 INFO L290 TraceCheckUtils]: 20: Hoare triple {61272#(= main_~p6~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {61272#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:27,751 INFO L290 TraceCheckUtils]: 21: Hoare triple {61272#(= main_~p6~0 0)} assume !(0 != ~p1~0); {61272#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:27,751 INFO L290 TraceCheckUtils]: 22: Hoare triple {61272#(= main_~p6~0 0)} assume !(0 != ~p2~0); {61272#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:27,752 INFO L290 TraceCheckUtils]: 23: Hoare triple {61272#(= main_~p6~0 0)} assume !(0 != ~p3~0); {61272#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:27,752 INFO L290 TraceCheckUtils]: 24: Hoare triple {61272#(= main_~p6~0 0)} assume !(0 != ~p4~0); {61272#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:27,753 INFO L290 TraceCheckUtils]: 25: Hoare triple {61272#(= main_~p6~0 0)} assume !(0 != ~p5~0); {61272#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:27,753 INFO L290 TraceCheckUtils]: 26: Hoare triple {61272#(= main_~p6~0 0)} assume 0 != ~p6~0; {61268#false} is VALID [2022-04-28 08:16:27,753 INFO L290 TraceCheckUtils]: 27: Hoare triple {61268#false} assume 1 != ~lk6~0; {61268#false} is VALID [2022-04-28 08:16:27,753 INFO L290 TraceCheckUtils]: 28: Hoare triple {61268#false} assume !false; {61268#false} is VALID [2022-04-28 08:16:27,753 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-28 08:16:27,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:27,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266327745] [2022-04-28 08:16:27,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266327745] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:27,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:27,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:27,754 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:27,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1738747483] [2022-04-28 08:16:27,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1738747483] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:27,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:27,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:27,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221270976] [2022-04-28 08:16:27,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:27,755 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-28 08:16:27,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:27,755 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-28 08:16:27,770 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-28 08:16:27,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:27,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:27,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:27,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:27,770 INFO L87 Difference]: Start difference. First operand 1801 states and 2903 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-28 08:16:28,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:28,847 INFO L93 Difference]: Finished difference Result 4237 states and 6873 transitions. [2022-04-28 08:16:28,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:28,847 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-28 08:16:28,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:28,847 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-28 08:16:28,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 231 transitions. [2022-04-28 08:16:28,850 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-28 08:16:28,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 231 transitions. [2022-04-28 08:16:28,851 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 231 transitions. [2022-04-28 08:16:28,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 231 edges. 231 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:29,209 INFO L225 Difference]: With dead ends: 4237 [2022-04-28 08:16:29,209 INFO L226 Difference]: Without dead ends: 2475 [2022-04-28 08:16:29,211 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-28 08:16:29,211 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 163 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:29,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 129 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:29,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2475 states. [2022-04-28 08:16:29,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2475 to 2473. [2022-04-28 08:16:29,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:29,369 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2475 states. Second operand has 2473 states, 2469 states have (on average 1.608748481166464) internal successors, (3972), 2469 states have internal predecessors, (3972), 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-28 08:16:29,371 INFO L74 IsIncluded]: Start isIncluded. First operand 2475 states. Second operand has 2473 states, 2469 states have (on average 1.608748481166464) internal successors, (3972), 2469 states have internal predecessors, (3972), 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-28 08:16:29,373 INFO L87 Difference]: Start difference. First operand 2475 states. Second operand has 2473 states, 2469 states have (on average 1.608748481166464) internal successors, (3972), 2469 states have internal predecessors, (3972), 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-28 08:16:29,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:29,521 INFO L93 Difference]: Finished difference Result 2475 states and 3976 transitions. [2022-04-28 08:16:29,521 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 3976 transitions. [2022-04-28 08:16:29,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:29,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:29,527 INFO L74 IsIncluded]: Start isIncluded. First operand has 2473 states, 2469 states have (on average 1.608748481166464) internal successors, (3972), 2469 states have internal predecessors, (3972), 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 2475 states. [2022-04-28 08:16:29,529 INFO L87 Difference]: Start difference. First operand has 2473 states, 2469 states have (on average 1.608748481166464) internal successors, (3972), 2469 states have internal predecessors, (3972), 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 2475 states. [2022-04-28 08:16:29,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:29,682 INFO L93 Difference]: Finished difference Result 2475 states and 3976 transitions. [2022-04-28 08:16:29,682 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 3976 transitions. [2022-04-28 08:16:29,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:29,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:29,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:29,685 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:29,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2473 states, 2469 states have (on average 1.608748481166464) internal successors, (3972), 2469 states have internal predecessors, (3972), 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-28 08:16:29,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2473 states to 2473 states and 3975 transitions. [2022-04-28 08:16:29,943 INFO L78 Accepts]: Start accepts. Automaton has 2473 states and 3975 transitions. Word has length 29 [2022-04-28 08:16:29,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:29,943 INFO L495 AbstractCegarLoop]: Abstraction has 2473 states and 3975 transitions. [2022-04-28 08:16:29,943 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-28 08:16:29,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2473 states and 3975 transitions. [2022-04-28 08:16:33,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3975 edges. 3975 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:33,679 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 3975 transitions. [2022-04-28 08:16:33,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 08:16:33,680 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:33,680 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-28 08:16:33,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 08:16:33,681 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:33,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:33,682 INFO L85 PathProgramCache]: Analyzing trace with hash 749728232, now seen corresponding path program 1 times [2022-04-28 08:16:33,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:33,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [210225706] [2022-04-28 08:16:33,686 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:33,686 INFO L85 PathProgramCache]: Analyzing trace with hash 749728232, now seen corresponding path program 2 times [2022-04-28 08:16:33,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:33,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37061006] [2022-04-28 08:16:33,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:33,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:33,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:33,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:33,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:33,723 INFO L290 TraceCheckUtils]: 0: Hoare triple {79655#(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); {79649#true} is VALID [2022-04-28 08:16:33,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {79649#true} assume true; {79649#true} is VALID [2022-04-28 08:16:33,723 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {79649#true} {79649#true} #251#return; {79649#true} is VALID [2022-04-28 08:16:33,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {79649#true} call ULTIMATE.init(); {79655#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:33,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {79655#(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); {79649#true} is VALID [2022-04-28 08:16:33,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {79649#true} assume true; {79649#true} is VALID [2022-04-28 08:16:33,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79649#true} {79649#true} #251#return; {79649#true} is VALID [2022-04-28 08:16:33,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {79649#true} call #t~ret18 := main(); {79649#true} is VALID [2022-04-28 08:16:33,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {79649#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {79649#true} is VALID [2022-04-28 08:16:33,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {79649#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {79649#true} is VALID [2022-04-28 08:16:33,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {79649#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {79649#true} is VALID [2022-04-28 08:16:33,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {79649#true} assume !(0 != ~p1~0); {79649#true} is VALID [2022-04-28 08:16:33,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {79649#true} assume !(0 != ~p2~0); {79649#true} is VALID [2022-04-28 08:16:33,724 INFO L290 TraceCheckUtils]: 10: Hoare triple {79649#true} assume !(0 != ~p3~0); {79649#true} is VALID [2022-04-28 08:16:33,724 INFO L290 TraceCheckUtils]: 11: Hoare triple {79649#true} assume !(0 != ~p4~0); {79649#true} is VALID [2022-04-28 08:16:33,724 INFO L290 TraceCheckUtils]: 12: Hoare triple {79649#true} assume !(0 != ~p5~0); {79649#true} is VALID [2022-04-28 08:16:33,724 INFO L290 TraceCheckUtils]: 13: Hoare triple {79649#true} assume 0 != ~p6~0;~lk6~0 := 1; {79654#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:33,724 INFO L290 TraceCheckUtils]: 14: Hoare triple {79654#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {79654#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:33,725 INFO L290 TraceCheckUtils]: 15: Hoare triple {79654#(not (= main_~p6~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {79654#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:33,725 INFO L290 TraceCheckUtils]: 16: Hoare triple {79654#(not (= main_~p6~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {79654#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:33,725 INFO L290 TraceCheckUtils]: 17: Hoare triple {79654#(not (= main_~p6~0 0))} assume !(0 != ~p10~0); {79654#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:33,725 INFO L290 TraceCheckUtils]: 18: Hoare triple {79654#(not (= main_~p6~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {79654#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:33,726 INFO L290 TraceCheckUtils]: 19: Hoare triple {79654#(not (= main_~p6~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {79654#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:33,726 INFO L290 TraceCheckUtils]: 20: Hoare triple {79654#(not (= main_~p6~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {79654#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:33,726 INFO L290 TraceCheckUtils]: 21: Hoare triple {79654#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {79654#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:33,726 INFO L290 TraceCheckUtils]: 22: Hoare triple {79654#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {79654#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:33,727 INFO L290 TraceCheckUtils]: 23: Hoare triple {79654#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {79654#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:33,727 INFO L290 TraceCheckUtils]: 24: Hoare triple {79654#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {79654#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:33,727 INFO L290 TraceCheckUtils]: 25: Hoare triple {79654#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {79654#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:33,727 INFO L290 TraceCheckUtils]: 26: Hoare triple {79654#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {79650#false} is VALID [2022-04-28 08:16:33,727 INFO L290 TraceCheckUtils]: 27: Hoare triple {79650#false} assume 0 != ~p7~0; {79650#false} is VALID [2022-04-28 08:16:33,727 INFO L290 TraceCheckUtils]: 28: Hoare triple {79650#false} assume 1 != ~lk7~0; {79650#false} is VALID [2022-04-28 08:16:33,727 INFO L290 TraceCheckUtils]: 29: Hoare triple {79650#false} assume !false; {79650#false} is VALID [2022-04-28 08:16:33,728 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-28 08:16:33,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:33,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37061006] [2022-04-28 08:16:33,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37061006] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:33,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:33,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:33,728 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:33,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [210225706] [2022-04-28 08:16:33,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [210225706] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:33,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:33,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:33,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387303856] [2022-04-28 08:16:33,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:33,729 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-28 08:16:33,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:33,729 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-28 08:16:33,743 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-28 08:16:33,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:33,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:33,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:33,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:33,744 INFO L87 Difference]: Start difference. First operand 2473 states and 3975 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-28 08:16:34,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:34,665 INFO L93 Difference]: Finished difference Result 3709 states and 5945 transitions. [2022-04-28 08:16:34,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:34,665 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-28 08:16:34,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:34,666 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-28 08:16:34,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 226 transitions. [2022-04-28 08:16:34,667 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-28 08:16:34,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 226 transitions. [2022-04-28 08:16:34,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 226 transitions. [2022-04-28 08:16:34,795 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-28 08:16:35,032 INFO L225 Difference]: With dead ends: 3709 [2022-04-28 08:16:35,032 INFO L226 Difference]: Without dead ends: 2507 [2022-04-28 08:16:35,034 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-28 08:16:35,034 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 165 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 128 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.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:35,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 128 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:35,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-04-28 08:16:35,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2505. [2022-04-28 08:16:35,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:35,199 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2507 states. Second operand has 2505 states, 2501 states have (on average 1.5881647341063574) internal successors, (3972), 2501 states have internal predecessors, (3972), 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-28 08:16:35,200 INFO L74 IsIncluded]: Start isIncluded. First operand 2507 states. Second operand has 2505 states, 2501 states have (on average 1.5881647341063574) internal successors, (3972), 2501 states have internal predecessors, (3972), 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-28 08:16:35,202 INFO L87 Difference]: Start difference. First operand 2507 states. Second operand has 2505 states, 2501 states have (on average 1.5881647341063574) internal successors, (3972), 2501 states have internal predecessors, (3972), 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-28 08:16:35,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:35,358 INFO L93 Difference]: Finished difference Result 2507 states and 3976 transitions. [2022-04-28 08:16:35,358 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3976 transitions. [2022-04-28 08:16:35,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:35,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:35,363 INFO L74 IsIncluded]: Start isIncluded. First operand has 2505 states, 2501 states have (on average 1.5881647341063574) internal successors, (3972), 2501 states have internal predecessors, (3972), 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 2507 states. [2022-04-28 08:16:35,364 INFO L87 Difference]: Start difference. First operand has 2505 states, 2501 states have (on average 1.5881647341063574) internal successors, (3972), 2501 states have internal predecessors, (3972), 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 2507 states. [2022-04-28 08:16:35,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:35,519 INFO L93 Difference]: Finished difference Result 2507 states and 3976 transitions. [2022-04-28 08:16:35,519 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3976 transitions. [2022-04-28 08:16:35,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:35,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:35,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:35,522 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:35,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2505 states, 2501 states have (on average 1.5881647341063574) internal successors, (3972), 2501 states have internal predecessors, (3972), 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-28 08:16:35,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2505 states and 3975 transitions. [2022-04-28 08:16:35,794 INFO L78 Accepts]: Start accepts. Automaton has 2505 states and 3975 transitions. Word has length 30 [2022-04-28 08:16:35,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:35,794 INFO L495 AbstractCegarLoop]: Abstraction has 2505 states and 3975 transitions. [2022-04-28 08:16:35,794 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-28 08:16:35,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2505 states and 3975 transitions. [2022-04-28 08:16:39,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3975 edges. 3975 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:39,640 INFO L276 IsEmpty]: Start isEmpty. Operand 2505 states and 3975 transitions. [2022-04-28 08:16:39,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 08:16:39,642 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:39,642 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-28 08:16:39,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 08:16:39,642 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:39,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:39,642 INFO L85 PathProgramCache]: Analyzing trace with hash -838619670, now seen corresponding path program 1 times [2022-04-28 08:16:39,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:39,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [379099712] [2022-04-28 08:16:39,643 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:39,643 INFO L85 PathProgramCache]: Analyzing trace with hash -838619670, now seen corresponding path program 2 times [2022-04-28 08:16:39,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:39,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302515642] [2022-04-28 08:16:39,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:39,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:39,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:39,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:39,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:39,681 INFO L290 TraceCheckUtils]: 0: Hoare triple {97109#(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); {97103#true} is VALID [2022-04-28 08:16:39,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {97103#true} assume true; {97103#true} is VALID [2022-04-28 08:16:39,681 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {97103#true} {97103#true} #251#return; {97103#true} is VALID [2022-04-28 08:16:39,682 INFO L272 TraceCheckUtils]: 0: Hoare triple {97103#true} call ULTIMATE.init(); {97109#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:39,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {97109#(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); {97103#true} is VALID [2022-04-28 08:16:39,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {97103#true} assume true; {97103#true} is VALID [2022-04-28 08:16:39,682 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {97103#true} {97103#true} #251#return; {97103#true} is VALID [2022-04-28 08:16:39,682 INFO L272 TraceCheckUtils]: 4: Hoare triple {97103#true} call #t~ret18 := main(); {97103#true} is VALID [2022-04-28 08:16:39,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {97103#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {97103#true} is VALID [2022-04-28 08:16:39,682 INFO L290 TraceCheckUtils]: 6: Hoare triple {97103#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {97103#true} is VALID [2022-04-28 08:16:39,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {97103#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {97103#true} is VALID [2022-04-28 08:16:39,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {97103#true} assume !(0 != ~p1~0); {97103#true} is VALID [2022-04-28 08:16:39,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {97103#true} assume !(0 != ~p2~0); {97103#true} is VALID [2022-04-28 08:16:39,682 INFO L290 TraceCheckUtils]: 10: Hoare triple {97103#true} assume !(0 != ~p3~0); {97103#true} is VALID [2022-04-28 08:16:39,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {97103#true} assume !(0 != ~p4~0); {97103#true} is VALID [2022-04-28 08:16:39,682 INFO L290 TraceCheckUtils]: 12: Hoare triple {97103#true} assume !(0 != ~p5~0); {97103#true} is VALID [2022-04-28 08:16:39,682 INFO L290 TraceCheckUtils]: 13: Hoare triple {97103#true} assume !(0 != ~p6~0); {97103#true} is VALID [2022-04-28 08:16:39,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {97103#true} assume 0 != ~p7~0;~lk7~0 := 1; {97108#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:39,683 INFO L290 TraceCheckUtils]: 15: Hoare triple {97108#(= main_~lk7~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {97108#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:39,683 INFO L290 TraceCheckUtils]: 16: Hoare triple {97108#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {97108#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:39,683 INFO L290 TraceCheckUtils]: 17: Hoare triple {97108#(= main_~lk7~0 1)} assume !(0 != ~p10~0); {97108#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:39,684 INFO L290 TraceCheckUtils]: 18: Hoare triple {97108#(= main_~lk7~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {97108#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:39,684 INFO L290 TraceCheckUtils]: 19: Hoare triple {97108#(= main_~lk7~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {97108#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:39,684 INFO L290 TraceCheckUtils]: 20: Hoare triple {97108#(= main_~lk7~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {97108#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:39,684 INFO L290 TraceCheckUtils]: 21: Hoare triple {97108#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {97108#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:39,685 INFO L290 TraceCheckUtils]: 22: Hoare triple {97108#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {97108#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:39,685 INFO L290 TraceCheckUtils]: 23: Hoare triple {97108#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {97108#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:39,685 INFO L290 TraceCheckUtils]: 24: Hoare triple {97108#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {97108#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:39,685 INFO L290 TraceCheckUtils]: 25: Hoare triple {97108#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {97108#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:39,685 INFO L290 TraceCheckUtils]: 26: Hoare triple {97108#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {97108#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:39,686 INFO L290 TraceCheckUtils]: 27: Hoare triple {97108#(= main_~lk7~0 1)} assume 0 != ~p7~0; {97108#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:39,686 INFO L290 TraceCheckUtils]: 28: Hoare triple {97108#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {97104#false} is VALID [2022-04-28 08:16:39,686 INFO L290 TraceCheckUtils]: 29: Hoare triple {97104#false} assume !false; {97104#false} is VALID [2022-04-28 08:16:39,686 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-28 08:16:39,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:39,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302515642] [2022-04-28 08:16:39,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302515642] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:39,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:39,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:39,686 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:39,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [379099712] [2022-04-28 08:16:39,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [379099712] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:39,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:39,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:39,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253587997] [2022-04-28 08:16:39,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:39,687 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-28 08:16:39,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:39,687 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-28 08:16:39,701 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-28 08:16:39,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:39,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:39,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:39,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:39,702 INFO L87 Difference]: Start difference. First operand 2505 states and 3975 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-28 08:16:41,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:41,025 INFO L93 Difference]: Finished difference Result 4493 states and 7273 transitions. [2022-04-28 08:16:41,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:41,026 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-28 08:16:41,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:41,026 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-28 08:16:41,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2022-04-28 08:16:41,027 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-28 08:16:41,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2022-04-28 08:16:41,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 143 transitions. [2022-04-28 08:16:41,116 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-28 08:16:41,930 INFO L225 Difference]: With dead ends: 4493 [2022-04-28 08:16:41,930 INFO L226 Difference]: Without dead ends: 4491 [2022-04-28 08:16:41,931 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-28 08:16:41,932 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 177 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:41,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 90 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:41,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4491 states. [2022-04-28 08:16:42,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4491 to 3593. [2022-04-28 08:16:42,163 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:42,168 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4491 states. Second operand has 3593 states, 3589 states have (on average 1.5436054611312344) internal successors, (5540), 3589 states have internal predecessors, (5540), 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-28 08:16:42,170 INFO L74 IsIncluded]: Start isIncluded. First operand 4491 states. Second operand has 3593 states, 3589 states have (on average 1.5436054611312344) internal successors, (5540), 3589 states have internal predecessors, (5540), 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-28 08:16:42,172 INFO L87 Difference]: Start difference. First operand 4491 states. Second operand has 3593 states, 3589 states have (on average 1.5436054611312344) internal successors, (5540), 3589 states have internal predecessors, (5540), 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-28 08:16:42,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:42,700 INFO L93 Difference]: Finished difference Result 4491 states and 7208 transitions. [2022-04-28 08:16:42,700 INFO L276 IsEmpty]: Start isEmpty. Operand 4491 states and 7208 transitions. [2022-04-28 08:16:42,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:42,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:42,708 INFO L74 IsIncluded]: Start isIncluded. First operand has 3593 states, 3589 states have (on average 1.5436054611312344) internal successors, (5540), 3589 states have internal predecessors, (5540), 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-28 08:16:42,710 INFO L87 Difference]: Start difference. First operand has 3593 states, 3589 states have (on average 1.5436054611312344) internal successors, (5540), 3589 states have internal predecessors, (5540), 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-28 08:16:43,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:43,248 INFO L93 Difference]: Finished difference Result 4491 states and 7208 transitions. [2022-04-28 08:16:43,248 INFO L276 IsEmpty]: Start isEmpty. Operand 4491 states and 7208 transitions. [2022-04-28 08:16:43,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:43,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:43,251 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:43,252 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:43,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3593 states, 3589 states have (on average 1.5436054611312344) internal successors, (5540), 3589 states have internal predecessors, (5540), 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-28 08:16:43,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3593 states to 3593 states and 5543 transitions. [2022-04-28 08:16:43,857 INFO L78 Accepts]: Start accepts. Automaton has 3593 states and 5543 transitions. Word has length 30 [2022-04-28 08:16:43,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:43,857 INFO L495 AbstractCegarLoop]: Abstraction has 3593 states and 5543 transitions. [2022-04-28 08:16:43,857 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-28 08:16:43,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3593 states and 5543 transitions. [2022-04-28 08:16:49,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5543 edges. 5543 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:49,041 INFO L276 IsEmpty]: Start isEmpty. Operand 3593 states and 5543 transitions. [2022-04-28 08:16:49,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 08:16:49,044 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:49,044 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-28 08:16:49,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-28 08:16:49,044 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:49,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:49,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1859688024, now seen corresponding path program 1 times [2022-04-28 08:16:49,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:49,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1367588525] [2022-04-28 08:16:49,045 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:49,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1859688024, now seen corresponding path program 2 times [2022-04-28 08:16:49,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:49,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814089595] [2022-04-28 08:16:49,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:49,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:49,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:49,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:49,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:49,090 INFO L290 TraceCheckUtils]: 0: Hoare triple {122275#(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); {122269#true} is VALID [2022-04-28 08:16:49,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {122269#true} assume true; {122269#true} is VALID [2022-04-28 08:16:49,090 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {122269#true} {122269#true} #251#return; {122269#true} is VALID [2022-04-28 08:16:49,091 INFO L272 TraceCheckUtils]: 0: Hoare triple {122269#true} call ULTIMATE.init(); {122275#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:49,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {122275#(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); {122269#true} is VALID [2022-04-28 08:16:49,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {122269#true} assume true; {122269#true} is VALID [2022-04-28 08:16:49,091 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {122269#true} {122269#true} #251#return; {122269#true} is VALID [2022-04-28 08:16:49,091 INFO L272 TraceCheckUtils]: 4: Hoare triple {122269#true} call #t~ret18 := main(); {122269#true} is VALID [2022-04-28 08:16:49,091 INFO L290 TraceCheckUtils]: 5: Hoare triple {122269#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {122269#true} is VALID [2022-04-28 08:16:49,091 INFO L290 TraceCheckUtils]: 6: Hoare triple {122269#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {122269#true} is VALID [2022-04-28 08:16:49,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {122269#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {122269#true} is VALID [2022-04-28 08:16:49,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {122269#true} assume !(0 != ~p1~0); {122269#true} is VALID [2022-04-28 08:16:49,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {122269#true} assume !(0 != ~p2~0); {122269#true} is VALID [2022-04-28 08:16:49,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {122269#true} assume !(0 != ~p3~0); {122269#true} is VALID [2022-04-28 08:16:49,092 INFO L290 TraceCheckUtils]: 11: Hoare triple {122269#true} assume !(0 != ~p4~0); {122269#true} is VALID [2022-04-28 08:16:49,092 INFO L290 TraceCheckUtils]: 12: Hoare triple {122269#true} assume !(0 != ~p5~0); {122269#true} is VALID [2022-04-28 08:16:49,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {122269#true} assume !(0 != ~p6~0); {122269#true} is VALID [2022-04-28 08:16:49,092 INFO L290 TraceCheckUtils]: 14: Hoare triple {122269#true} assume !(0 != ~p7~0); {122274#(= main_~p7~0 0)} is VALID [2022-04-28 08:16:49,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {122274#(= main_~p7~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {122274#(= main_~p7~0 0)} is VALID [2022-04-28 08:16:49,093 INFO L290 TraceCheckUtils]: 16: Hoare triple {122274#(= main_~p7~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {122274#(= main_~p7~0 0)} is VALID [2022-04-28 08:16:49,093 INFO L290 TraceCheckUtils]: 17: Hoare triple {122274#(= main_~p7~0 0)} assume !(0 != ~p10~0); {122274#(= main_~p7~0 0)} is VALID [2022-04-28 08:16:49,093 INFO L290 TraceCheckUtils]: 18: Hoare triple {122274#(= main_~p7~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {122274#(= main_~p7~0 0)} is VALID [2022-04-28 08:16:49,094 INFO L290 TraceCheckUtils]: 19: Hoare triple {122274#(= main_~p7~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {122274#(= main_~p7~0 0)} is VALID [2022-04-28 08:16:49,094 INFO L290 TraceCheckUtils]: 20: Hoare triple {122274#(= main_~p7~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {122274#(= main_~p7~0 0)} is VALID [2022-04-28 08:16:49,094 INFO L290 TraceCheckUtils]: 21: Hoare triple {122274#(= main_~p7~0 0)} assume !(0 != ~p1~0); {122274#(= main_~p7~0 0)} is VALID [2022-04-28 08:16:49,094 INFO L290 TraceCheckUtils]: 22: Hoare triple {122274#(= main_~p7~0 0)} assume !(0 != ~p2~0); {122274#(= main_~p7~0 0)} is VALID [2022-04-28 08:16:49,095 INFO L290 TraceCheckUtils]: 23: Hoare triple {122274#(= main_~p7~0 0)} assume !(0 != ~p3~0); {122274#(= main_~p7~0 0)} is VALID [2022-04-28 08:16:49,095 INFO L290 TraceCheckUtils]: 24: Hoare triple {122274#(= main_~p7~0 0)} assume !(0 != ~p4~0); {122274#(= main_~p7~0 0)} is VALID [2022-04-28 08:16:49,095 INFO L290 TraceCheckUtils]: 25: Hoare triple {122274#(= main_~p7~0 0)} assume !(0 != ~p5~0); {122274#(= main_~p7~0 0)} is VALID [2022-04-28 08:16:49,095 INFO L290 TraceCheckUtils]: 26: Hoare triple {122274#(= main_~p7~0 0)} assume !(0 != ~p6~0); {122274#(= main_~p7~0 0)} is VALID [2022-04-28 08:16:49,096 INFO L290 TraceCheckUtils]: 27: Hoare triple {122274#(= main_~p7~0 0)} assume 0 != ~p7~0; {122270#false} is VALID [2022-04-28 08:16:49,096 INFO L290 TraceCheckUtils]: 28: Hoare triple {122270#false} assume 1 != ~lk7~0; {122270#false} is VALID [2022-04-28 08:16:49,096 INFO L290 TraceCheckUtils]: 29: Hoare triple {122270#false} assume !false; {122270#false} is VALID [2022-04-28 08:16:49,096 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-28 08:16:49,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:49,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814089595] [2022-04-28 08:16:49,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814089595] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:49,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:49,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:49,098 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:49,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1367588525] [2022-04-28 08:16:49,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1367588525] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:49,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:49,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:49,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136852861] [2022-04-28 08:16:49,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:49,099 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-28 08:16:49,099 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:49,099 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-28 08:16:49,115 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-28 08:16:49,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:49,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:49,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:49,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:49,115 INFO L87 Difference]: Start difference. First operand 3593 states and 5543 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-28 08:16:52,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:52,565 INFO L93 Difference]: Finished difference Result 8397 states and 13033 transitions. [2022-04-28 08:16:52,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:52,565 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-28 08:16:52,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:52,565 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-28 08:16:52,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 228 transitions. [2022-04-28 08:16:52,566 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-28 08:16:52,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 228 transitions. [2022-04-28 08:16:52,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 228 transitions. [2022-04-28 08:16:52,697 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-28 08:16:53,621 INFO L225 Difference]: With dead ends: 8397 [2022-04-28 08:16:53,621 INFO L226 Difference]: Without dead ends: 4875 [2022-04-28 08:16:53,624 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-28 08:16:53,625 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 157 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 131 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-28 08:16:53,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 131 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:53,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2022-04-28 08:16:53,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 4873. [2022-04-28 08:16:53,959 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:53,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4875 states. Second operand has 4873 states, 4869 states have (on average 1.538714315054426) internal successors, (7492), 4869 states have internal predecessors, (7492), 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-28 08:16:53,968 INFO L74 IsIncluded]: Start isIncluded. First operand 4875 states. Second operand has 4873 states, 4869 states have (on average 1.538714315054426) internal successors, (7492), 4869 states have internal predecessors, (7492), 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-28 08:16:53,972 INFO L87 Difference]: Start difference. First operand 4875 states. Second operand has 4873 states, 4869 states have (on average 1.538714315054426) internal successors, (7492), 4869 states have internal predecessors, (7492), 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-28 08:16:54,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:54,566 INFO L93 Difference]: Finished difference Result 4875 states and 7496 transitions. [2022-04-28 08:16:54,566 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 7496 transitions. [2022-04-28 08:16:54,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:54,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:54,575 INFO L74 IsIncluded]: Start isIncluded. First operand has 4873 states, 4869 states have (on average 1.538714315054426) internal successors, (7492), 4869 states have internal predecessors, (7492), 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 4875 states. [2022-04-28 08:16:54,578 INFO L87 Difference]: Start difference. First operand has 4873 states, 4869 states have (on average 1.538714315054426) internal successors, (7492), 4869 states have internal predecessors, (7492), 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 4875 states. [2022-04-28 08:16:55,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:55,203 INFO L93 Difference]: Finished difference Result 4875 states and 7496 transitions. [2022-04-28 08:16:55,203 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 7496 transitions. [2022-04-28 08:16:55,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:55,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:55,207 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:55,207 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:55,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4873 states, 4869 states have (on average 1.538714315054426) internal successors, (7492), 4869 states have internal predecessors, (7492), 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-28 08:16:56,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4873 states to 4873 states and 7495 transitions. [2022-04-28 08:16:56,227 INFO L78 Accepts]: Start accepts. Automaton has 4873 states and 7495 transitions. Word has length 30 [2022-04-28 08:16:56,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:56,227 INFO L495 AbstractCegarLoop]: Abstraction has 4873 states and 7495 transitions. [2022-04-28 08:16:56,227 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-28 08:16:56,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4873 states and 7495 transitions. [2022-04-28 08:17:03,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7495 edges. 7495 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:17:03,675 INFO L276 IsEmpty]: Start isEmpty. Operand 4873 states and 7495 transitions. [2022-04-28 08:17:03,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 08:17:03,678 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:17:03,678 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-28 08:17:03,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-28 08:17:03,678 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:17:03,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:17:03,679 INFO L85 PathProgramCache]: Analyzing trace with hash -227191537, now seen corresponding path program 1 times [2022-04-28 08:17:03,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:17:03,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [710189011] [2022-04-28 08:17:03,679 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:17:03,679 INFO L85 PathProgramCache]: Analyzing trace with hash -227191537, now seen corresponding path program 2 times [2022-04-28 08:17:03,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:17:03,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732330871] [2022-04-28 08:17:03,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:17:03,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:17:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:17:03,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:17:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:17:03,709 INFO L290 TraceCheckUtils]: 0: Hoare triple {158577#(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); {158571#true} is VALID [2022-04-28 08:17:03,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {158571#true} assume true; {158571#true} is VALID [2022-04-28 08:17:03,709 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {158571#true} {158571#true} #251#return; {158571#true} is VALID [2022-04-28 08:17:03,709 INFO L272 TraceCheckUtils]: 0: Hoare triple {158571#true} call ULTIMATE.init(); {158577#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:17:03,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {158577#(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); {158571#true} is VALID [2022-04-28 08:17:03,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {158571#true} assume true; {158571#true} is VALID [2022-04-28 08:17:03,709 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {158571#true} {158571#true} #251#return; {158571#true} is VALID [2022-04-28 08:17:03,709 INFO L272 TraceCheckUtils]: 4: Hoare triple {158571#true} call #t~ret18 := main(); {158571#true} is VALID [2022-04-28 08:17:03,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {158571#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {158571#true} is VALID [2022-04-28 08:17:03,710 INFO L290 TraceCheckUtils]: 6: Hoare triple {158571#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {158571#true} is VALID [2022-04-28 08:17:03,710 INFO L290 TraceCheckUtils]: 7: Hoare triple {158571#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {158571#true} is VALID [2022-04-28 08:17:03,710 INFO L290 TraceCheckUtils]: 8: Hoare triple {158571#true} assume !(0 != ~p1~0); {158571#true} is VALID [2022-04-28 08:17:03,710 INFO L290 TraceCheckUtils]: 9: Hoare triple {158571#true} assume !(0 != ~p2~0); {158571#true} is VALID [2022-04-28 08:17:03,710 INFO L290 TraceCheckUtils]: 10: Hoare triple {158571#true} assume !(0 != ~p3~0); {158571#true} is VALID [2022-04-28 08:17:03,710 INFO L290 TraceCheckUtils]: 11: Hoare triple {158571#true} assume !(0 != ~p4~0); {158571#true} is VALID [2022-04-28 08:17:03,710 INFO L290 TraceCheckUtils]: 12: Hoare triple {158571#true} assume !(0 != ~p5~0); {158571#true} is VALID [2022-04-28 08:17:03,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {158571#true} assume !(0 != ~p6~0); {158571#true} is VALID [2022-04-28 08:17:03,710 INFO L290 TraceCheckUtils]: 14: Hoare triple {158571#true} assume 0 != ~p7~0;~lk7~0 := 1; {158576#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:17:03,710 INFO L290 TraceCheckUtils]: 15: Hoare triple {158576#(not (= main_~p7~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {158576#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:17:03,711 INFO L290 TraceCheckUtils]: 16: Hoare triple {158576#(not (= main_~p7~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {158576#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:17:03,711 INFO L290 TraceCheckUtils]: 17: Hoare triple {158576#(not (= main_~p7~0 0))} assume !(0 != ~p10~0); {158576#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:17:03,711 INFO L290 TraceCheckUtils]: 18: Hoare triple {158576#(not (= main_~p7~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {158576#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:17:03,711 INFO L290 TraceCheckUtils]: 19: Hoare triple {158576#(not (= main_~p7~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {158576#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:17:03,712 INFO L290 TraceCheckUtils]: 20: Hoare triple {158576#(not (= main_~p7~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {158576#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:17:03,712 INFO L290 TraceCheckUtils]: 21: Hoare triple {158576#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {158576#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:17:03,712 INFO L290 TraceCheckUtils]: 22: Hoare triple {158576#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {158576#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:17:03,712 INFO L290 TraceCheckUtils]: 23: Hoare triple {158576#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {158576#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:17:03,713 INFO L290 TraceCheckUtils]: 24: Hoare triple {158576#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {158576#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:17:03,713 INFO L290 TraceCheckUtils]: 25: Hoare triple {158576#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {158576#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:17:03,713 INFO L290 TraceCheckUtils]: 26: Hoare triple {158576#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {158576#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:17:03,713 INFO L290 TraceCheckUtils]: 27: Hoare triple {158576#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {158572#false} is VALID [2022-04-28 08:17:03,713 INFO L290 TraceCheckUtils]: 28: Hoare triple {158572#false} assume 0 != ~p8~0; {158572#false} is VALID [2022-04-28 08:17:03,713 INFO L290 TraceCheckUtils]: 29: Hoare triple {158572#false} assume 1 != ~lk8~0; {158572#false} is VALID [2022-04-28 08:17:03,713 INFO L290 TraceCheckUtils]: 30: Hoare triple {158572#false} assume !false; {158572#false} is VALID [2022-04-28 08:17:03,714 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-28 08:17:03,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:17:03,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732330871] [2022-04-28 08:17:03,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732330871] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:17:03,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:17:03,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:17:03,714 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:17:03,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [710189011] [2022-04-28 08:17:03,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [710189011] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:17:03,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:17:03,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:17:03,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256246543] [2022-04-28 08:17:03,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:17:03,716 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-28 08:17:03,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:17:03,716 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-28 08:17:03,732 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-28 08:17:03,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:17:03,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:17:03,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:17:03,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:17:03,732 INFO L87 Difference]: Start difference. First operand 4873 states and 7495 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-28 08:17:06,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:17:06,553 INFO L93 Difference]: Finished difference Result 7309 states and 11209 transitions. [2022-04-28 08:17:06,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:17:06,553 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-28 08:17:06,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:17:06,553 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-28 08:17:06,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 223 transitions. [2022-04-28 08:17:06,554 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-28 08:17:06,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 223 transitions. [2022-04-28 08:17:06,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 223 transitions. [2022-04-28 08:17:06,691 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-28 08:17:07,657 INFO L225 Difference]: With dead ends: 7309 [2022-04-28 08:17:07,657 INFO L226 Difference]: Without dead ends: 4939 [2022-04-28 08:17:07,660 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-28 08:17:07,660 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 164 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 125 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-28 08:17:07,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 125 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:17:07,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4939 states. [2022-04-28 08:17:07,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4939 to 4937. [2022-04-28 08:17:07,982 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:17:07,988 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4939 states. Second operand has 4937 states, 4933 states have (on average 1.5187512669774985) internal successors, (7492), 4933 states have internal predecessors, (7492), 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-28 08:17:07,993 INFO L74 IsIncluded]: Start isIncluded. First operand 4939 states. Second operand has 4937 states, 4933 states have (on average 1.5187512669774985) internal successors, (7492), 4933 states have internal predecessors, (7492), 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-28 08:17:07,997 INFO L87 Difference]: Start difference. First operand 4939 states. Second operand has 4937 states, 4933 states have (on average 1.5187512669774985) internal successors, (7492), 4933 states have internal predecessors, (7492), 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-28 08:17:08,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:17:08,634 INFO L93 Difference]: Finished difference Result 4939 states and 7496 transitions. [2022-04-28 08:17:08,635 INFO L276 IsEmpty]: Start isEmpty. Operand 4939 states and 7496 transitions. [2022-04-28 08:17:08,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:17:08,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:17:08,644 INFO L74 IsIncluded]: Start isIncluded. First operand has 4937 states, 4933 states have (on average 1.5187512669774985) internal successors, (7492), 4933 states have internal predecessors, (7492), 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 4939 states. [2022-04-28 08:17:08,647 INFO L87 Difference]: Start difference. First operand has 4937 states, 4933 states have (on average 1.5187512669774985) internal successors, (7492), 4933 states have internal predecessors, (7492), 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 4939 states. [2022-04-28 08:17:09,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:17:09,272 INFO L93 Difference]: Finished difference Result 4939 states and 7496 transitions. [2022-04-28 08:17:09,272 INFO L276 IsEmpty]: Start isEmpty. Operand 4939 states and 7496 transitions. [2022-04-28 08:17:09,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:17:09,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:17:09,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:17:09,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:17:09,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4937 states, 4933 states have (on average 1.5187512669774985) internal successors, (7492), 4933 states have internal predecessors, (7492), 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-28 08:17:10,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4937 states to 4937 states and 7495 transitions. [2022-04-28 08:17:10,314 INFO L78 Accepts]: Start accepts. Automaton has 4937 states and 7495 transitions. Word has length 31 [2022-04-28 08:17:10,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:17:10,315 INFO L495 AbstractCegarLoop]: Abstraction has 4937 states and 7495 transitions. [2022-04-28 08:17:10,315 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-28 08:17:10,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4937 states and 7495 transitions. [2022-04-28 08:17:17,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7495 edges. 7495 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:17:17,808 INFO L276 IsEmpty]: Start isEmpty. Operand 4937 states and 7495 transitions. [2022-04-28 08:17:17,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 08:17:17,811 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:17:17,811 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-28 08:17:17,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-28 08:17:17,811 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:17:17,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:17:17,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1815539439, now seen corresponding path program 1 times [2022-04-28 08:17:17,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:17:17,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [62577988] [2022-04-28 08:17:17,811 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:17:17,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1815539439, now seen corresponding path program 2 times [2022-04-28 08:17:17,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:17:17,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917678275] [2022-04-28 08:17:17,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:17:17,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:17:17,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:17:17,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:17:17,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:17:17,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {192959#(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); {192953#true} is VALID [2022-04-28 08:17:17,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {192953#true} assume true; {192953#true} is VALID [2022-04-28 08:17:17,838 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {192953#true} {192953#true} #251#return; {192953#true} is VALID [2022-04-28 08:17:17,839 INFO L272 TraceCheckUtils]: 0: Hoare triple {192953#true} call ULTIMATE.init(); {192959#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:17:17,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {192959#(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); {192953#true} is VALID [2022-04-28 08:17:17,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {192953#true} assume true; {192953#true} is VALID [2022-04-28 08:17:17,839 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {192953#true} {192953#true} #251#return; {192953#true} is VALID [2022-04-28 08:17:17,839 INFO L272 TraceCheckUtils]: 4: Hoare triple {192953#true} call #t~ret18 := main(); {192953#true} is VALID [2022-04-28 08:17:17,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {192953#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {192953#true} is VALID [2022-04-28 08:17:17,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {192953#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {192953#true} is VALID [2022-04-28 08:17:17,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {192953#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {192953#true} is VALID [2022-04-28 08:17:17,839 INFO L290 TraceCheckUtils]: 8: Hoare triple {192953#true} assume !(0 != ~p1~0); {192953#true} is VALID [2022-04-28 08:17:17,839 INFO L290 TraceCheckUtils]: 9: Hoare triple {192953#true} assume !(0 != ~p2~0); {192953#true} is VALID [2022-04-28 08:17:17,839 INFO L290 TraceCheckUtils]: 10: Hoare triple {192953#true} assume !(0 != ~p3~0); {192953#true} is VALID [2022-04-28 08:17:17,839 INFO L290 TraceCheckUtils]: 11: Hoare triple {192953#true} assume !(0 != ~p4~0); {192953#true} is VALID [2022-04-28 08:17:17,839 INFO L290 TraceCheckUtils]: 12: Hoare triple {192953#true} assume !(0 != ~p5~0); {192953#true} is VALID [2022-04-28 08:17:17,839 INFO L290 TraceCheckUtils]: 13: Hoare triple {192953#true} assume !(0 != ~p6~0); {192953#true} is VALID [2022-04-28 08:17:17,839 INFO L290 TraceCheckUtils]: 14: Hoare triple {192953#true} assume !(0 != ~p7~0); {192953#true} is VALID [2022-04-28 08:17:17,840 INFO L290 TraceCheckUtils]: 15: Hoare triple {192953#true} assume 0 != ~p8~0;~lk8~0 := 1; {192958#(= main_~lk8~0 1)} is VALID [2022-04-28 08:17:17,840 INFO L290 TraceCheckUtils]: 16: Hoare triple {192958#(= main_~lk8~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {192958#(= main_~lk8~0 1)} is VALID [2022-04-28 08:17:17,840 INFO L290 TraceCheckUtils]: 17: Hoare triple {192958#(= main_~lk8~0 1)} assume !(0 != ~p10~0); {192958#(= main_~lk8~0 1)} is VALID [2022-04-28 08:17:17,840 INFO L290 TraceCheckUtils]: 18: Hoare triple {192958#(= main_~lk8~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {192958#(= main_~lk8~0 1)} is VALID [2022-04-28 08:17:17,841 INFO L290 TraceCheckUtils]: 19: Hoare triple {192958#(= main_~lk8~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {192958#(= main_~lk8~0 1)} is VALID [2022-04-28 08:17:17,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {192958#(= main_~lk8~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {192958#(= main_~lk8~0 1)} is VALID [2022-04-28 08:17:17,841 INFO L290 TraceCheckUtils]: 21: Hoare triple {192958#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {192958#(= main_~lk8~0 1)} is VALID [2022-04-28 08:17:17,841 INFO L290 TraceCheckUtils]: 22: Hoare triple {192958#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {192958#(= main_~lk8~0 1)} is VALID [2022-04-28 08:17:17,842 INFO L290 TraceCheckUtils]: 23: Hoare triple {192958#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {192958#(= main_~lk8~0 1)} is VALID [2022-04-28 08:17:17,842 INFO L290 TraceCheckUtils]: 24: Hoare triple {192958#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {192958#(= main_~lk8~0 1)} is VALID [2022-04-28 08:17:17,842 INFO L290 TraceCheckUtils]: 25: Hoare triple {192958#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {192958#(= main_~lk8~0 1)} is VALID [2022-04-28 08:17:17,842 INFO L290 TraceCheckUtils]: 26: Hoare triple {192958#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {192958#(= main_~lk8~0 1)} is VALID [2022-04-28 08:17:17,842 INFO L290 TraceCheckUtils]: 27: Hoare triple {192958#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {192958#(= main_~lk8~0 1)} is VALID [2022-04-28 08:17:17,843 INFO L290 TraceCheckUtils]: 28: Hoare triple {192958#(= main_~lk8~0 1)} assume 0 != ~p8~0; {192958#(= main_~lk8~0 1)} is VALID [2022-04-28 08:17:17,843 INFO L290 TraceCheckUtils]: 29: Hoare triple {192958#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {192954#false} is VALID [2022-04-28 08:17:17,843 INFO L290 TraceCheckUtils]: 30: Hoare triple {192954#false} assume !false; {192954#false} is VALID [2022-04-28 08:17:17,843 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-28 08:17:17,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:17:17,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917678275] [2022-04-28 08:17:17,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917678275] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:17:17,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:17:17,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:17:17,844 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:17:17,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [62577988] [2022-04-28 08:17:17,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [62577988] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:17:17,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:17:17,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:17:17,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304540773] [2022-04-28 08:17:17,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:17:17,844 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-28 08:17:17,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:17:17,844 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-28 08:17:17,860 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-28 08:17:17,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:17:17,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:17:17,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:17:17,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:17:17,861 INFO L87 Difference]: Start difference. First operand 4937 states and 7495 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-28 08:17:21,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:17:21,776 INFO L93 Difference]: Finished difference Result 8717 states and 13513 transitions. [2022-04-28 08:17:21,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:17:21,777 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-28 08:17:21,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:17:21,777 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-28 08:17:21,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-28 08:17:21,778 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-28 08:17:21,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-28 08:17:21,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 139 transitions. [2022-04-28 08:17:21,860 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-28 08:17:24,870 INFO L225 Difference]: With dead ends: 8717 [2022-04-28 08:17:24,870 INFO L226 Difference]: Without dead ends: 8715 [2022-04-28 08:17:24,872 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-28 08:17:24,875 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 170 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:17:24,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 89 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:17:24,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8715 states. [2022-04-28 08:17:25,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8715 to 7177. [2022-04-28 08:17:25,377 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:17:25,384 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8715 states. Second operand has 7177 states, 7173 states have (on average 1.4727450160323434) internal successors, (10564), 7173 states have internal predecessors, (10564), 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-28 08:17:25,389 INFO L74 IsIncluded]: Start isIncluded. First operand 8715 states. Second operand has 7177 states, 7173 states have (on average 1.4727450160323434) internal successors, (10564), 7173 states have internal predecessors, (10564), 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-28 08:17:25,394 INFO L87 Difference]: Start difference. First operand 8715 states. Second operand has 7177 states, 7173 states have (on average 1.4727450160323434) internal successors, (10564), 7173 states have internal predecessors, (10564), 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-28 08:17:27,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:17:27,357 INFO L93 Difference]: Finished difference Result 8715 states and 13384 transitions. [2022-04-28 08:17:27,357 INFO L276 IsEmpty]: Start isEmpty. Operand 8715 states and 13384 transitions. [2022-04-28 08:17:27,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:17:27,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:17:27,369 INFO L74 IsIncluded]: Start isIncluded. First operand has 7177 states, 7173 states have (on average 1.4727450160323434) internal successors, (10564), 7173 states have internal predecessors, (10564), 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 8715 states. [2022-04-28 08:17:27,372 INFO L87 Difference]: Start difference. First operand has 7177 states, 7173 states have (on average 1.4727450160323434) internal successors, (10564), 7173 states have internal predecessors, (10564), 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 8715 states. [2022-04-28 08:17:29,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:17:29,415 INFO L93 Difference]: Finished difference Result 8715 states and 13384 transitions. [2022-04-28 08:17:29,415 INFO L276 IsEmpty]: Start isEmpty. Operand 8715 states and 13384 transitions. [2022-04-28 08:17:29,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:17:29,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:17:29,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:17:29,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:17:29,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7177 states, 7173 states have (on average 1.4727450160323434) internal successors, (10564), 7173 states have internal predecessors, (10564), 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-28 08:17:31,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7177 states to 7177 states and 10567 transitions. [2022-04-28 08:17:31,720 INFO L78 Accepts]: Start accepts. Automaton has 7177 states and 10567 transitions. Word has length 31 [2022-04-28 08:17:31,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:17:31,720 INFO L495 AbstractCegarLoop]: Abstraction has 7177 states and 10567 transitions. [2022-04-28 08:17:31,720 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-28 08:17:31,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7177 states and 10567 transitions. [2022-04-28 08:17:42,195 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10567 edges. 10567 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:17:42,196 INFO L276 IsEmpty]: Start isEmpty. Operand 7177 states and 10567 transitions. [2022-04-28 08:17:42,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 08:17:42,200 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:17:42,200 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-28 08:17:42,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-28 08:17:42,200 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:17:42,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:17:42,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1458359503, now seen corresponding path program 1 times [2022-04-28 08:17:42,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:17:42,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [450949981] [2022-04-28 08:17:42,201 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:17:42,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1458359503, now seen corresponding path program 2 times [2022-04-28 08:17:42,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:17:42,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134658406] [2022-04-28 08:17:42,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:17:42,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:17:42,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:17:42,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:17:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:17:42,233 INFO L290 TraceCheckUtils]: 0: Hoare triple {242189#(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); {242183#true} is VALID [2022-04-28 08:17:42,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {242183#true} assume true; {242183#true} is VALID [2022-04-28 08:17:42,233 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {242183#true} {242183#true} #251#return; {242183#true} is VALID [2022-04-28 08:17:42,233 INFO L272 TraceCheckUtils]: 0: Hoare triple {242183#true} call ULTIMATE.init(); {242189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:17:42,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {242189#(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); {242183#true} is VALID [2022-04-28 08:17:42,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {242183#true} assume true; {242183#true} is VALID [2022-04-28 08:17:42,233 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {242183#true} {242183#true} #251#return; {242183#true} is VALID [2022-04-28 08:17:42,233 INFO L272 TraceCheckUtils]: 4: Hoare triple {242183#true} call #t~ret18 := main(); {242183#true} is VALID [2022-04-28 08:17:42,233 INFO L290 TraceCheckUtils]: 5: Hoare triple {242183#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {242183#true} is VALID [2022-04-28 08:17:42,233 INFO L290 TraceCheckUtils]: 6: Hoare triple {242183#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {242183#true} is VALID [2022-04-28 08:17:42,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {242183#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {242183#true} is VALID [2022-04-28 08:17:42,234 INFO L290 TraceCheckUtils]: 8: Hoare triple {242183#true} assume !(0 != ~p1~0); {242183#true} is VALID [2022-04-28 08:17:42,234 INFO L290 TraceCheckUtils]: 9: Hoare triple {242183#true} assume !(0 != ~p2~0); {242183#true} is VALID [2022-04-28 08:17:42,234 INFO L290 TraceCheckUtils]: 10: Hoare triple {242183#true} assume !(0 != ~p3~0); {242183#true} is VALID [2022-04-28 08:17:42,234 INFO L290 TraceCheckUtils]: 11: Hoare triple {242183#true} assume !(0 != ~p4~0); {242183#true} is VALID [2022-04-28 08:17:42,234 INFO L290 TraceCheckUtils]: 12: Hoare triple {242183#true} assume !(0 != ~p5~0); {242183#true} is VALID [2022-04-28 08:17:42,234 INFO L290 TraceCheckUtils]: 13: Hoare triple {242183#true} assume !(0 != ~p6~0); {242183#true} is VALID [2022-04-28 08:17:42,234 INFO L290 TraceCheckUtils]: 14: Hoare triple {242183#true} assume !(0 != ~p7~0); {242183#true} is VALID [2022-04-28 08:17:42,235 INFO L290 TraceCheckUtils]: 15: Hoare triple {242183#true} assume !(0 != ~p8~0); {242188#(= main_~p8~0 0)} is VALID [2022-04-28 08:17:42,235 INFO L290 TraceCheckUtils]: 16: Hoare triple {242188#(= main_~p8~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {242188#(= main_~p8~0 0)} is VALID [2022-04-28 08:17:42,235 INFO L290 TraceCheckUtils]: 17: Hoare triple {242188#(= main_~p8~0 0)} assume !(0 != ~p10~0); {242188#(= main_~p8~0 0)} is VALID [2022-04-28 08:17:42,235 INFO L290 TraceCheckUtils]: 18: Hoare triple {242188#(= main_~p8~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {242188#(= main_~p8~0 0)} is VALID [2022-04-28 08:17:42,236 INFO L290 TraceCheckUtils]: 19: Hoare triple {242188#(= main_~p8~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {242188#(= main_~p8~0 0)} is VALID [2022-04-28 08:17:42,236 INFO L290 TraceCheckUtils]: 20: Hoare triple {242188#(= main_~p8~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {242188#(= main_~p8~0 0)} is VALID [2022-04-28 08:17:42,236 INFO L290 TraceCheckUtils]: 21: Hoare triple {242188#(= main_~p8~0 0)} assume !(0 != ~p1~0); {242188#(= main_~p8~0 0)} is VALID [2022-04-28 08:17:42,236 INFO L290 TraceCheckUtils]: 22: Hoare triple {242188#(= main_~p8~0 0)} assume !(0 != ~p2~0); {242188#(= main_~p8~0 0)} is VALID [2022-04-28 08:17:42,237 INFO L290 TraceCheckUtils]: 23: Hoare triple {242188#(= main_~p8~0 0)} assume !(0 != ~p3~0); {242188#(= main_~p8~0 0)} is VALID [2022-04-28 08:17:42,237 INFO L290 TraceCheckUtils]: 24: Hoare triple {242188#(= main_~p8~0 0)} assume !(0 != ~p4~0); {242188#(= main_~p8~0 0)} is VALID [2022-04-28 08:17:42,237 INFO L290 TraceCheckUtils]: 25: Hoare triple {242188#(= main_~p8~0 0)} assume !(0 != ~p5~0); {242188#(= main_~p8~0 0)} is VALID [2022-04-28 08:17:42,237 INFO L290 TraceCheckUtils]: 26: Hoare triple {242188#(= main_~p8~0 0)} assume !(0 != ~p6~0); {242188#(= main_~p8~0 0)} is VALID [2022-04-28 08:17:42,237 INFO L290 TraceCheckUtils]: 27: Hoare triple {242188#(= main_~p8~0 0)} assume !(0 != ~p7~0); {242188#(= main_~p8~0 0)} is VALID [2022-04-28 08:17:42,238 INFO L290 TraceCheckUtils]: 28: Hoare triple {242188#(= main_~p8~0 0)} assume 0 != ~p8~0; {242184#false} is VALID [2022-04-28 08:17:42,238 INFO L290 TraceCheckUtils]: 29: Hoare triple {242184#false} assume 1 != ~lk8~0; {242184#false} is VALID [2022-04-28 08:17:42,238 INFO L290 TraceCheckUtils]: 30: Hoare triple {242184#false} assume !false; {242184#false} is VALID [2022-04-28 08:17:42,238 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-28 08:17:42,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:17:42,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134658406] [2022-04-28 08:17:42,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134658406] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:17:42,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:17:42,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:17:42,238 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:17:42,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [450949981] [2022-04-28 08:17:42,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [450949981] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:17:42,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:17:42,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:17:42,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409389131] [2022-04-28 08:17:42,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:17:42,239 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-28 08:17:42,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:17:42,239 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-28 08:17:42,254 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-28 08:17:42,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:17:42,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:17:42,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:17:42,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:17:42,255 INFO L87 Difference]: Start difference. First operand 7177 states and 10567 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-28 08:17:54,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:17:54,609 INFO L93 Difference]: Finished difference Result 16653 states and 24649 transitions. [2022-04-28 08:17:54,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:17:54,609 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-28 08:17:54,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:17:54,609 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-28 08:17:54,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 225 transitions. [2022-04-28 08:17:54,610 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-28 08:17:54,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 225 transitions. [2022-04-28 08:17:54,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 225 transitions. [2022-04-28 08:17:54,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:17:58,406 INFO L225 Difference]: With dead ends: 16653 [2022-04-28 08:17:58,406 INFO L226 Difference]: Without dead ends: 9611 [2022-04-28 08:17:58,413 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-28 08:17:58,413 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 151 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:17:58,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 133 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:17:58,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9611 states. [2022-04-28 08:17:59,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9611 to 9609. [2022-04-28 08:17:59,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:17:59,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9611 states. Second operand has 9609 states, 9605 states have (on average 1.4663196251952109) internal successors, (14084), 9605 states have internal predecessors, (14084), 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-28 08:17:59,125 INFO L74 IsIncluded]: Start isIncluded. First operand 9611 states. Second operand has 9609 states, 9605 states have (on average 1.4663196251952109) internal successors, (14084), 9605 states have internal predecessors, (14084), 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-28 08:17:59,132 INFO L87 Difference]: Start difference. First operand 9611 states. Second operand has 9609 states, 9605 states have (on average 1.4663196251952109) internal successors, (14084), 9605 states have internal predecessors, (14084), 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-28 08:18:01,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:01,453 INFO L93 Difference]: Finished difference Result 9611 states and 14088 transitions. [2022-04-28 08:18:01,453 INFO L276 IsEmpty]: Start isEmpty. Operand 9611 states and 14088 transitions. [2022-04-28 08:18:01,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:01,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:01,468 INFO L74 IsIncluded]: Start isIncluded. First operand has 9609 states, 9605 states have (on average 1.4663196251952109) internal successors, (14084), 9605 states have internal predecessors, (14084), 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 9611 states. [2022-04-28 08:18:01,476 INFO L87 Difference]: Start difference. First operand has 9609 states, 9605 states have (on average 1.4663196251952109) internal successors, (14084), 9605 states have internal predecessors, (14084), 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 9611 states. [2022-04-28 08:18:03,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:03,829 INFO L93 Difference]: Finished difference Result 9611 states and 14088 transitions. [2022-04-28 08:18:03,829 INFO L276 IsEmpty]: Start isEmpty. Operand 9611 states and 14088 transitions. [2022-04-28 08:18:03,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:03,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:03,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:18:03,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:18:03,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9609 states, 9605 states have (on average 1.4663196251952109) internal successors, (14084), 9605 states have internal predecessors, (14084), 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-28 08:18:07,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9609 states to 9609 states and 14087 transitions. [2022-04-28 08:18:07,568 INFO L78 Accepts]: Start accepts. Automaton has 9609 states and 14087 transitions. Word has length 31 [2022-04-28 08:18:07,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:18:07,569 INFO L495 AbstractCegarLoop]: Abstraction has 9609 states and 14087 transitions. [2022-04-28 08:18:07,569 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-28 08:18:07,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9609 states and 14087 transitions. [2022-04-28 08:18:22,367 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14087 edges. 14087 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:18:22,367 INFO L276 IsEmpty]: Start isEmpty. Operand 9609 states and 14087 transitions. [2022-04-28 08:18:22,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 08:18:22,371 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:18:22,371 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-28 08:18:22,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-28 08:18:22,372 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:18:22,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:18:22,372 INFO L85 PathProgramCache]: Analyzing trace with hash -446932963, now seen corresponding path program 1 times [2022-04-28 08:18:22,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:22,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1527248513] [2022-04-28 08:18:22,372 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:18:22,372 INFO L85 PathProgramCache]: Analyzing trace with hash -446932963, now seen corresponding path program 2 times [2022-04-28 08:18:22,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:18:22,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330479193] [2022-04-28 08:18:22,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:18:22,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:18:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:22,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:18:22,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:22,407 INFO L290 TraceCheckUtils]: 0: Hoare triple {313947#(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); {313941#true} is VALID [2022-04-28 08:18:22,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {313941#true} assume true; {313941#true} is VALID [2022-04-28 08:18:22,408 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {313941#true} {313941#true} #251#return; {313941#true} is VALID [2022-04-28 08:18:22,408 INFO L272 TraceCheckUtils]: 0: Hoare triple {313941#true} call ULTIMATE.init(); {313947#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:18:22,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {313947#(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); {313941#true} is VALID [2022-04-28 08:18:22,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {313941#true} assume true; {313941#true} is VALID [2022-04-28 08:18:22,408 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {313941#true} {313941#true} #251#return; {313941#true} is VALID [2022-04-28 08:18:22,408 INFO L272 TraceCheckUtils]: 4: Hoare triple {313941#true} call #t~ret18 := main(); {313941#true} is VALID [2022-04-28 08:18:22,408 INFO L290 TraceCheckUtils]: 5: Hoare triple {313941#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {313941#true} is VALID [2022-04-28 08:18:22,408 INFO L290 TraceCheckUtils]: 6: Hoare triple {313941#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {313941#true} is VALID [2022-04-28 08:18:22,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {313941#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {313941#true} is VALID [2022-04-28 08:18:22,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {313941#true} assume !(0 != ~p1~0); {313941#true} is VALID [2022-04-28 08:18:22,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {313941#true} assume !(0 != ~p2~0); {313941#true} is VALID [2022-04-28 08:18:22,409 INFO L290 TraceCheckUtils]: 10: Hoare triple {313941#true} assume !(0 != ~p3~0); {313941#true} is VALID [2022-04-28 08:18:22,409 INFO L290 TraceCheckUtils]: 11: Hoare triple {313941#true} assume !(0 != ~p4~0); {313941#true} is VALID [2022-04-28 08:18:22,409 INFO L290 TraceCheckUtils]: 12: Hoare triple {313941#true} assume !(0 != ~p5~0); {313941#true} is VALID [2022-04-28 08:18:22,410 INFO L290 TraceCheckUtils]: 13: Hoare triple {313941#true} assume !(0 != ~p6~0); {313941#true} is VALID [2022-04-28 08:18:22,410 INFO L290 TraceCheckUtils]: 14: Hoare triple {313941#true} assume !(0 != ~p7~0); {313941#true} is VALID [2022-04-28 08:18:22,410 INFO L290 TraceCheckUtils]: 15: Hoare triple {313941#true} assume 0 != ~p8~0;~lk8~0 := 1; {313946#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:18:22,410 INFO L290 TraceCheckUtils]: 16: Hoare triple {313946#(not (= main_~p8~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {313946#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:18:22,411 INFO L290 TraceCheckUtils]: 17: Hoare triple {313946#(not (= main_~p8~0 0))} assume !(0 != ~p10~0); {313946#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:18:22,411 INFO L290 TraceCheckUtils]: 18: Hoare triple {313946#(not (= main_~p8~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {313946#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:18:22,411 INFO L290 TraceCheckUtils]: 19: Hoare triple {313946#(not (= main_~p8~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {313946#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:18:22,411 INFO L290 TraceCheckUtils]: 20: Hoare triple {313946#(not (= main_~p8~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {313946#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:18:22,412 INFO L290 TraceCheckUtils]: 21: Hoare triple {313946#(not (= main_~p8~0 0))} assume !(0 != ~p1~0); {313946#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:18:22,412 INFO L290 TraceCheckUtils]: 22: Hoare triple {313946#(not (= main_~p8~0 0))} assume !(0 != ~p2~0); {313946#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:18:22,412 INFO L290 TraceCheckUtils]: 23: Hoare triple {313946#(not (= main_~p8~0 0))} assume !(0 != ~p3~0); {313946#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:18:22,413 INFO L290 TraceCheckUtils]: 24: Hoare triple {313946#(not (= main_~p8~0 0))} assume !(0 != ~p4~0); {313946#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:18:22,413 INFO L290 TraceCheckUtils]: 25: Hoare triple {313946#(not (= main_~p8~0 0))} assume !(0 != ~p5~0); {313946#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:18:22,413 INFO L290 TraceCheckUtils]: 26: Hoare triple {313946#(not (= main_~p8~0 0))} assume !(0 != ~p6~0); {313946#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:18:22,413 INFO L290 TraceCheckUtils]: 27: Hoare triple {313946#(not (= main_~p8~0 0))} assume !(0 != ~p7~0); {313946#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:18:22,414 INFO L290 TraceCheckUtils]: 28: Hoare triple {313946#(not (= main_~p8~0 0))} assume !(0 != ~p8~0); {313942#false} is VALID [2022-04-28 08:18:22,414 INFO L290 TraceCheckUtils]: 29: Hoare triple {313942#false} assume 0 != ~p9~0; {313942#false} is VALID [2022-04-28 08:18:22,414 INFO L290 TraceCheckUtils]: 30: Hoare triple {313942#false} assume 1 != ~lk9~0; {313942#false} is VALID [2022-04-28 08:18:22,414 INFO L290 TraceCheckUtils]: 31: Hoare triple {313942#false} assume !false; {313942#false} is VALID [2022-04-28 08:18:22,414 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-28 08:18:22,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:18:22,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330479193] [2022-04-28 08:18:22,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330479193] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:22,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:22,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:22,414 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:18:22,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1527248513] [2022-04-28 08:18:22,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1527248513] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:22,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:22,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:22,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947675079] [2022-04-28 08:18:22,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:18:22,415 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-28 08:18:22,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:18:22,415 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-28 08:18:22,432 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-28 08:18:22,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:18:22,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:22,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:18:22,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:18:22,433 INFO L87 Difference]: Start difference. First operand 9609 states and 14087 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-28 08:18:32,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:32,176 INFO L93 Difference]: Finished difference Result 14413 states and 21065 transitions. [2022-04-28 08:18:32,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:18:32,176 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-28 08:18:32,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:18:32,176 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-28 08:18:32,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 220 transitions. [2022-04-28 08:18:32,177 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-28 08:18:32,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 220 transitions. [2022-04-28 08:18:32,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 220 transitions. [2022-04-28 08:18:32,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 220 edges. 220 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:18:36,284 INFO L225 Difference]: With dead ends: 14413 [2022-04-28 08:18:36,285 INFO L226 Difference]: Without dead ends: 9739 [2022-04-28 08:18:36,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-28 08:18:36,292 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 163 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 122 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-28 08:18:36,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 122 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:18:36,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9739 states. [2022-04-28 08:18:37,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9739 to 9737. [2022-04-28 08:18:37,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:18:37,110 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9739 states. Second operand has 9737 states, 9733 states have (on average 1.4470358573923765) internal successors, (14084), 9733 states have internal predecessors, (14084), 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-28 08:18:37,121 INFO L74 IsIncluded]: Start isIncluded. First operand 9739 states. Second operand has 9737 states, 9733 states have (on average 1.4470358573923765) internal successors, (14084), 9733 states have internal predecessors, (14084), 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-28 08:18:37,130 INFO L87 Difference]: Start difference. First operand 9739 states. Second operand has 9737 states, 9733 states have (on average 1.4470358573923765) internal successors, (14084), 9733 states have internal predecessors, (14084), 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-28 08:18:39,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:39,661 INFO L93 Difference]: Finished difference Result 9739 states and 14088 transitions. [2022-04-28 08:18:39,661 INFO L276 IsEmpty]: Start isEmpty. Operand 9739 states and 14088 transitions. [2022-04-28 08:18:39,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:39,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:39,677 INFO L74 IsIncluded]: Start isIncluded. First operand has 9737 states, 9733 states have (on average 1.4470358573923765) internal successors, (14084), 9733 states have internal predecessors, (14084), 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 9739 states. [2022-04-28 08:18:39,685 INFO L87 Difference]: Start difference. First operand has 9737 states, 9733 states have (on average 1.4470358573923765) internal successors, (14084), 9733 states have internal predecessors, (14084), 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 9739 states. [2022-04-28 08:18:42,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:42,351 INFO L93 Difference]: Finished difference Result 9739 states and 14088 transitions. [2022-04-28 08:18:42,351 INFO L276 IsEmpty]: Start isEmpty. Operand 9739 states and 14088 transitions. [2022-04-28 08:18:42,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:42,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:42,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:18:42,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:18:42,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9737 states, 9733 states have (on average 1.4470358573923765) internal successors, (14084), 9733 states have internal predecessors, (14084), 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-28 08:18:46,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9737 states to 9737 states and 14087 transitions. [2022-04-28 08:18:46,269 INFO L78 Accepts]: Start accepts. Automaton has 9737 states and 14087 transitions. Word has length 32 [2022-04-28 08:18:46,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:18:46,269 INFO L495 AbstractCegarLoop]: Abstraction has 9737 states and 14087 transitions. [2022-04-28 08:18:46,269 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-28 08:18:46,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9737 states and 14087 transitions. [2022-04-28 08:19:01,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14087 edges. 14087 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:01,520 INFO L276 IsEmpty]: Start isEmpty. Operand 9737 states and 14087 transitions. [2022-04-28 08:19:01,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 08:19:01,524 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:19:01,524 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-28 08:19:01,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-28 08:19:01,524 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:19:01,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:19:01,524 INFO L85 PathProgramCache]: Analyzing trace with hash -2035280865, now seen corresponding path program 1 times [2022-04-28 08:19:01,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:01,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [181465926] [2022-04-28 08:19:01,525 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:19:01,525 INFO L85 PathProgramCache]: Analyzing trace with hash -2035280865, now seen corresponding path program 2 times [2022-04-28 08:19:01,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:19:01,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992402669] [2022-04-28 08:19:01,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:19:01,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:19:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:01,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:19:01,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:01,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {381737#(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); {381731#true} is VALID [2022-04-28 08:19:01,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {381731#true} assume true; {381731#true} is VALID [2022-04-28 08:19:01,556 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {381731#true} {381731#true} #251#return; {381731#true} is VALID [2022-04-28 08:19:01,556 INFO L272 TraceCheckUtils]: 0: Hoare triple {381731#true} call ULTIMATE.init(); {381737#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:19:01,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {381737#(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); {381731#true} is VALID [2022-04-28 08:19:01,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {381731#true} assume true; {381731#true} is VALID [2022-04-28 08:19:01,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {381731#true} {381731#true} #251#return; {381731#true} is VALID [2022-04-28 08:19:01,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {381731#true} call #t~ret18 := main(); {381731#true} is VALID [2022-04-28 08:19:01,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {381731#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {381731#true} is VALID [2022-04-28 08:19:01,557 INFO L290 TraceCheckUtils]: 6: Hoare triple {381731#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {381731#true} is VALID [2022-04-28 08:19:01,557 INFO L290 TraceCheckUtils]: 7: Hoare triple {381731#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {381731#true} is VALID [2022-04-28 08:19:01,557 INFO L290 TraceCheckUtils]: 8: Hoare triple {381731#true} assume !(0 != ~p1~0); {381731#true} is VALID [2022-04-28 08:19:01,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {381731#true} assume !(0 != ~p2~0); {381731#true} is VALID [2022-04-28 08:19:01,557 INFO L290 TraceCheckUtils]: 10: Hoare triple {381731#true} assume !(0 != ~p3~0); {381731#true} is VALID [2022-04-28 08:19:01,557 INFO L290 TraceCheckUtils]: 11: Hoare triple {381731#true} assume !(0 != ~p4~0); {381731#true} is VALID [2022-04-28 08:19:01,557 INFO L290 TraceCheckUtils]: 12: Hoare triple {381731#true} assume !(0 != ~p5~0); {381731#true} is VALID [2022-04-28 08:19:01,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {381731#true} assume !(0 != ~p6~0); {381731#true} is VALID [2022-04-28 08:19:01,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {381731#true} assume !(0 != ~p7~0); {381731#true} is VALID [2022-04-28 08:19:01,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {381731#true} assume !(0 != ~p8~0); {381731#true} is VALID [2022-04-28 08:19:01,558 INFO L290 TraceCheckUtils]: 16: Hoare triple {381731#true} assume 0 != ~p9~0;~lk9~0 := 1; {381736#(= main_~lk9~0 1)} is VALID [2022-04-28 08:19:01,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {381736#(= main_~lk9~0 1)} assume !(0 != ~p10~0); {381736#(= main_~lk9~0 1)} is VALID [2022-04-28 08:19:01,558 INFO L290 TraceCheckUtils]: 18: Hoare triple {381736#(= main_~lk9~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {381736#(= main_~lk9~0 1)} is VALID [2022-04-28 08:19:01,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {381736#(= main_~lk9~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {381736#(= main_~lk9~0 1)} is VALID [2022-04-28 08:19:01,559 INFO L290 TraceCheckUtils]: 20: Hoare triple {381736#(= main_~lk9~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {381736#(= main_~lk9~0 1)} is VALID [2022-04-28 08:19:01,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {381736#(= main_~lk9~0 1)} assume !(0 != ~p1~0); {381736#(= main_~lk9~0 1)} is VALID [2022-04-28 08:19:01,559 INFO L290 TraceCheckUtils]: 22: Hoare triple {381736#(= main_~lk9~0 1)} assume !(0 != ~p2~0); {381736#(= main_~lk9~0 1)} is VALID [2022-04-28 08:19:01,559 INFO L290 TraceCheckUtils]: 23: Hoare triple {381736#(= main_~lk9~0 1)} assume !(0 != ~p3~0); {381736#(= main_~lk9~0 1)} is VALID [2022-04-28 08:19:01,559 INFO L290 TraceCheckUtils]: 24: Hoare triple {381736#(= main_~lk9~0 1)} assume !(0 != ~p4~0); {381736#(= main_~lk9~0 1)} is VALID [2022-04-28 08:19:01,560 INFO L290 TraceCheckUtils]: 25: Hoare triple {381736#(= main_~lk9~0 1)} assume !(0 != ~p5~0); {381736#(= main_~lk9~0 1)} is VALID [2022-04-28 08:19:01,560 INFO L290 TraceCheckUtils]: 26: Hoare triple {381736#(= main_~lk9~0 1)} assume !(0 != ~p6~0); {381736#(= main_~lk9~0 1)} is VALID [2022-04-28 08:19:01,560 INFO L290 TraceCheckUtils]: 27: Hoare triple {381736#(= main_~lk9~0 1)} assume !(0 != ~p7~0); {381736#(= main_~lk9~0 1)} is VALID [2022-04-28 08:19:01,560 INFO L290 TraceCheckUtils]: 28: Hoare triple {381736#(= main_~lk9~0 1)} assume !(0 != ~p8~0); {381736#(= main_~lk9~0 1)} is VALID [2022-04-28 08:19:01,561 INFO L290 TraceCheckUtils]: 29: Hoare triple {381736#(= main_~lk9~0 1)} assume 0 != ~p9~0; {381736#(= main_~lk9~0 1)} is VALID [2022-04-28 08:19:01,561 INFO L290 TraceCheckUtils]: 30: Hoare triple {381736#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {381732#false} is VALID [2022-04-28 08:19:01,561 INFO L290 TraceCheckUtils]: 31: Hoare triple {381732#false} assume !false; {381732#false} is VALID [2022-04-28 08:19:01,561 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-28 08:19:01,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:19:01,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992402669] [2022-04-28 08:19:01,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992402669] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:01,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:01,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:01,562 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:19:01,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [181465926] [2022-04-28 08:19:01,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [181465926] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:01,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:01,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:01,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085370665] [2022-04-28 08:19:01,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:19:01,562 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-28 08:19:01,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:19:01,562 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-28 08:19:01,578 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-28 08:19:01,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:19:01,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:01,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:19:01,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:19:01,578 INFO L87 Difference]: Start difference. First operand 9737 states and 14087 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-28 08:19:15,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:15,391 INFO L93 Difference]: Finished difference Result 16909 states and 24969 transitions. [2022-04-28 08:19:15,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:19:15,391 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-28 08:19:15,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:19:15,391 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-28 08:19:15,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2022-04-28 08:19:15,392 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-28 08:19:15,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2022-04-28 08:19:15,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 135 transitions. [2022-04-28 08:19:15,474 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-28 08:19:28,687 INFO L225 Difference]: With dead ends: 16909 [2022-04-28 08:19:28,687 INFO L226 Difference]: Without dead ends: 16907 [2022-04-28 08:19:28,690 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-28 08:19:28,690 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 163 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 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-28 08:19:28,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 88 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:19:28,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16907 states. [2022-04-28 08:19:29,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16907 to 14345. [2022-04-28 08:19:29,783 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:19:29,797 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16907 states. Second operand has 14345 states, 14341 states have (on average 1.4015759012621156) internal successors, (20100), 14341 states have internal predecessors, (20100), 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-28 08:19:29,809 INFO L74 IsIncluded]: Start isIncluded. First operand 16907 states. Second operand has 14345 states, 14341 states have (on average 1.4015759012621156) internal successors, (20100), 14341 states have internal predecessors, (20100), 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-28 08:19:29,824 INFO L87 Difference]: Start difference. First operand 16907 states. Second operand has 14345 states, 14341 states have (on average 1.4015759012621156) internal successors, (20100), 14341 states have internal predecessors, (20100), 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-28 08:19:37,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:37,790 INFO L93 Difference]: Finished difference Result 16907 states and 24712 transitions. [2022-04-28 08:19:37,790 INFO L276 IsEmpty]: Start isEmpty. Operand 16907 states and 24712 transitions. [2022-04-28 08:19:37,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:37,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:37,814 INFO L74 IsIncluded]: Start isIncluded. First operand has 14345 states, 14341 states have (on average 1.4015759012621156) internal successors, (20100), 14341 states have internal predecessors, (20100), 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 16907 states. [2022-04-28 08:19:37,827 INFO L87 Difference]: Start difference. First operand has 14345 states, 14341 states have (on average 1.4015759012621156) internal successors, (20100), 14341 states have internal predecessors, (20100), 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 16907 states. [2022-04-28 08:19:45,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:45,336 INFO L93 Difference]: Finished difference Result 16907 states and 24712 transitions. [2022-04-28 08:19:45,336 INFO L276 IsEmpty]: Start isEmpty. Operand 16907 states and 24712 transitions. [2022-04-28 08:19:45,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:45,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:45,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:19:45,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:19:45,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14345 states, 14341 states have (on average 1.4015759012621156) internal successors, (20100), 14341 states have internal predecessors, (20100), 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-28 08:19:54,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14345 states to 14345 states and 20103 transitions. [2022-04-28 08:19:54,438 INFO L78 Accepts]: Start accepts. Automaton has 14345 states and 20103 transitions. Word has length 32 [2022-04-28 08:19:54,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:19:54,438 INFO L495 AbstractCegarLoop]: Abstraction has 14345 states and 20103 transitions. [2022-04-28 08:19:54,438 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-28 08:19:54,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14345 states and 20103 transitions. [2022-04-28 08:20:16,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20103 edges. 20103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:16,369 INFO L276 IsEmpty]: Start isEmpty. Operand 14345 states and 20103 transitions. [2022-04-28 08:20:16,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 08:20:16,377 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:20:16,377 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-28 08:20:16,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-28 08:20:16,377 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:20:16,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:20:16,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1238618077, now seen corresponding path program 1 times [2022-04-28 08:20:16,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:16,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [691421391] [2022-04-28 08:20:16,378 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:20:16,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1238618077, now seen corresponding path program 2 times [2022-04-28 08:20:16,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:20:16,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128345587] [2022-04-28 08:20:16,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:20:16,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:20:16,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:16,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:20:16,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:16,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {478071#(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); {478065#true} is VALID [2022-04-28 08:20:16,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {478065#true} assume true; {478065#true} is VALID [2022-04-28 08:20:16,410 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {478065#true} {478065#true} #251#return; {478065#true} is VALID [2022-04-28 08:20:16,411 INFO L272 TraceCheckUtils]: 0: Hoare triple {478065#true} call ULTIMATE.init(); {478071#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:20:16,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {478071#(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); {478065#true} is VALID [2022-04-28 08:20:16,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {478065#true} assume true; {478065#true} is VALID [2022-04-28 08:20:16,411 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {478065#true} {478065#true} #251#return; {478065#true} is VALID [2022-04-28 08:20:16,411 INFO L272 TraceCheckUtils]: 4: Hoare triple {478065#true} call #t~ret18 := main(); {478065#true} is VALID [2022-04-28 08:20:16,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {478065#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {478065#true} is VALID [2022-04-28 08:20:16,411 INFO L290 TraceCheckUtils]: 6: Hoare triple {478065#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {478065#true} is VALID [2022-04-28 08:20:16,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {478065#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {478065#true} is VALID [2022-04-28 08:20:16,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {478065#true} assume !(0 != ~p1~0); {478065#true} is VALID [2022-04-28 08:20:16,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {478065#true} assume !(0 != ~p2~0); {478065#true} is VALID [2022-04-28 08:20:16,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {478065#true} assume !(0 != ~p3~0); {478065#true} is VALID [2022-04-28 08:20:16,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {478065#true} assume !(0 != ~p4~0); {478065#true} is VALID [2022-04-28 08:20:16,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {478065#true} assume !(0 != ~p5~0); {478065#true} is VALID [2022-04-28 08:20:16,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {478065#true} assume !(0 != ~p6~0); {478065#true} is VALID [2022-04-28 08:20:16,412 INFO L290 TraceCheckUtils]: 14: Hoare triple {478065#true} assume !(0 != ~p7~0); {478065#true} is VALID [2022-04-28 08:20:16,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {478065#true} assume !(0 != ~p8~0); {478065#true} is VALID [2022-04-28 08:20:16,412 INFO L290 TraceCheckUtils]: 16: Hoare triple {478065#true} assume !(0 != ~p9~0); {478070#(= main_~p9~0 0)} is VALID [2022-04-28 08:20:16,412 INFO L290 TraceCheckUtils]: 17: Hoare triple {478070#(= main_~p9~0 0)} assume !(0 != ~p10~0); {478070#(= main_~p9~0 0)} is VALID [2022-04-28 08:20:16,413 INFO L290 TraceCheckUtils]: 18: Hoare triple {478070#(= main_~p9~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {478070#(= main_~p9~0 0)} is VALID [2022-04-28 08:20:16,413 INFO L290 TraceCheckUtils]: 19: Hoare triple {478070#(= main_~p9~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {478070#(= main_~p9~0 0)} is VALID [2022-04-28 08:20:16,413 INFO L290 TraceCheckUtils]: 20: Hoare triple {478070#(= main_~p9~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {478070#(= main_~p9~0 0)} is VALID [2022-04-28 08:20:16,413 INFO L290 TraceCheckUtils]: 21: Hoare triple {478070#(= main_~p9~0 0)} assume !(0 != ~p1~0); {478070#(= main_~p9~0 0)} is VALID [2022-04-28 08:20:16,413 INFO L290 TraceCheckUtils]: 22: Hoare triple {478070#(= main_~p9~0 0)} assume !(0 != ~p2~0); {478070#(= main_~p9~0 0)} is VALID [2022-04-28 08:20:16,414 INFO L290 TraceCheckUtils]: 23: Hoare triple {478070#(= main_~p9~0 0)} assume !(0 != ~p3~0); {478070#(= main_~p9~0 0)} is VALID [2022-04-28 08:20:16,414 INFO L290 TraceCheckUtils]: 24: Hoare triple {478070#(= main_~p9~0 0)} assume !(0 != ~p4~0); {478070#(= main_~p9~0 0)} is VALID [2022-04-28 08:20:16,414 INFO L290 TraceCheckUtils]: 25: Hoare triple {478070#(= main_~p9~0 0)} assume !(0 != ~p5~0); {478070#(= main_~p9~0 0)} is VALID [2022-04-28 08:20:16,414 INFO L290 TraceCheckUtils]: 26: Hoare triple {478070#(= main_~p9~0 0)} assume !(0 != ~p6~0); {478070#(= main_~p9~0 0)} is VALID [2022-04-28 08:20:16,415 INFO L290 TraceCheckUtils]: 27: Hoare triple {478070#(= main_~p9~0 0)} assume !(0 != ~p7~0); {478070#(= main_~p9~0 0)} is VALID [2022-04-28 08:20:16,415 INFO L290 TraceCheckUtils]: 28: Hoare triple {478070#(= main_~p9~0 0)} assume !(0 != ~p8~0); {478070#(= main_~p9~0 0)} is VALID [2022-04-28 08:20:16,415 INFO L290 TraceCheckUtils]: 29: Hoare triple {478070#(= main_~p9~0 0)} assume 0 != ~p9~0; {478066#false} is VALID [2022-04-28 08:20:16,415 INFO L290 TraceCheckUtils]: 30: Hoare triple {478066#false} assume 1 != ~lk9~0; {478066#false} is VALID [2022-04-28 08:20:16,415 INFO L290 TraceCheckUtils]: 31: Hoare triple {478066#false} assume !false; {478066#false} is VALID [2022-04-28 08:20:16,415 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-28 08:20:16,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:20:16,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128345587] [2022-04-28 08:20:16,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128345587] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:16,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:16,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:16,416 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:20:16,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [691421391] [2022-04-28 08:20:16,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [691421391] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:16,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:16,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:16,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007094547] [2022-04-28 08:20:16,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:20:16,416 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-28 08:20:16,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:20:16,417 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-28 08:20:16,433 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-28 08:20:16,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:20:16,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:16,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:20:16,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:20:16,433 INFO L87 Difference]: Start difference. First operand 14345 states and 20103 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-28 08:21:11,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:11,282 INFO L93 Difference]: Finished difference Result 33037 states and 46473 transitions. [2022-04-28 08:21:11,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:21:11,283 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-28 08:21:11,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:21:11,283 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-28 08:21:11,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions. [2022-04-28 08:21:11,284 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-28 08:21:11,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions. [2022-04-28 08:21:11,285 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 222 transitions. [2022-04-28 08:21:11,404 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-28 08:21:26,558 INFO L225 Difference]: With dead ends: 33037 [2022-04-28 08:21:26,558 INFO L226 Difference]: Without dead ends: 18955 [2022-04-28 08:21:26,573 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-28 08:21:26,573 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 145 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 135 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-28 08:21:26,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 135 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:21:26,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18955 states. [2022-04-28 08:21:28,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18955 to 18953. [2022-04-28 08:21:28,048 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:21:28,066 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18955 states. Second operand has 18953 states, 18949 states have (on average 1.3917357116470526) internal successors, (26372), 18949 states have internal predecessors, (26372), 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-28 08:21:28,082 INFO L74 IsIncluded]: Start isIncluded. First operand 18955 states. Second operand has 18953 states, 18949 states have (on average 1.3917357116470526) internal successors, (26372), 18949 states have internal predecessors, (26372), 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-28 08:21:28,098 INFO L87 Difference]: Start difference. First operand 18955 states. Second operand has 18953 states, 18949 states have (on average 1.3917357116470526) internal successors, (26372), 18949 states have internal predecessors, (26372), 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-28 08:21:37,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:37,358 INFO L93 Difference]: Finished difference Result 18955 states and 26376 transitions. [2022-04-28 08:21:37,359 INFO L276 IsEmpty]: Start isEmpty. Operand 18955 states and 26376 transitions. [2022-04-28 08:21:37,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:37,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:37,387 INFO L74 IsIncluded]: Start isIncluded. First operand has 18953 states, 18949 states have (on average 1.3917357116470526) internal successors, (26372), 18949 states have internal predecessors, (26372), 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 18955 states. [2022-04-28 08:21:37,404 INFO L87 Difference]: Start difference. First operand has 18953 states, 18949 states have (on average 1.3917357116470526) internal successors, (26372), 18949 states have internal predecessors, (26372), 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 18955 states. [2022-04-28 08:21:46,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:46,591 INFO L93 Difference]: Finished difference Result 18955 states and 26376 transitions. [2022-04-28 08:21:46,591 INFO L276 IsEmpty]: Start isEmpty. Operand 18955 states and 26376 transitions. [2022-04-28 08:21:46,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:46,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:46,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:21:46,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:21:46,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18953 states, 18949 states have (on average 1.3917357116470526) internal successors, (26372), 18949 states have internal predecessors, (26372), 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-28 08:22:01,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18953 states to 18953 states and 26375 transitions. [2022-04-28 08:22:01,481 INFO L78 Accepts]: Start accepts. Automaton has 18953 states and 26375 transitions. Word has length 32 [2022-04-28 08:22:01,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:22:01,481 INFO L495 AbstractCegarLoop]: Abstraction has 18953 states and 26375 transitions. [2022-04-28 08:22:01,481 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-28 08:22:01,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18953 states and 26375 transitions. [2022-04-28 08:22:29,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26375 edges. 26375 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:22:29,921 INFO L276 IsEmpty]: Start isEmpty. Operand 18953 states and 26375 transitions. [2022-04-28 08:22:29,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 08:22:29,931 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:22:29,931 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-28 08:22:29,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-28 08:22:29,931 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:22:29,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:22:29,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1331017764, now seen corresponding path program 1 times [2022-04-28 08:22:29,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:29,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2104429944] [2022-04-28 08:22:29,931 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:22:29,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1331017764, now seen corresponding path program 2 times [2022-04-28 08:22:29,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:22:29,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653542642] [2022-04-28 08:22:29,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:22:29,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:22:29,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:29,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:22:29,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:29,984 INFO L290 TraceCheckUtils]: 0: Hoare triple {619973#(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); {619967#true} is VALID [2022-04-28 08:22:29,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {619967#true} assume true; {619967#true} is VALID [2022-04-28 08:22:29,984 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {619967#true} {619967#true} #251#return; {619967#true} is VALID [2022-04-28 08:22:29,984 INFO L272 TraceCheckUtils]: 0: Hoare triple {619967#true} call ULTIMATE.init(); {619973#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:22:29,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {619973#(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); {619967#true} is VALID [2022-04-28 08:22:29,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {619967#true} assume true; {619967#true} is VALID [2022-04-28 08:22:29,985 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {619967#true} {619967#true} #251#return; {619967#true} is VALID [2022-04-28 08:22:29,985 INFO L272 TraceCheckUtils]: 4: Hoare triple {619967#true} call #t~ret18 := main(); {619967#true} is VALID [2022-04-28 08:22:29,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {619967#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {619967#true} is VALID [2022-04-28 08:22:29,985 INFO L290 TraceCheckUtils]: 6: Hoare triple {619967#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {619967#true} is VALID [2022-04-28 08:22:29,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {619967#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {619967#true} is VALID [2022-04-28 08:22:29,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {619967#true} assume !(0 != ~p1~0); {619967#true} is VALID [2022-04-28 08:22:29,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {619967#true} assume !(0 != ~p2~0); {619967#true} is VALID [2022-04-28 08:22:29,985 INFO L290 TraceCheckUtils]: 10: Hoare triple {619967#true} assume !(0 != ~p3~0); {619967#true} is VALID [2022-04-28 08:22:29,985 INFO L290 TraceCheckUtils]: 11: Hoare triple {619967#true} assume !(0 != ~p4~0); {619967#true} is VALID [2022-04-28 08:22:29,985 INFO L290 TraceCheckUtils]: 12: Hoare triple {619967#true} assume !(0 != ~p5~0); {619967#true} is VALID [2022-04-28 08:22:29,985 INFO L290 TraceCheckUtils]: 13: Hoare triple {619967#true} assume !(0 != ~p6~0); {619967#true} is VALID [2022-04-28 08:22:29,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {619967#true} assume !(0 != ~p7~0); {619967#true} is VALID [2022-04-28 08:22:29,985 INFO L290 TraceCheckUtils]: 15: Hoare triple {619967#true} assume !(0 != ~p8~0); {619967#true} is VALID [2022-04-28 08:22:29,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {619967#true} assume 0 != ~p9~0;~lk9~0 := 1; {619972#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:22:29,986 INFO L290 TraceCheckUtils]: 17: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p10~0); {619972#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:22:29,986 INFO L290 TraceCheckUtils]: 18: Hoare triple {619972#(not (= main_~p9~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {619972#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:22:29,987 INFO L290 TraceCheckUtils]: 19: Hoare triple {619972#(not (= main_~p9~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {619972#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:22:29,987 INFO L290 TraceCheckUtils]: 20: Hoare triple {619972#(not (= main_~p9~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {619972#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:22:29,987 INFO L290 TraceCheckUtils]: 21: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p1~0); {619972#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:22:29,987 INFO L290 TraceCheckUtils]: 22: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p2~0); {619972#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:22:29,988 INFO L290 TraceCheckUtils]: 23: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p3~0); {619972#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:22:29,988 INFO L290 TraceCheckUtils]: 24: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p4~0); {619972#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:22:29,988 INFO L290 TraceCheckUtils]: 25: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p5~0); {619972#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:22:29,988 INFO L290 TraceCheckUtils]: 26: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p6~0); {619972#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:22:29,989 INFO L290 TraceCheckUtils]: 27: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p7~0); {619972#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:22:29,989 INFO L290 TraceCheckUtils]: 28: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p8~0); {619972#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:22:29,992 INFO L290 TraceCheckUtils]: 29: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p9~0); {619968#false} is VALID [2022-04-28 08:22:29,992 INFO L290 TraceCheckUtils]: 30: Hoare triple {619968#false} assume 0 != ~p10~0; {619968#false} is VALID [2022-04-28 08:22:29,992 INFO L290 TraceCheckUtils]: 31: Hoare triple {619968#false} assume 1 != ~lk10~0; {619968#false} is VALID [2022-04-28 08:22:29,992 INFO L290 TraceCheckUtils]: 32: Hoare triple {619968#false} assume !false; {619968#false} is VALID [2022-04-28 08:22:29,992 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-28 08:22:29,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:22:29,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653542642] [2022-04-28 08:22:29,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653542642] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:29,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:29,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:22:29,992 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:22:29,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2104429944] [2022-04-28 08:22:29,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2104429944] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:29,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:29,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:22:29,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541743913] [2022-04-28 08:22:29,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:22:29,993 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-28 08:22:29,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:22:29,993 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-28 08:22:30,013 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-28 08:22:30,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:22:30,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:30,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:22:30,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:22:30,013 INFO L87 Difference]: Start difference. First operand 18953 states and 26375 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-28 08:23:08,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:23:08,676 INFO L93 Difference]: Finished difference Result 28429 states and 39433 transitions. [2022-04-28 08:23:08,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:23:08,676 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-28 08:23:08,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:23:08,677 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-28 08:23:08,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions. [2022-04-28 08:23:08,678 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-28 08:23:08,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions. [2022-04-28 08:23:08,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 217 transitions. [2022-04-28 08:23:08,796 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-28 08:23:24,155 INFO L225 Difference]: With dead ends: 28429 [2022-04-28 08:23:24,155 INFO L226 Difference]: Without dead ends: 19211 [2022-04-28 08:23:24,166 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-28 08:23:24,166 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 162 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 119 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-28 08:23:24,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 119 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:23:24,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19211 states. [2022-04-28 08:23:25,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19211 to 19209. [2022-04-28 08:23:25,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:23:25,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19211 states. Second operand has 19209 states, 19205 states have (on average 1.37318406664931) internal successors, (26372), 19205 states have internal predecessors, (26372), 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-28 08:23:25,745 INFO L74 IsIncluded]: Start isIncluded. First operand 19211 states. Second operand has 19209 states, 19205 states have (on average 1.37318406664931) internal successors, (26372), 19205 states have internal predecessors, (26372), 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-28 08:23:25,763 INFO L87 Difference]: Start difference. First operand 19211 states. Second operand has 19209 states, 19205 states have (on average 1.37318406664931) internal successors, (26372), 19205 states have internal predecessors, (26372), 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-28 08:23:35,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:23:35,530 INFO L93 Difference]: Finished difference Result 19211 states and 26376 transitions. [2022-04-28 08:23:35,530 INFO L276 IsEmpty]: Start isEmpty. Operand 19211 states and 26376 transitions. [2022-04-28 08:23:35,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:23:35,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:23:35,561 INFO L74 IsIncluded]: Start isIncluded. First operand has 19209 states, 19205 states have (on average 1.37318406664931) internal successors, (26372), 19205 states have internal predecessors, (26372), 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 19211 states. [2022-04-28 08:23:35,580 INFO L87 Difference]: Start difference. First operand has 19209 states, 19205 states have (on average 1.37318406664931) internal successors, (26372), 19205 states have internal predecessors, (26372), 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 19211 states. [2022-04-28 08:23:45,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:23:45,134 INFO L93 Difference]: Finished difference Result 19211 states and 26376 transitions. [2022-04-28 08:23:45,134 INFO L276 IsEmpty]: Start isEmpty. Operand 19211 states and 26376 transitions. [2022-04-28 08:23:45,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:23:45,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:23:45,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:23:45,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:23:45,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19209 states, 19205 states have (on average 1.37318406664931) internal successors, (26372), 19205 states have internal predecessors, (26372), 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-28 08:24:00,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19209 states to 19209 states and 26375 transitions. [2022-04-28 08:24:00,945 INFO L78 Accepts]: Start accepts. Automaton has 19209 states and 26375 transitions. Word has length 33 [2022-04-28 08:24:00,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:24:00,945 INFO L495 AbstractCegarLoop]: Abstraction has 19209 states and 26375 transitions. [2022-04-28 08:24:00,945 INFO L496 AbstractCegarLoop]: INTERPOLANT 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) [2022-04-28 08:24:00,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19209 states and 26375 transitions. [2022-04-28 08:24:29,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26375 edges. 26375 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:24:29,143 INFO L276 IsEmpty]: Start isEmpty. Operand 19209 states and 26375 transitions. [2022-04-28 08:24:29,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 08:24:29,152 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:24:29,152 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-28 08:24:29,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-28 08:24:29,152 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:24:29,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:24:29,153 INFO L85 PathProgramCache]: Analyzing trace with hash -257330138, now seen corresponding path program 1 times [2022-04-28 08:24:29,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:24:29,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [784019744] [2022-04-28 08:24:29,153 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:24:29,153 INFO L85 PathProgramCache]: Analyzing trace with hash -257330138, now seen corresponding path program 2 times [2022-04-28 08:24:29,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:24:29,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181915991] [2022-04-28 08:24:29,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:24:29,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:24:29,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:24:29,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:24:29,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:24:29,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {753683#(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); {753677#true} is VALID [2022-04-28 08:24:29,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {753677#true} assume true; {753677#true} is VALID [2022-04-28 08:24:29,182 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {753677#true} {753677#true} #251#return; {753677#true} is VALID [2022-04-28 08:24:29,182 INFO L272 TraceCheckUtils]: 0: Hoare triple {753677#true} call ULTIMATE.init(); {753683#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:24:29,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {753683#(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); {753677#true} is VALID [2022-04-28 08:24:29,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {753677#true} assume true; {753677#true} is VALID [2022-04-28 08:24:29,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {753677#true} {753677#true} #251#return; {753677#true} is VALID [2022-04-28 08:24:29,183 INFO L272 TraceCheckUtils]: 4: Hoare triple {753677#true} call #t~ret18 := main(); {753677#true} is VALID [2022-04-28 08:24:29,183 INFO L290 TraceCheckUtils]: 5: Hoare triple {753677#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {753677#true} is VALID [2022-04-28 08:24:29,183 INFO L290 TraceCheckUtils]: 6: Hoare triple {753677#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {753677#true} is VALID [2022-04-28 08:24:29,183 INFO L290 TraceCheckUtils]: 7: Hoare triple {753677#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {753677#true} is VALID [2022-04-28 08:24:29,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {753677#true} assume !(0 != ~p1~0); {753677#true} is VALID [2022-04-28 08:24:29,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {753677#true} assume !(0 != ~p2~0); {753677#true} is VALID [2022-04-28 08:24:29,183 INFO L290 TraceCheckUtils]: 10: Hoare triple {753677#true} assume !(0 != ~p3~0); {753677#true} is VALID [2022-04-28 08:24:29,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {753677#true} assume !(0 != ~p4~0); {753677#true} is VALID [2022-04-28 08:24:29,183 INFO L290 TraceCheckUtils]: 12: Hoare triple {753677#true} assume !(0 != ~p5~0); {753677#true} is VALID [2022-04-28 08:24:29,183 INFO L290 TraceCheckUtils]: 13: Hoare triple {753677#true} assume !(0 != ~p6~0); {753677#true} is VALID [2022-04-28 08:24:29,183 INFO L290 TraceCheckUtils]: 14: Hoare triple {753677#true} assume !(0 != ~p7~0); {753677#true} is VALID [2022-04-28 08:24:29,183 INFO L290 TraceCheckUtils]: 15: Hoare triple {753677#true} assume !(0 != ~p8~0); {753677#true} is VALID [2022-04-28 08:24:29,183 INFO L290 TraceCheckUtils]: 16: Hoare triple {753677#true} assume !(0 != ~p9~0); {753677#true} is VALID [2022-04-28 08:24:29,184 INFO L290 TraceCheckUtils]: 17: Hoare triple {753677#true} assume !(0 != ~p10~0); {753682#(= main_~p10~0 0)} is VALID [2022-04-28 08:24:29,184 INFO L290 TraceCheckUtils]: 18: Hoare triple {753682#(= main_~p10~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {753682#(= main_~p10~0 0)} is VALID [2022-04-28 08:24:29,184 INFO L290 TraceCheckUtils]: 19: Hoare triple {753682#(= main_~p10~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {753682#(= main_~p10~0 0)} is VALID [2022-04-28 08:24:29,184 INFO L290 TraceCheckUtils]: 20: Hoare triple {753682#(= main_~p10~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {753682#(= main_~p10~0 0)} is VALID [2022-04-28 08:24:29,185 INFO L290 TraceCheckUtils]: 21: Hoare triple {753682#(= main_~p10~0 0)} assume !(0 != ~p1~0); {753682#(= main_~p10~0 0)} is VALID [2022-04-28 08:24:29,185 INFO L290 TraceCheckUtils]: 22: Hoare triple {753682#(= main_~p10~0 0)} assume !(0 != ~p2~0); {753682#(= main_~p10~0 0)} is VALID [2022-04-28 08:24:29,185 INFO L290 TraceCheckUtils]: 23: Hoare triple {753682#(= main_~p10~0 0)} assume !(0 != ~p3~0); {753682#(= main_~p10~0 0)} is VALID [2022-04-28 08:24:29,185 INFO L290 TraceCheckUtils]: 24: Hoare triple {753682#(= main_~p10~0 0)} assume !(0 != ~p4~0); {753682#(= main_~p10~0 0)} is VALID [2022-04-28 08:24:29,186 INFO L290 TraceCheckUtils]: 25: Hoare triple {753682#(= main_~p10~0 0)} assume !(0 != ~p5~0); {753682#(= main_~p10~0 0)} is VALID [2022-04-28 08:24:29,186 INFO L290 TraceCheckUtils]: 26: Hoare triple {753682#(= main_~p10~0 0)} assume !(0 != ~p6~0); {753682#(= main_~p10~0 0)} is VALID [2022-04-28 08:24:29,186 INFO L290 TraceCheckUtils]: 27: Hoare triple {753682#(= main_~p10~0 0)} assume !(0 != ~p7~0); {753682#(= main_~p10~0 0)} is VALID [2022-04-28 08:24:29,186 INFO L290 TraceCheckUtils]: 28: Hoare triple {753682#(= main_~p10~0 0)} assume !(0 != ~p8~0); {753682#(= main_~p10~0 0)} is VALID [2022-04-28 08:24:29,187 INFO L290 TraceCheckUtils]: 29: Hoare triple {753682#(= main_~p10~0 0)} assume !(0 != ~p9~0); {753682#(= main_~p10~0 0)} is VALID [2022-04-28 08:24:29,187 INFO L290 TraceCheckUtils]: 30: Hoare triple {753682#(= main_~p10~0 0)} assume 0 != ~p10~0; {753678#false} is VALID [2022-04-28 08:24:29,187 INFO L290 TraceCheckUtils]: 31: Hoare triple {753678#false} assume 1 != ~lk10~0; {753678#false} is VALID [2022-04-28 08:24:29,187 INFO L290 TraceCheckUtils]: 32: Hoare triple {753678#false} assume !false; {753678#false} is VALID [2022-04-28 08:24:29,187 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-28 08:24:29,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:24:29,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181915991] [2022-04-28 08:24:29,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181915991] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:24:29,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:24:29,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:24:29,188 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:24:29,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [784019744] [2022-04-28 08:24:29,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [784019744] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:24:29,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:24:29,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:24:29,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661797047] [2022-04-28 08:24:29,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:24:29,188 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-28 08:24:29,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:24:29,189 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-28 08:24:29,205 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-28 08:24:29,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:24:29,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:24:29,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:24:29,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:24:29,205 INFO L87 Difference]: Start difference. First operand 19209 states and 26375 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-28 08:29:02,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:29:02,049 INFO L93 Difference]: Finished difference Result 56077 states and 76041 transitions. [2022-04-28 08:29:02,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:29:02,049 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-28 08:29:02,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:29:02,049 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-28 08:29:02,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 220 transitions. [2022-04-28 08:29:02,050 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-28 08:29:02,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 220 transitions. [2022-04-28 08:29:02,051 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 220 transitions. [2022-04-28 08:29:02,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 220 edges. 220 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:30:01,352 INFO L225 Difference]: With dead ends: 56077 [2022-04-28 08:30:01,352 INFO L226 Difference]: Without dead ends: 37387 [2022-04-28 08:30:01,376 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-28 08:30:01,376 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 174 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 105 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-28 08:30:01,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 105 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:30:01,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37387 states. [2022-04-28 08:30:04,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37387 to 37385. [2022-04-28 08:30:04,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:30:04,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37387 states. Second operand has 37385 states, 37381 states have (on average 1.3286963965651) internal successors, (49668), 37381 states have internal predecessors, (49668), 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-28 08:30:04,675 INFO L74 IsIncluded]: Start isIncluded. First operand 37387 states. Second operand has 37385 states, 37381 states have (on average 1.3286963965651) internal successors, (49668), 37381 states have internal predecessors, (49668), 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-28 08:30:04,722 INFO L87 Difference]: Start difference. First operand 37387 states. Second operand has 37385 states, 37381 states have (on average 1.3286963965651) internal successors, (49668), 37381 states have internal predecessors, (49668), 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)