/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/locks/test_locks_9.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 15:10:23,492 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 15:10:23,501 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 15:10:23,533 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 15:10:23,533 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 15:10:23,534 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 15:10:23,539 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 15:10:23,542 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 15:10:23,544 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 15:10:23,547 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 15:10:23,547 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 15:10:23,549 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 15:10:23,549 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 15:10:23,550 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 15:10:23,551 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 15:10:23,552 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 15:10:23,552 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 15:10:23,553 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 15:10:23,556 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 15:10:23,559 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 15:10:23,561 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 15:10:23,561 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 15:10:23,562 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 15:10:23,562 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 15:10:23,563 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 15:10:23,568 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 15:10:23,568 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 15:10:23,568 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 15:10:23,569 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 15:10:23,569 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 15:10:23,570 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 15:10:23,570 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 15:10:23,571 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 15:10:23,572 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 15:10:23,572 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 15:10:23,572 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 15:10:23,572 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 15:10:23,573 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 15:10:23,573 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 15:10:23,573 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 15:10:23,574 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 15:10:23,575 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 15:10:23,576 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 15:10:23,599 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 15:10:23,599 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 15:10:23,600 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 15:10:23,600 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 15:10:23,600 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 15:10:23,600 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 15:10:23,600 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 15:10:23,601 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 15:10:23,601 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 15:10:23,601 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 15:10:23,601 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 15:10:23,601 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 15:10:23,601 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 15:10:23,601 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 15:10:23,601 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 15:10:23,601 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 15:10:23,601 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 15:10:23,601 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 15:10:23,602 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 15:10:23,602 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 15:10:23,602 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 15:10:23,602 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 15:10:23,602 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 15:10:23,602 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 15:10:23,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:10:23,602 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 15:10:23,602 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 15:10:23,602 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 15:10:23,602 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 15:10:23,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 15:10:23,603 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 15:10:23,603 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 15:10:23,603 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 15:10:23,603 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 15:10:23,747 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 15:10:23,759 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 15:10:23,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 15:10:23,761 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 15:10:23,764 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 15:10:23,765 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_9.c [2022-04-27 15:10:23,810 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/964d48381/a865b3696d564cdfa7a3514864718052/FLAG81b16d687 [2022-04-27 15:10:24,146 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 15:10:24,146 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_9.c [2022-04-27 15:10:24,154 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/964d48381/a865b3696d564cdfa7a3514864718052/FLAG81b16d687 [2022-04-27 15:10:24,574 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/964d48381/a865b3696d564cdfa7a3514864718052 [2022-04-27 15:10:24,576 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 15:10:24,577 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 15:10:24,579 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 15:10:24,579 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 15:10:24,581 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 15:10:24,582 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:10:24" (1/1) ... [2022-04-27 15:10:24,583 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2957192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:24, skipping insertion in model container [2022-04-27 15:10:24,583 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:10:24" (1/1) ... [2022-04-27 15:10:24,588 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 15:10:24,598 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 15:10:24,716 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_9.c[3555,3568] [2022-04-27 15:10:24,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:10:24,723 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 15:10:24,737 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_9.c[3555,3568] [2022-04-27 15:10:24,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:10:24,746 INFO L208 MainTranslator]: Completed translation [2022-04-27 15:10:24,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:24 WrapperNode [2022-04-27 15:10:24,746 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 15:10:24,747 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 15:10:24,747 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 15:10:24,747 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 15:10:24,754 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:24" (1/1) ... [2022-04-27 15:10:24,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:24" (1/1) ... [2022-04-27 15:10:24,759 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:24" (1/1) ... [2022-04-27 15:10:24,759 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:24" (1/1) ... [2022-04-27 15:10:24,764 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:24" (1/1) ... [2022-04-27 15:10:24,768 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:24" (1/1) ... [2022-04-27 15:10:24,769 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:24" (1/1) ... [2022-04-27 15:10:24,770 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 15:10:24,771 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 15:10:24,771 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 15:10:24,771 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 15:10:24,771 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:24" (1/1) ... [2022-04-27 15:10:24,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:10:24,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:10:24,796 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 15:10:24,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 15:10:24,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 15:10:24,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 15:10:24,823 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 15:10:24,823 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 15:10:24,823 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 15:10:24,823 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 15:10:24,823 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 15:10:24,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 15:10:24,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 15:10:24,823 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 15:10:24,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 15:10:24,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 15:10:24,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 15:10:24,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 15:10:24,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 15:10:24,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 15:10:24,867 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 15:10:24,868 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 15:10:25,099 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 15:10:25,104 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 15:10:25,105 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 15:10:25,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:10:25 BoogieIcfgContainer [2022-04-27 15:10:25,106 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 15:10:25,107 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 15:10:25,107 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 15:10:25,110 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 15:10:25,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 03:10:24" (1/3) ... [2022-04-27 15:10:25,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b0cae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:10:25, skipping insertion in model container [2022-04-27 15:10:25,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:24" (2/3) ... [2022-04-27 15:10:25,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b0cae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:10:25, skipping insertion in model container [2022-04-27 15:10:25,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:10:25" (3/3) ... [2022-04-27 15:10:25,112 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2022-04-27 15:10:25,121 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 15:10:25,121 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 15:10:25,152 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 15:10:25,164 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2848c8c3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@15791d98 [2022-04-27 15:10:25,164 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 15:10:25,171 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 37 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 15:10:25,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 15:10:25,178 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:25,179 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:25,180 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:25,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:25,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1605461033, now seen corresponding path program 1 times [2022-04-27 15:10:25,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:25,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906329096] [2022-04-27 15:10:25,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:25,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:25,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:25,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:25,416 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {45#true} is VALID [2022-04-27 15:10:25,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#true} assume true; {45#true} is VALID [2022-04-27 15:10:25,416 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45#true} {45#true} #183#return; {45#true} is VALID [2022-04-27 15:10:25,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {45#true} call ULTIMATE.init(); {51#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:25,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {45#true} is VALID [2022-04-27 15:10:25,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {45#true} assume true; {45#true} is VALID [2022-04-27 15:10:25,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45#true} {45#true} #183#return; {45#true} is VALID [2022-04-27 15:10:25,418 INFO L272 TraceCheckUtils]: 4: Hoare triple {45#true} call #t~ret14 := main(); {45#true} is VALID [2022-04-27 15:10:25,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {45#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;havoc ~cond~0; {45#true} is VALID [2022-04-27 15:10:25,419 INFO L290 TraceCheckUtils]: 6: Hoare triple {45#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {45#true} is VALID [2022-04-27 15:10:25,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {45#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; {45#true} is VALID [2022-04-27 15:10:25,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {45#true} assume 0 != ~p1~0;~lk1~0 := 1; {50#(= main_~lk1~0 1)} is VALID [2022-04-27 15:10:25,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {50#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {50#(= main_~lk1~0 1)} is VALID [2022-04-27 15:10:25,421 INFO L290 TraceCheckUtils]: 10: Hoare triple {50#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {50#(= main_~lk1~0 1)} is VALID [2022-04-27 15:10:25,421 INFO L290 TraceCheckUtils]: 11: Hoare triple {50#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {50#(= main_~lk1~0 1)} is VALID [2022-04-27 15:10:25,422 INFO L290 TraceCheckUtils]: 12: Hoare triple {50#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {50#(= main_~lk1~0 1)} is VALID [2022-04-27 15:10:25,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {50#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {50#(= main_~lk1~0 1)} is VALID [2022-04-27 15:10:25,424 INFO L290 TraceCheckUtils]: 14: Hoare triple {50#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {50#(= main_~lk1~0 1)} is VALID [2022-04-27 15:10:25,424 INFO L290 TraceCheckUtils]: 15: Hoare triple {50#(= main_~lk1~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {50#(= main_~lk1~0 1)} is VALID [2022-04-27 15:10:25,425 INFO L290 TraceCheckUtils]: 16: Hoare triple {50#(= main_~lk1~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {50#(= main_~lk1~0 1)} is VALID [2022-04-27 15:10:25,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {50#(= main_~lk1~0 1)} assume 0 != ~p1~0; {50#(= main_~lk1~0 1)} is VALID [2022-04-27 15:10:25,426 INFO L290 TraceCheckUtils]: 18: Hoare triple {50#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {46#false} is VALID [2022-04-27 15:10:25,427 INFO L290 TraceCheckUtils]: 19: Hoare triple {46#false} assume !false; {46#false} is VALID [2022-04-27 15:10:25,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:25,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:25,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906329096] [2022-04-27 15:10:25,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906329096] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:25,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:25,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:25,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616634152] [2022-04-27 15:10:25,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:25,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 15:10:25,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:25,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:25,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:25,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:25,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:25,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:25,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:25,481 INFO L87 Difference]: Start difference. First operand has 42 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 37 states have internal predecessors, (67), 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 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:25,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:25,734 INFO L93 Difference]: Finished difference Result 82 states and 139 transitions. [2022-04-27 15:10:25,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:25,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 15:10:25,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:25,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:25,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-27 15:10:25,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:25,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-27 15:10:25,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 139 transitions. [2022-04-27 15:10:25,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:25,905 INFO L225 Difference]: With dead ends: 82 [2022-04-27 15:10:25,905 INFO L226 Difference]: Without dead ends: 67 [2022-04-27 15:10:25,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:25,910 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 157 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:25,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 83 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:10:25,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-27 15:10:25,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 47. [2022-04-27 15:10:25,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:25,947 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 47 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 43 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:25,948 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 47 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 43 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:25,949 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 47 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 43 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:25,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:25,957 INFO L93 Difference]: Finished difference Result 67 states and 117 transitions. [2022-04-27 15:10:25,957 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 117 transitions. [2022-04-27 15:10:25,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:25,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:25,960 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 43 states have internal predecessors, (79), 2 states have call successors, (2), 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 67 states. [2022-04-27 15:10:25,961 INFO L87 Difference]: Start difference. First operand has 47 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 43 states have internal predecessors, (79), 2 states have call successors, (2), 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 67 states. [2022-04-27 15:10:25,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:25,967 INFO L93 Difference]: Finished difference Result 67 states and 117 transitions. [2022-04-27 15:10:25,967 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 117 transitions. [2022-04-27 15:10:25,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:25,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:25,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:25,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:25,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 43 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:25,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 82 transitions. [2022-04-27 15:10:25,973 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 82 transitions. Word has length 20 [2022-04-27 15:10:25,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:25,975 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 82 transitions. [2022-04-27 15:10:25,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:25,978 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 82 transitions. [2022-04-27 15:10:25,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 15:10:25,979 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:25,979 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:25,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 15:10:25,979 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:25,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:25,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1347295595, now seen corresponding path program 1 times [2022-04-27 15:10:25,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:25,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488585142] [2022-04-27 15:10:25,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:25,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:26,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:26,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:26,047 INFO L290 TraceCheckUtils]: 0: Hoare triple {344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {338#true} is VALID [2022-04-27 15:10:26,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {338#true} assume true; {338#true} is VALID [2022-04-27 15:10:26,048 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {338#true} {338#true} #183#return; {338#true} is VALID [2022-04-27 15:10:26,048 INFO L272 TraceCheckUtils]: 0: Hoare triple {338#true} call ULTIMATE.init(); {344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:26,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {338#true} is VALID [2022-04-27 15:10:26,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {338#true} assume true; {338#true} is VALID [2022-04-27 15:10:26,049 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {338#true} {338#true} #183#return; {338#true} is VALID [2022-04-27 15:10:26,049 INFO L272 TraceCheckUtils]: 4: Hoare triple {338#true} call #t~ret14 := main(); {338#true} is VALID [2022-04-27 15:10:26,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {338#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;havoc ~cond~0; {338#true} is VALID [2022-04-27 15:10:26,049 INFO L290 TraceCheckUtils]: 6: Hoare triple {338#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {338#true} is VALID [2022-04-27 15:10:26,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {338#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; {338#true} is VALID [2022-04-27 15:10:26,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {338#true} assume !(0 != ~p1~0); {343#(= main_~p1~0 0)} is VALID [2022-04-27 15:10:26,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {343#(= main_~p1~0 0)} assume !(0 != ~p2~0); {343#(= main_~p1~0 0)} is VALID [2022-04-27 15:10:26,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {343#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {343#(= main_~p1~0 0)} is VALID [2022-04-27 15:10:26,051 INFO L290 TraceCheckUtils]: 11: Hoare triple {343#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {343#(= main_~p1~0 0)} is VALID [2022-04-27 15:10:26,051 INFO L290 TraceCheckUtils]: 12: Hoare triple {343#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {343#(= main_~p1~0 0)} is VALID [2022-04-27 15:10:26,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {343#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {343#(= main_~p1~0 0)} is VALID [2022-04-27 15:10:26,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {343#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {343#(= main_~p1~0 0)} is VALID [2022-04-27 15:10:26,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {343#(= main_~p1~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {343#(= main_~p1~0 0)} is VALID [2022-04-27 15:10:26,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {343#(= main_~p1~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {343#(= main_~p1~0 0)} is VALID [2022-04-27 15:10:26,053 INFO L290 TraceCheckUtils]: 17: Hoare triple {343#(= main_~p1~0 0)} assume 0 != ~p1~0; {339#false} is VALID [2022-04-27 15:10:26,053 INFO L290 TraceCheckUtils]: 18: Hoare triple {339#false} assume 1 != ~lk1~0; {339#false} is VALID [2022-04-27 15:10:26,053 INFO L290 TraceCheckUtils]: 19: Hoare triple {339#false} assume !false; {339#false} is VALID [2022-04-27 15:10:26,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:26,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:26,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488585142] [2022-04-27 15:10:26,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488585142] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:26,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:26,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:26,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735962557] [2022-04-27 15:10:26,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:26,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 15:10:26,056 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:26,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:26,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:26,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:26,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:26,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:26,071 INFO L87 Difference]: Start difference. First operand 47 states and 82 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:26,280 INFO L93 Difference]: Finished difference Result 108 states and 193 transitions. [2022-04-27 15:10:26,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:26,280 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 15:10:26,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:26,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2022-04-27 15:10:26,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2022-04-27 15:10:26,285 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 174 transitions. [2022-04-27 15:10:26,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:26,415 INFO L225 Difference]: With dead ends: 108 [2022-04-27 15:10:26,415 INFO L226 Difference]: Without dead ends: 67 [2022-04-27 15:10:26,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:26,416 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 133 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:26,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 87 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:10:26,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-27 15:10:26,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2022-04-27 15:10:26,421 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:26,421 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 65 states, 61 states have (on average 1.819672131147541) internal successors, (111), 61 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-27 15:10:26,422 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 65 states, 61 states have (on average 1.819672131147541) internal successors, (111), 61 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-27 15:10:26,422 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 65 states, 61 states have (on average 1.819672131147541) internal successors, (111), 61 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-27 15:10:26,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:26,425 INFO L93 Difference]: Finished difference Result 67 states and 115 transitions. [2022-04-27 15:10:26,425 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 115 transitions. [2022-04-27 15:10:26,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:26,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:26,425 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 61 states have (on average 1.819672131147541) internal successors, (111), 61 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 67 states. [2022-04-27 15:10:26,426 INFO L87 Difference]: Start difference. First operand has 65 states, 61 states have (on average 1.819672131147541) internal successors, (111), 61 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 67 states. [2022-04-27 15:10:26,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:26,428 INFO L93 Difference]: Finished difference Result 67 states and 115 transitions. [2022-04-27 15:10:26,428 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 115 transitions. [2022-04-27 15:10:26,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:26,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:26,429 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:26,429 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:26,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 61 states have (on average 1.819672131147541) internal successors, (111), 61 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-27 15:10:26,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 114 transitions. [2022-04-27 15:10:26,431 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 114 transitions. Word has length 20 [2022-04-27 15:10:26,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:26,431 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 114 transitions. [2022-04-27 15:10:26,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,431 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 114 transitions. [2022-04-27 15:10:26,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 15:10:26,432 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:26,432 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] [2022-04-27 15:10:26,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 15:10:26,432 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:26,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:26,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1770529236, now seen corresponding path program 1 times [2022-04-27 15:10:26,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:26,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933529792] [2022-04-27 15:10:26,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:26,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:26,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:26,487 INFO L290 TraceCheckUtils]: 0: Hoare triple {680#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {674#true} is VALID [2022-04-27 15:10:26,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {674#true} assume true; {674#true} is VALID [2022-04-27 15:10:26,487 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {674#true} {674#true} #183#return; {674#true} is VALID [2022-04-27 15:10:26,488 INFO L272 TraceCheckUtils]: 0: Hoare triple {674#true} call ULTIMATE.init(); {680#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:26,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {680#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {674#true} is VALID [2022-04-27 15:10:26,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {674#true} assume true; {674#true} is VALID [2022-04-27 15:10:26,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {674#true} {674#true} #183#return; {674#true} is VALID [2022-04-27 15:10:26,488 INFO L272 TraceCheckUtils]: 4: Hoare triple {674#true} call #t~ret14 := main(); {674#true} is VALID [2022-04-27 15:10:26,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {674#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;havoc ~cond~0; {674#true} is VALID [2022-04-27 15:10:26,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {674#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {674#true} is VALID [2022-04-27 15:10:26,489 INFO L290 TraceCheckUtils]: 7: Hoare triple {674#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; {674#true} is VALID [2022-04-27 15:10:26,489 INFO L290 TraceCheckUtils]: 8: Hoare triple {674#true} assume 0 != ~p1~0;~lk1~0 := 1; {679#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:10:26,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {679#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {679#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:10:26,490 INFO L290 TraceCheckUtils]: 10: Hoare triple {679#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {679#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:10:26,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {679#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {679#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:10:26,490 INFO L290 TraceCheckUtils]: 12: Hoare triple {679#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {679#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:10:26,491 INFO L290 TraceCheckUtils]: 13: Hoare triple {679#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {679#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:10:26,491 INFO L290 TraceCheckUtils]: 14: Hoare triple {679#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {679#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:10:26,491 INFO L290 TraceCheckUtils]: 15: Hoare triple {679#(not (= main_~p1~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {679#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:10:26,491 INFO L290 TraceCheckUtils]: 16: Hoare triple {679#(not (= main_~p1~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {679#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:10:26,492 INFO L290 TraceCheckUtils]: 17: Hoare triple {679#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {675#false} is VALID [2022-04-27 15:10:26,492 INFO L290 TraceCheckUtils]: 18: Hoare triple {675#false} assume 0 != ~p2~0; {675#false} is VALID [2022-04-27 15:10:26,492 INFO L290 TraceCheckUtils]: 19: Hoare triple {675#false} assume 1 != ~lk2~0; {675#false} is VALID [2022-04-27 15:10:26,492 INFO L290 TraceCheckUtils]: 20: Hoare triple {675#false} assume !false; {675#false} is VALID [2022-04-27 15:10:26,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:26,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:26,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933529792] [2022-04-27 15:10:26,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933529792] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:26,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:26,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:26,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889978296] [2022-04-27 15:10:26,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:26,494 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 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 21 [2022-04-27 15:10:26,494 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:26,494 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:26,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:26,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:26,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:26,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:26,507 INFO L87 Difference]: Start difference. First operand 65 states and 114 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:26,651 INFO L93 Difference]: Finished difference Result 100 states and 172 transitions. [2022-04-27 15:10:26,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:26,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 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 21 [2022-04-27 15:10:26,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:26,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2022-04-27 15:10:26,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2022-04-27 15:10:26,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 169 transitions. [2022-04-27 15:10:26,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:26,764 INFO L225 Difference]: With dead ends: 100 [2022-04-27 15:10:26,764 INFO L226 Difference]: Without dead ends: 70 [2022-04-27 15:10:26,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:26,765 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 118 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:26,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 103 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:26,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-27 15:10:26,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2022-04-27 15:10:26,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:26,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 68 states, 64 states have (on average 1.765625) internal successors, (113), 64 states have internal predecessors, (113), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,770 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 68 states, 64 states have (on average 1.765625) internal successors, (113), 64 states have internal predecessors, (113), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,770 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 68 states, 64 states have (on average 1.765625) internal successors, (113), 64 states have internal predecessors, (113), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:26,772 INFO L93 Difference]: Finished difference Result 70 states and 117 transitions. [2022-04-27 15:10:26,772 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 117 transitions. [2022-04-27 15:10:26,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:26,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:26,773 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 64 states have (on average 1.765625) internal successors, (113), 64 states have internal predecessors, (113), 2 states have call successors, (2), 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 70 states. [2022-04-27 15:10:26,773 INFO L87 Difference]: Start difference. First operand has 68 states, 64 states have (on average 1.765625) internal successors, (113), 64 states have internal predecessors, (113), 2 states have call successors, (2), 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 70 states. [2022-04-27 15:10:26,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:26,775 INFO L93 Difference]: Finished difference Result 70 states and 117 transitions. [2022-04-27 15:10:26,775 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 117 transitions. [2022-04-27 15:10:26,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:26,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:26,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:26,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:26,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 64 states have (on average 1.765625) internal successors, (113), 64 states have internal predecessors, (113), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 116 transitions. [2022-04-27 15:10:26,777 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 116 transitions. Word has length 21 [2022-04-27 15:10:26,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:26,777 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 116 transitions. [2022-04-27 15:10:26,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,777 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 116 transitions. [2022-04-27 15:10:26,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 15:10:26,778 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:26,778 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] [2022-04-27 15:10:26,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 15:10:26,778 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:26,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:26,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1183723222, now seen corresponding path program 1 times [2022-04-27 15:10:26,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:26,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148876637] [2022-04-27 15:10:26,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:26,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:26,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:26,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:26,818 INFO L290 TraceCheckUtils]: 0: Hoare triple {1019#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1013#true} is VALID [2022-04-27 15:10:26,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {1013#true} assume true; {1013#true} is VALID [2022-04-27 15:10:26,819 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1013#true} {1013#true} #183#return; {1013#true} is VALID [2022-04-27 15:10:26,819 INFO L272 TraceCheckUtils]: 0: Hoare triple {1013#true} call ULTIMATE.init(); {1019#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:26,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {1019#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1013#true} is VALID [2022-04-27 15:10:26,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {1013#true} assume true; {1013#true} is VALID [2022-04-27 15:10:26,820 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1013#true} {1013#true} #183#return; {1013#true} is VALID [2022-04-27 15:10:26,820 INFO L272 TraceCheckUtils]: 4: Hoare triple {1013#true} call #t~ret14 := main(); {1013#true} is VALID [2022-04-27 15:10:26,820 INFO L290 TraceCheckUtils]: 5: Hoare triple {1013#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;havoc ~cond~0; {1013#true} is VALID [2022-04-27 15:10:26,820 INFO L290 TraceCheckUtils]: 6: Hoare triple {1013#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {1013#true} is VALID [2022-04-27 15:10:26,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {1013#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; {1013#true} is VALID [2022-04-27 15:10:26,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {1013#true} assume !(0 != ~p1~0); {1013#true} is VALID [2022-04-27 15:10:26,821 INFO L290 TraceCheckUtils]: 9: Hoare triple {1013#true} assume !(0 != ~p2~0); {1018#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:26,821 INFO L290 TraceCheckUtils]: 10: Hoare triple {1018#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1018#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:26,821 INFO L290 TraceCheckUtils]: 11: Hoare triple {1018#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1018#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:26,821 INFO L290 TraceCheckUtils]: 12: Hoare triple {1018#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1018#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:26,822 INFO L290 TraceCheckUtils]: 13: Hoare triple {1018#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1018#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:26,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {1018#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {1018#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:26,822 INFO L290 TraceCheckUtils]: 15: Hoare triple {1018#(= main_~p2~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {1018#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:26,823 INFO L290 TraceCheckUtils]: 16: Hoare triple {1018#(= main_~p2~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {1018#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:26,823 INFO L290 TraceCheckUtils]: 17: Hoare triple {1018#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1018#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:26,823 INFO L290 TraceCheckUtils]: 18: Hoare triple {1018#(= main_~p2~0 0)} assume 0 != ~p2~0; {1014#false} is VALID [2022-04-27 15:10:26,823 INFO L290 TraceCheckUtils]: 19: Hoare triple {1014#false} assume 1 != ~lk2~0; {1014#false} is VALID [2022-04-27 15:10:26,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {1014#false} assume !false; {1014#false} is VALID [2022-04-27 15:10:26,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:26,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:26,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148876637] [2022-04-27 15:10:26,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148876637] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:26,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:26,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:26,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792909862] [2022-04-27 15:10:26,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:26,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 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 21 [2022-04-27 15:10:26,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:26,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:26,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:26,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:26,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:26,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:26,837 INFO L87 Difference]: Start difference. First operand 68 states and 116 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:26,967 INFO L93 Difference]: Finished difference Result 184 states and 324 transitions. [2022-04-27 15:10:26,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:26,967 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 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 21 [2022-04-27 15:10:26,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:26,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2022-04-27 15:10:26,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2022-04-27 15:10:26,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 172 transitions. [2022-04-27 15:10:27,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:27,076 INFO L225 Difference]: With dead ends: 184 [2022-04-27 15:10:27,076 INFO L226 Difference]: Without dead ends: 125 [2022-04-27 15:10:27,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:27,085 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 146 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:27,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 73 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:27,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-04-27 15:10:27,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2022-04-27 15:10:27,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:27,097 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 123 states, 119 states have (on average 1.7647058823529411) internal successors, (210), 119 states have internal predecessors, (210), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,097 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 123 states, 119 states have (on average 1.7647058823529411) internal successors, (210), 119 states have internal predecessors, (210), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,097 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 123 states, 119 states have (on average 1.7647058823529411) internal successors, (210), 119 states have internal predecessors, (210), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:27,100 INFO L93 Difference]: Finished difference Result 125 states and 214 transitions. [2022-04-27 15:10:27,100 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 214 transitions. [2022-04-27 15:10:27,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:27,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:27,101 INFO L74 IsIncluded]: Start isIncluded. First operand has 123 states, 119 states have (on average 1.7647058823529411) internal successors, (210), 119 states have internal predecessors, (210), 2 states have call successors, (2), 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 125 states. [2022-04-27 15:10:27,101 INFO L87 Difference]: Start difference. First operand has 123 states, 119 states have (on average 1.7647058823529411) internal successors, (210), 119 states have internal predecessors, (210), 2 states have call successors, (2), 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 125 states. [2022-04-27 15:10:27,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:27,104 INFO L93 Difference]: Finished difference Result 125 states and 214 transitions. [2022-04-27 15:10:27,105 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 214 transitions. [2022-04-27 15:10:27,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:27,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:27,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:27,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:27,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 119 states have (on average 1.7647058823529411) internal successors, (210), 119 states have internal predecessors, (210), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 213 transitions. [2022-04-27 15:10:27,108 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 213 transitions. Word has length 21 [2022-04-27 15:10:27,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:27,108 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 213 transitions. [2022-04-27 15:10:27,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,109 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 213 transitions. [2022-04-27 15:10:27,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 15:10:27,109 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:27,109 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] [2022-04-27 15:10:27,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 15:10:27,109 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:27,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:27,110 INFO L85 PathProgramCache]: Analyzing trace with hash 925557784, now seen corresponding path program 1 times [2022-04-27 15:10:27,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:27,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714349387] [2022-04-27 15:10:27,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:27,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:27,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:27,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:27,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {1612#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1606#true} is VALID [2022-04-27 15:10:27,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {1606#true} assume true; {1606#true} is VALID [2022-04-27 15:10:27,165 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1606#true} {1606#true} #183#return; {1606#true} is VALID [2022-04-27 15:10:27,166 INFO L272 TraceCheckUtils]: 0: Hoare triple {1606#true} call ULTIMATE.init(); {1612#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:27,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {1612#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1606#true} is VALID [2022-04-27 15:10:27,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {1606#true} assume true; {1606#true} is VALID [2022-04-27 15:10:27,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1606#true} {1606#true} #183#return; {1606#true} is VALID [2022-04-27 15:10:27,167 INFO L272 TraceCheckUtils]: 4: Hoare triple {1606#true} call #t~ret14 := main(); {1606#true} is VALID [2022-04-27 15:10:27,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {1606#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;havoc ~cond~0; {1606#true} is VALID [2022-04-27 15:10:27,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {1606#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {1606#true} is VALID [2022-04-27 15:10:27,169 INFO L290 TraceCheckUtils]: 7: Hoare triple {1606#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; {1606#true} is VALID [2022-04-27 15:10:27,169 INFO L290 TraceCheckUtils]: 8: Hoare triple {1606#true} assume !(0 != ~p1~0); {1606#true} is VALID [2022-04-27 15:10:27,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {1606#true} assume 0 != ~p2~0;~lk2~0 := 1; {1611#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:27,170 INFO L290 TraceCheckUtils]: 10: Hoare triple {1611#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {1611#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:27,170 INFO L290 TraceCheckUtils]: 11: Hoare triple {1611#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {1611#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:27,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {1611#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {1611#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:27,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {1611#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {1611#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:27,171 INFO L290 TraceCheckUtils]: 14: Hoare triple {1611#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {1611#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:27,173 INFO L290 TraceCheckUtils]: 15: Hoare triple {1611#(= main_~lk2~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {1611#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:27,173 INFO L290 TraceCheckUtils]: 16: Hoare triple {1611#(= main_~lk2~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {1611#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:27,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {1611#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {1611#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:27,173 INFO L290 TraceCheckUtils]: 18: Hoare triple {1611#(= main_~lk2~0 1)} assume 0 != ~p2~0; {1611#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:27,174 INFO L290 TraceCheckUtils]: 19: Hoare triple {1611#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {1607#false} is VALID [2022-04-27 15:10:27,174 INFO L290 TraceCheckUtils]: 20: Hoare triple {1607#false} assume !false; {1607#false} is VALID [2022-04-27 15:10:27,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:27,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:27,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714349387] [2022-04-27 15:10:27,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714349387] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:27,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:27,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:27,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874708383] [2022-04-27 15:10:27,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:27,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 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 21 [2022-04-27 15:10:27,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:27,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:27,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:27,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:27,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:27,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:27,187 INFO L87 Difference]: Start difference. First operand 123 states and 213 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:27,343 INFO L93 Difference]: Finished difference Result 159 states and 275 transitions. [2022-04-27 15:10:27,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:27,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 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 21 [2022-04-27 15:10:27,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:27,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2022-04-27 15:10:27,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2022-04-27 15:10:27,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 112 transitions. [2022-04-27 15:10:27,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:27,416 INFO L225 Difference]: With dead ends: 159 [2022-04-27 15:10:27,416 INFO L226 Difference]: Without dead ends: 157 [2022-04-27 15:10:27,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:27,417 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 95 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:27,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 116 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:27,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-04-27 15:10:27,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 123. [2022-04-27 15:10:27,421 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:27,422 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand has 123 states, 119 states have (on average 1.7478991596638656) internal successors, (208), 119 states have internal predecessors, (208), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,422 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand has 123 states, 119 states have (on average 1.7478991596638656) internal successors, (208), 119 states have internal predecessors, (208), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,422 INFO L87 Difference]: Start difference. First operand 157 states. Second operand has 123 states, 119 states have (on average 1.7478991596638656) internal successors, (208), 119 states have internal predecessors, (208), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:27,428 INFO L93 Difference]: Finished difference Result 157 states and 272 transitions. [2022-04-27 15:10:27,428 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 272 transitions. [2022-04-27 15:10:27,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:27,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:27,429 INFO L74 IsIncluded]: Start isIncluded. First operand has 123 states, 119 states have (on average 1.7478991596638656) internal successors, (208), 119 states have internal predecessors, (208), 2 states have call successors, (2), 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 157 states. [2022-04-27 15:10:27,429 INFO L87 Difference]: Start difference. First operand has 123 states, 119 states have (on average 1.7478991596638656) internal successors, (208), 119 states have internal predecessors, (208), 2 states have call successors, (2), 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 157 states. [2022-04-27 15:10:27,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:27,433 INFO L93 Difference]: Finished difference Result 157 states and 272 transitions. [2022-04-27 15:10:27,433 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 272 transitions. [2022-04-27 15:10:27,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:27,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:27,435 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:27,435 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:27,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 119 states have (on average 1.7478991596638656) internal successors, (208), 119 states have internal predecessors, (208), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 211 transitions. [2022-04-27 15:10:27,439 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 211 transitions. Word has length 21 [2022-04-27 15:10:27,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:27,439 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 211 transitions. [2022-04-27 15:10:27,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,439 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 211 transitions. [2022-04-27 15:10:27,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 15:10:27,439 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:27,439 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] [2022-04-27 15:10:27,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 15:10:27,440 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:27,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:27,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1959071734, now seen corresponding path program 1 times [2022-04-27 15:10:27,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:27,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700512416] [2022-04-27 15:10:27,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:27,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:27,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:27,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:27,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:27,496 INFO L290 TraceCheckUtils]: 0: Hoare triple {2244#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2238#true} is VALID [2022-04-27 15:10:27,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {2238#true} assume true; {2238#true} is VALID [2022-04-27 15:10:27,497 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2238#true} {2238#true} #183#return; {2238#true} is VALID [2022-04-27 15:10:27,497 INFO L272 TraceCheckUtils]: 0: Hoare triple {2238#true} call ULTIMATE.init(); {2244#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:27,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {2244#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2238#true} is VALID [2022-04-27 15:10:27,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {2238#true} assume true; {2238#true} is VALID [2022-04-27 15:10:27,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2238#true} {2238#true} #183#return; {2238#true} is VALID [2022-04-27 15:10:27,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {2238#true} call #t~ret14 := main(); {2238#true} is VALID [2022-04-27 15:10:27,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {2238#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;havoc ~cond~0; {2238#true} is VALID [2022-04-27 15:10:27,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {2238#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {2238#true} is VALID [2022-04-27 15:10:27,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {2238#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; {2238#true} is VALID [2022-04-27 15:10:27,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {2238#true} assume !(0 != ~p1~0); {2238#true} is VALID [2022-04-27 15:10:27,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {2238#true} assume !(0 != ~p2~0); {2238#true} is VALID [2022-04-27 15:10:27,498 INFO L290 TraceCheckUtils]: 10: Hoare triple {2238#true} assume 0 != ~p3~0;~lk3~0 := 1; {2243#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:27,498 INFO L290 TraceCheckUtils]: 11: Hoare triple {2243#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2243#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:27,499 INFO L290 TraceCheckUtils]: 12: Hoare triple {2243#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2243#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:27,499 INFO L290 TraceCheckUtils]: 13: Hoare triple {2243#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {2243#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:27,499 INFO L290 TraceCheckUtils]: 14: Hoare triple {2243#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {2243#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:27,499 INFO L290 TraceCheckUtils]: 15: Hoare triple {2243#(= main_~lk3~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {2243#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:27,500 INFO L290 TraceCheckUtils]: 16: Hoare triple {2243#(= main_~lk3~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {2243#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:27,500 INFO L290 TraceCheckUtils]: 17: Hoare triple {2243#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {2243#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:27,500 INFO L290 TraceCheckUtils]: 18: Hoare triple {2243#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {2243#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:27,500 INFO L290 TraceCheckUtils]: 19: Hoare triple {2243#(= main_~lk3~0 1)} assume 0 != ~p3~0; {2243#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:27,501 INFO L290 TraceCheckUtils]: 20: Hoare triple {2243#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {2239#false} is VALID [2022-04-27 15:10:27,501 INFO L290 TraceCheckUtils]: 21: Hoare triple {2239#false} assume !false; {2239#false} is VALID [2022-04-27 15:10:27,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:27,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:27,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700512416] [2022-04-27 15:10:27,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700512416] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:27,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:27,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:27,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995690510] [2022-04-27 15:10:27,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:27,502 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 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 22 [2022-04-27 15:10:27,502 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:27,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:27,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:27,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:27,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:27,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:27,514 INFO L87 Difference]: Start difference. First operand 123 states and 211 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:27,662 INFO L93 Difference]: Finished difference Result 227 states and 395 transitions. [2022-04-27 15:10:27,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:27,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 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 22 [2022-04-27 15:10:27,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:27,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-27 15:10:27,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-27 15:10:27,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 111 transitions. [2022-04-27 15:10:27,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:27,742 INFO L225 Difference]: With dead ends: 227 [2022-04-27 15:10:27,742 INFO L226 Difference]: Without dead ends: 225 [2022-04-27 15:10:27,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:27,743 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 137 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:27,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 70 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:27,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-04-27 15:10:27,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 167. [2022-04-27 15:10:27,748 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:27,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 225 states. Second operand has 167 states, 163 states have (on average 1.7300613496932515) internal successors, (282), 163 states have internal predecessors, (282), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,749 INFO L74 IsIncluded]: Start isIncluded. First operand 225 states. Second operand has 167 states, 163 states have (on average 1.7300613496932515) internal successors, (282), 163 states have internal predecessors, (282), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,749 INFO L87 Difference]: Start difference. First operand 225 states. Second operand has 167 states, 163 states have (on average 1.7300613496932515) internal successors, (282), 163 states have internal predecessors, (282), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:27,754 INFO L93 Difference]: Finished difference Result 225 states and 390 transitions. [2022-04-27 15:10:27,754 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 390 transitions. [2022-04-27 15:10:27,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:27,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:27,755 INFO L74 IsIncluded]: Start isIncluded. First operand has 167 states, 163 states have (on average 1.7300613496932515) internal successors, (282), 163 states have internal predecessors, (282), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 225 states. [2022-04-27 15:10:27,755 INFO L87 Difference]: Start difference. First operand has 167 states, 163 states have (on average 1.7300613496932515) internal successors, (282), 163 states have internal predecessors, (282), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 225 states. [2022-04-27 15:10:27,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:27,760 INFO L93 Difference]: Finished difference Result 225 states and 390 transitions. [2022-04-27 15:10:27,760 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 390 transitions. [2022-04-27 15:10:27,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:27,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:27,760 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:27,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:27,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 163 states have (on average 1.7300613496932515) internal successors, (282), 163 states have internal predecessors, (282), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 285 transitions. [2022-04-27 15:10:27,764 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 285 transitions. Word has length 22 [2022-04-27 15:10:27,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:27,764 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 285 transitions. [2022-04-27 15:10:27,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,764 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 285 transitions. [2022-04-27 15:10:27,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 15:10:27,764 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:27,765 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] [2022-04-27 15:10:27,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 15:10:27,765 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:27,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:27,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1700906296, now seen corresponding path program 1 times [2022-04-27 15:10:27,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:27,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668080988] [2022-04-27 15:10:27,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:27,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:27,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:27,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:27,822 INFO L290 TraceCheckUtils]: 0: Hoare triple {3126#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {3120#true} is VALID [2022-04-27 15:10:27,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {3120#true} assume true; {3120#true} is VALID [2022-04-27 15:10:27,822 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3120#true} {3120#true} #183#return; {3120#true} is VALID [2022-04-27 15:10:27,822 INFO L272 TraceCheckUtils]: 0: Hoare triple {3120#true} call ULTIMATE.init(); {3126#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:27,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {3126#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {3120#true} is VALID [2022-04-27 15:10:27,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {3120#true} assume true; {3120#true} is VALID [2022-04-27 15:10:27,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3120#true} {3120#true} #183#return; {3120#true} is VALID [2022-04-27 15:10:27,823 INFO L272 TraceCheckUtils]: 4: Hoare triple {3120#true} call #t~ret14 := main(); {3120#true} is VALID [2022-04-27 15:10:27,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {3120#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;havoc ~cond~0; {3120#true} is VALID [2022-04-27 15:10:27,823 INFO L290 TraceCheckUtils]: 6: Hoare triple {3120#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {3120#true} is VALID [2022-04-27 15:10:27,823 INFO L290 TraceCheckUtils]: 7: Hoare triple {3120#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; {3120#true} is VALID [2022-04-27 15:10:27,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {3120#true} assume !(0 != ~p1~0); {3120#true} is VALID [2022-04-27 15:10:27,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {3120#true} assume !(0 != ~p2~0); {3120#true} is VALID [2022-04-27 15:10:27,823 INFO L290 TraceCheckUtils]: 10: Hoare triple {3120#true} assume !(0 != ~p3~0); {3125#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:27,824 INFO L290 TraceCheckUtils]: 11: Hoare triple {3125#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {3125#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:27,824 INFO L290 TraceCheckUtils]: 12: Hoare triple {3125#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {3125#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:27,824 INFO L290 TraceCheckUtils]: 13: Hoare triple {3125#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {3125#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:27,824 INFO L290 TraceCheckUtils]: 14: Hoare triple {3125#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {3125#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:27,825 INFO L290 TraceCheckUtils]: 15: Hoare triple {3125#(= main_~p3~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {3125#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:27,825 INFO L290 TraceCheckUtils]: 16: Hoare triple {3125#(= main_~p3~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {3125#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:27,825 INFO L290 TraceCheckUtils]: 17: Hoare triple {3125#(= main_~p3~0 0)} assume !(0 != ~p1~0); {3125#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:27,825 INFO L290 TraceCheckUtils]: 18: Hoare triple {3125#(= main_~p3~0 0)} assume !(0 != ~p2~0); {3125#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:27,825 INFO L290 TraceCheckUtils]: 19: Hoare triple {3125#(= main_~p3~0 0)} assume 0 != ~p3~0; {3121#false} is VALID [2022-04-27 15:10:27,826 INFO L290 TraceCheckUtils]: 20: Hoare triple {3121#false} assume 1 != ~lk3~0; {3121#false} is VALID [2022-04-27 15:10:27,826 INFO L290 TraceCheckUtils]: 21: Hoare triple {3121#false} assume !false; {3121#false} is VALID [2022-04-27 15:10:27,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:27,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:27,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668080988] [2022-04-27 15:10:27,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668080988] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:27,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:27,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:27,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501405794] [2022-04-27 15:10:27,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:27,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 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 22 [2022-04-27 15:10:27,828 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:27,828 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:27,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:27,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:27,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:27,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:27,839 INFO L87 Difference]: Start difference. First operand 167 states and 285 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:27,959 INFO L93 Difference]: Finished difference Result 391 states and 675 transitions. [2022-04-27 15:10:27,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:27,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 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 22 [2022-04-27 15:10:27,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:27,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2022-04-27 15:10:27,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2022-04-27 15:10:27,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 168 transitions. [2022-04-27 15:10:28,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:28,061 INFO L225 Difference]: With dead ends: 391 [2022-04-27 15:10:28,061 INFO L226 Difference]: Without dead ends: 233 [2022-04-27 15:10:28,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:28,062 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 121 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:28,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 91 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:28,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-04-27 15:10:28,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2022-04-27 15:10:28,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:28,069 INFO L82 GeneralOperation]: Start isEquivalent. First operand 233 states. Second operand has 231 states, 227 states have (on average 1.7092511013215859) internal successors, (388), 227 states have internal predecessors, (388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,069 INFO L74 IsIncluded]: Start isIncluded. First operand 233 states. Second operand has 231 states, 227 states have (on average 1.7092511013215859) internal successors, (388), 227 states have internal predecessors, (388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,069 INFO L87 Difference]: Start difference. First operand 233 states. Second operand has 231 states, 227 states have (on average 1.7092511013215859) internal successors, (388), 227 states have internal predecessors, (388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:28,074 INFO L93 Difference]: Finished difference Result 233 states and 392 transitions. [2022-04-27 15:10:28,074 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 392 transitions. [2022-04-27 15:10:28,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:28,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:28,079 INFO L74 IsIncluded]: Start isIncluded. First operand has 231 states, 227 states have (on average 1.7092511013215859) internal successors, (388), 227 states have internal predecessors, (388), 2 states have call successors, (2), 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 233 states. [2022-04-27 15:10:28,080 INFO L87 Difference]: Start difference. First operand has 231 states, 227 states have (on average 1.7092511013215859) internal successors, (388), 227 states have internal predecessors, (388), 2 states have call successors, (2), 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 233 states. [2022-04-27 15:10:28,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:28,084 INFO L93 Difference]: Finished difference Result 233 states and 392 transitions. [2022-04-27 15:10:28,084 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 392 transitions. [2022-04-27 15:10:28,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:28,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:28,085 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:28,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:28,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 227 states have (on average 1.7092511013215859) internal successors, (388), 227 states have internal predecessors, (388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 391 transitions. [2022-04-27 15:10:28,088 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 391 transitions. Word has length 22 [2022-04-27 15:10:28,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:28,088 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 391 transitions. [2022-04-27 15:10:28,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,089 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 391 transitions. [2022-04-27 15:10:28,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 15:10:28,089 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:28,089 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:28,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-27 15:10:28,089 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:28,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:28,090 INFO L85 PathProgramCache]: Analyzing trace with hash -601467221, now seen corresponding path program 1 times [2022-04-27 15:10:28,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:28,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758588483] [2022-04-27 15:10:28,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:28,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:28,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:28,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:28,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:28,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {4260#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {4254#true} is VALID [2022-04-27 15:10:28,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {4254#true} assume true; {4254#true} is VALID [2022-04-27 15:10:28,136 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4254#true} {4254#true} #183#return; {4254#true} is VALID [2022-04-27 15:10:28,136 INFO L272 TraceCheckUtils]: 0: Hoare triple {4254#true} call ULTIMATE.init(); {4260#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:28,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {4260#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {4254#true} is VALID [2022-04-27 15:10:28,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {4254#true} assume true; {4254#true} is VALID [2022-04-27 15:10:28,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4254#true} {4254#true} #183#return; {4254#true} is VALID [2022-04-27 15:10:28,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {4254#true} call #t~ret14 := main(); {4254#true} is VALID [2022-04-27 15:10:28,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {4254#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;havoc ~cond~0; {4254#true} is VALID [2022-04-27 15:10:28,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {4254#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {4254#true} is VALID [2022-04-27 15:10:28,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {4254#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; {4254#true} is VALID [2022-04-27 15:10:28,138 INFO L290 TraceCheckUtils]: 8: Hoare triple {4254#true} assume !(0 != ~p1~0); {4254#true} is VALID [2022-04-27 15:10:28,138 INFO L290 TraceCheckUtils]: 9: Hoare triple {4254#true} assume !(0 != ~p2~0); {4254#true} is VALID [2022-04-27 15:10:28,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {4254#true} assume 0 != ~p3~0;~lk3~0 := 1; {4259#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:28,141 INFO L290 TraceCheckUtils]: 11: Hoare triple {4259#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {4259#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:28,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {4259#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {4259#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:28,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {4259#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {4259#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:28,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {4259#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {4259#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:28,142 INFO L290 TraceCheckUtils]: 15: Hoare triple {4259#(not (= main_~p3~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {4259#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:28,142 INFO L290 TraceCheckUtils]: 16: Hoare triple {4259#(not (= main_~p3~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {4259#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:28,143 INFO L290 TraceCheckUtils]: 17: Hoare triple {4259#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {4259#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:28,143 INFO L290 TraceCheckUtils]: 18: Hoare triple {4259#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {4259#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:28,143 INFO L290 TraceCheckUtils]: 19: Hoare triple {4259#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {4255#false} is VALID [2022-04-27 15:10:28,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {4255#false} assume 0 != ~p4~0; {4255#false} is VALID [2022-04-27 15:10:28,143 INFO L290 TraceCheckUtils]: 21: Hoare triple {4255#false} assume 1 != ~lk4~0; {4255#false} is VALID [2022-04-27 15:10:28,144 INFO L290 TraceCheckUtils]: 22: Hoare triple {4255#false} assume !false; {4255#false} is VALID [2022-04-27 15:10:28,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:28,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:28,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758588483] [2022-04-27 15:10:28,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758588483] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:28,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:28,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:28,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765596143] [2022-04-27 15:10:28,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:28,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 15:10:28,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:28,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:28,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:28,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:28,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:28,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:28,157 INFO L87 Difference]: Start difference. First operand 231 states and 391 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:28,268 INFO L93 Difference]: Finished difference Result 349 states and 589 transitions. [2022-04-27 15:10:28,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:28,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 15:10:28,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:28,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-27 15:10:28,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-27 15:10:28,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 163 transitions. [2022-04-27 15:10:28,359 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:28,362 INFO L225 Difference]: With dead ends: 349 [2022-04-27 15:10:28,362 INFO L226 Difference]: Without dead ends: 239 [2022-04-27 15:10:28,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:28,363 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 116 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:28,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 97 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:28,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-04-27 15:10:28,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 237. [2022-04-27 15:10:28,368 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:28,368 INFO L82 GeneralOperation]: Start isEquivalent. First operand 239 states. Second operand has 237 states, 233 states have (on average 1.6824034334763949) internal successors, (392), 233 states have internal predecessors, (392), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,369 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand has 237 states, 233 states have (on average 1.6824034334763949) internal successors, (392), 233 states have internal predecessors, (392), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,369 INFO L87 Difference]: Start difference. First operand 239 states. Second operand has 237 states, 233 states have (on average 1.6824034334763949) internal successors, (392), 233 states have internal predecessors, (392), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:28,373 INFO L93 Difference]: Finished difference Result 239 states and 396 transitions. [2022-04-27 15:10:28,373 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 396 transitions. [2022-04-27 15:10:28,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:28,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:28,374 INFO L74 IsIncluded]: Start isIncluded. First operand has 237 states, 233 states have (on average 1.6824034334763949) internal successors, (392), 233 states have internal predecessors, (392), 2 states have call successors, (2), 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 239 states. [2022-04-27 15:10:28,374 INFO L87 Difference]: Start difference. First operand has 237 states, 233 states have (on average 1.6824034334763949) internal successors, (392), 233 states have internal predecessors, (392), 2 states have call successors, (2), 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 239 states. [2022-04-27 15:10:28,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:28,378 INFO L93 Difference]: Finished difference Result 239 states and 396 transitions. [2022-04-27 15:10:28,378 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 396 transitions. [2022-04-27 15:10:28,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:28,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:28,378 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:28,378 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:28,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 233 states have (on average 1.6824034334763949) internal successors, (392), 233 states have internal predecessors, (392), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 395 transitions. [2022-04-27 15:10:28,383 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 395 transitions. Word has length 23 [2022-04-27 15:10:28,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:28,383 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 395 transitions. [2022-04-27 15:10:28,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,383 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 395 transitions. [2022-04-27 15:10:28,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 15:10:28,383 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:28,383 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:28,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-27 15:10:28,384 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:28,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:28,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1188273235, now seen corresponding path program 1 times [2022-04-27 15:10:28,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:28,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953902952] [2022-04-27 15:10:28,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:28,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:28,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:28,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:28,423 INFO L290 TraceCheckUtils]: 0: Hoare triple {5370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {5364#true} is VALID [2022-04-27 15:10:28,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {5364#true} assume true; {5364#true} is VALID [2022-04-27 15:10:28,423 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5364#true} {5364#true} #183#return; {5364#true} is VALID [2022-04-27 15:10:28,424 INFO L272 TraceCheckUtils]: 0: Hoare triple {5364#true} call ULTIMATE.init(); {5370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:28,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {5370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {5364#true} is VALID [2022-04-27 15:10:28,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {5364#true} assume true; {5364#true} is VALID [2022-04-27 15:10:28,424 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5364#true} {5364#true} #183#return; {5364#true} is VALID [2022-04-27 15:10:28,424 INFO L272 TraceCheckUtils]: 4: Hoare triple {5364#true} call #t~ret14 := main(); {5364#true} is VALID [2022-04-27 15:10:28,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {5364#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;havoc ~cond~0; {5364#true} is VALID [2022-04-27 15:10:28,424 INFO L290 TraceCheckUtils]: 6: Hoare triple {5364#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {5364#true} is VALID [2022-04-27 15:10:28,424 INFO L290 TraceCheckUtils]: 7: Hoare triple {5364#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; {5364#true} is VALID [2022-04-27 15:10:28,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {5364#true} assume !(0 != ~p1~0); {5364#true} is VALID [2022-04-27 15:10:28,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {5364#true} assume !(0 != ~p2~0); {5364#true} is VALID [2022-04-27 15:10:28,425 INFO L290 TraceCheckUtils]: 10: Hoare triple {5364#true} assume !(0 != ~p3~0); {5364#true} is VALID [2022-04-27 15:10:28,425 INFO L290 TraceCheckUtils]: 11: Hoare triple {5364#true} assume 0 != ~p4~0;~lk4~0 := 1; {5369#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:28,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {5369#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {5369#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:28,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {5369#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {5369#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:28,426 INFO L290 TraceCheckUtils]: 14: Hoare triple {5369#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {5369#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:28,426 INFO L290 TraceCheckUtils]: 15: Hoare triple {5369#(= main_~lk4~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {5369#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:28,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {5369#(= main_~lk4~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {5369#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:28,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {5369#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {5369#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:28,427 INFO L290 TraceCheckUtils]: 18: Hoare triple {5369#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {5369#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:28,427 INFO L290 TraceCheckUtils]: 19: Hoare triple {5369#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {5369#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:28,427 INFO L290 TraceCheckUtils]: 20: Hoare triple {5369#(= main_~lk4~0 1)} assume 0 != ~p4~0; {5369#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:28,427 INFO L290 TraceCheckUtils]: 21: Hoare triple {5369#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {5365#false} is VALID [2022-04-27 15:10:28,427 INFO L290 TraceCheckUtils]: 22: Hoare triple {5365#false} assume !false; {5365#false} is VALID [2022-04-27 15:10:28,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:28,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:28,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953902952] [2022-04-27 15:10:28,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953902952] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:28,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:28,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:28,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819712703] [2022-04-27 15:10:28,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:28,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 15:10:28,428 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:28,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:28,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:28,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:28,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:28,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:28,441 INFO L87 Difference]: Start difference. First operand 237 states and 395 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:28,567 INFO L93 Difference]: Finished difference Result 429 states and 725 transitions. [2022-04-27 15:10:28,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:28,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 15:10:28,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:28,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2022-04-27 15:10:28,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2022-04-27 15:10:28,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 107 transitions. [2022-04-27 15:10:28,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:28,638 INFO L225 Difference]: With dead ends: 429 [2022-04-27 15:10:28,639 INFO L226 Difference]: Without dead ends: 427 [2022-04-27 15:10:28,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:28,639 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 130 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:28,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 69 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:28,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2022-04-27 15:10:28,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 329. [2022-04-27 15:10:28,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:28,646 INFO L82 GeneralOperation]: Start isEquivalent. First operand 427 states. Second operand has 329 states, 325 states have (on average 1.6492307692307693) internal successors, (536), 325 states have internal predecessors, (536), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,646 INFO L74 IsIncluded]: Start isIncluded. First operand 427 states. Second operand has 329 states, 325 states have (on average 1.6492307692307693) internal successors, (536), 325 states have internal predecessors, (536), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,646 INFO L87 Difference]: Start difference. First operand 427 states. Second operand has 329 states, 325 states have (on average 1.6492307692307693) internal successors, (536), 325 states have internal predecessors, (536), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:28,654 INFO L93 Difference]: Finished difference Result 427 states and 716 transitions. [2022-04-27 15:10:28,654 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 716 transitions. [2022-04-27 15:10:28,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:28,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:28,655 INFO L74 IsIncluded]: Start isIncluded. First operand has 329 states, 325 states have (on average 1.6492307692307693) internal successors, (536), 325 states have internal predecessors, (536), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 427 states. [2022-04-27 15:10:28,656 INFO L87 Difference]: Start difference. First operand has 329 states, 325 states have (on average 1.6492307692307693) internal successors, (536), 325 states have internal predecessors, (536), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 427 states. [2022-04-27 15:10:28,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:28,663 INFO L93 Difference]: Finished difference Result 427 states and 716 transitions. [2022-04-27 15:10:28,663 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 716 transitions. [2022-04-27 15:10:28,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:28,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:28,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:28,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:28,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 325 states have (on average 1.6492307692307693) internal successors, (536), 325 states have internal predecessors, (536), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 539 transitions. [2022-04-27 15:10:28,669 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 539 transitions. Word has length 23 [2022-04-27 15:10:28,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:28,670 INFO L495 AbstractCegarLoop]: Abstraction has 329 states and 539 transitions. [2022-04-27 15:10:28,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,670 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 539 transitions. [2022-04-27 15:10:28,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 15:10:28,670 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:28,670 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:28,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-27 15:10:28,670 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:28,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:28,671 INFO L85 PathProgramCache]: Analyzing trace with hash -930107797, now seen corresponding path program 1 times [2022-04-27 15:10:28,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:28,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372615720] [2022-04-27 15:10:28,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:28,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:28,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:28,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:28,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {7032#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {7026#true} is VALID [2022-04-27 15:10:28,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {7026#true} assume true; {7026#true} is VALID [2022-04-27 15:10:28,697 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7026#true} {7026#true} #183#return; {7026#true} is VALID [2022-04-27 15:10:28,697 INFO L272 TraceCheckUtils]: 0: Hoare triple {7026#true} call ULTIMATE.init(); {7032#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:28,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {7032#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {7026#true} is VALID [2022-04-27 15:10:28,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {7026#true} assume true; {7026#true} is VALID [2022-04-27 15:10:28,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7026#true} {7026#true} #183#return; {7026#true} is VALID [2022-04-27 15:10:28,698 INFO L272 TraceCheckUtils]: 4: Hoare triple {7026#true} call #t~ret14 := main(); {7026#true} is VALID [2022-04-27 15:10:28,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {7026#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;havoc ~cond~0; {7026#true} is VALID [2022-04-27 15:10:28,698 INFO L290 TraceCheckUtils]: 6: Hoare triple {7026#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {7026#true} is VALID [2022-04-27 15:10:28,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {7026#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; {7026#true} is VALID [2022-04-27 15:10:28,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {7026#true} assume !(0 != ~p1~0); {7026#true} is VALID [2022-04-27 15:10:28,698 INFO L290 TraceCheckUtils]: 9: Hoare triple {7026#true} assume !(0 != ~p2~0); {7026#true} is VALID [2022-04-27 15:10:28,698 INFO L290 TraceCheckUtils]: 10: Hoare triple {7026#true} assume !(0 != ~p3~0); {7026#true} is VALID [2022-04-27 15:10:28,698 INFO L290 TraceCheckUtils]: 11: Hoare triple {7026#true} assume !(0 != ~p4~0); {7031#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:28,699 INFO L290 TraceCheckUtils]: 12: Hoare triple {7031#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {7031#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:28,699 INFO L290 TraceCheckUtils]: 13: Hoare triple {7031#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {7031#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:28,699 INFO L290 TraceCheckUtils]: 14: Hoare triple {7031#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {7031#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:28,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {7031#(= main_~p4~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {7031#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:28,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {7031#(= main_~p4~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {7031#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:28,700 INFO L290 TraceCheckUtils]: 17: Hoare triple {7031#(= main_~p4~0 0)} assume !(0 != ~p1~0); {7031#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:28,700 INFO L290 TraceCheckUtils]: 18: Hoare triple {7031#(= main_~p4~0 0)} assume !(0 != ~p2~0); {7031#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:28,700 INFO L290 TraceCheckUtils]: 19: Hoare triple {7031#(= main_~p4~0 0)} assume !(0 != ~p3~0); {7031#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:28,700 INFO L290 TraceCheckUtils]: 20: Hoare triple {7031#(= main_~p4~0 0)} assume 0 != ~p4~0; {7027#false} is VALID [2022-04-27 15:10:28,700 INFO L290 TraceCheckUtils]: 21: Hoare triple {7027#false} assume 1 != ~lk4~0; {7027#false} is VALID [2022-04-27 15:10:28,701 INFO L290 TraceCheckUtils]: 22: Hoare triple {7027#false} assume !false; {7027#false} is VALID [2022-04-27 15:10:28,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:28,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:28,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372615720] [2022-04-27 15:10:28,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372615720] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:28,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:28,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:28,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057319108] [2022-04-27 15:10:28,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:28,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 15:10:28,701 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:28,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:28,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:28,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:28,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:28,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:28,713 INFO L87 Difference]: Start difference. First operand 329 states and 539 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:28,847 INFO L93 Difference]: Finished difference Result 765 states and 1261 transitions. [2022-04-27 15:10:28,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:28,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 15:10:28,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:28,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 165 transitions. [2022-04-27 15:10:28,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 165 transitions. [2022-04-27 15:10:28,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 165 transitions. [2022-04-27 15:10:28,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:28,947 INFO L225 Difference]: With dead ends: 765 [2022-04-27 15:10:28,947 INFO L226 Difference]: Without dead ends: 451 [2022-04-27 15:10:28,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:28,949 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 115 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:28,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 93 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:28,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-04-27 15:10:28,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 449. [2022-04-27 15:10:28,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:28,958 INFO L82 GeneralOperation]: Start isEquivalent. First operand 451 states. Second operand has 449 states, 445 states have (on average 1.6269662921348316) internal successors, (724), 445 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,958 INFO L74 IsIncluded]: Start isIncluded. First operand 451 states. Second operand has 449 states, 445 states have (on average 1.6269662921348316) internal successors, (724), 445 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,960 INFO L87 Difference]: Start difference. First operand 451 states. Second operand has 449 states, 445 states have (on average 1.6269662921348316) internal successors, (724), 445 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:28,968 INFO L93 Difference]: Finished difference Result 451 states and 728 transitions. [2022-04-27 15:10:28,968 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 728 transitions. [2022-04-27 15:10:28,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:28,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:28,970 INFO L74 IsIncluded]: Start isIncluded. First operand has 449 states, 445 states have (on average 1.6269662921348316) internal successors, (724), 445 states have internal predecessors, (724), 2 states have call successors, (2), 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 451 states. [2022-04-27 15:10:28,970 INFO L87 Difference]: Start difference. First operand has 449 states, 445 states have (on average 1.6269662921348316) internal successors, (724), 445 states have internal predecessors, (724), 2 states have call successors, (2), 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 451 states. [2022-04-27 15:10:28,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:28,978 INFO L93 Difference]: Finished difference Result 451 states and 728 transitions. [2022-04-27 15:10:28,978 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 728 transitions. [2022-04-27 15:10:28,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:28,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:28,979 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:28,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:28,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 445 states have (on average 1.6269662921348316) internal successors, (724), 445 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 727 transitions. [2022-04-27 15:10:28,988 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 727 transitions. Word has length 23 [2022-04-27 15:10:28,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:28,988 INFO L495 AbstractCegarLoop]: Abstraction has 449 states and 727 transitions. [2022-04-27 15:10:28,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,988 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 727 transitions. [2022-04-27 15:10:28,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 15:10:28,988 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:28,989 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:28,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-27 15:10:28,989 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:28,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:28,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1818450109, now seen corresponding path program 1 times [2022-04-27 15:10:28,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:28,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236983025] [2022-04-27 15:10:28,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:28,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:29,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:29,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:29,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {9214#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {9208#true} is VALID [2022-04-27 15:10:29,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {9208#true} assume true; {9208#true} is VALID [2022-04-27 15:10:29,036 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9208#true} {9208#true} #183#return; {9208#true} is VALID [2022-04-27 15:10:29,038 INFO L272 TraceCheckUtils]: 0: Hoare triple {9208#true} call ULTIMATE.init(); {9214#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:29,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {9214#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {9208#true} is VALID [2022-04-27 15:10:29,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {9208#true} assume true; {9208#true} is VALID [2022-04-27 15:10:29,038 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9208#true} {9208#true} #183#return; {9208#true} is VALID [2022-04-27 15:10:29,038 INFO L272 TraceCheckUtils]: 4: Hoare triple {9208#true} call #t~ret14 := main(); {9208#true} is VALID [2022-04-27 15:10:29,038 INFO L290 TraceCheckUtils]: 5: Hoare triple {9208#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;havoc ~cond~0; {9208#true} is VALID [2022-04-27 15:10:29,041 INFO L290 TraceCheckUtils]: 6: Hoare triple {9208#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {9208#true} is VALID [2022-04-27 15:10:29,041 INFO L290 TraceCheckUtils]: 7: Hoare triple {9208#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; {9208#true} is VALID [2022-04-27 15:10:29,041 INFO L290 TraceCheckUtils]: 8: Hoare triple {9208#true} assume !(0 != ~p1~0); {9208#true} is VALID [2022-04-27 15:10:29,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {9208#true} assume !(0 != ~p2~0); {9208#true} is VALID [2022-04-27 15:10:29,041 INFO L290 TraceCheckUtils]: 10: Hoare triple {9208#true} assume !(0 != ~p3~0); {9208#true} is VALID [2022-04-27 15:10:29,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {9208#true} assume 0 != ~p4~0;~lk4~0 := 1; {9213#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:29,042 INFO L290 TraceCheckUtils]: 12: Hoare triple {9213#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {9213#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:29,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {9213#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {9213#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:29,042 INFO L290 TraceCheckUtils]: 14: Hoare triple {9213#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {9213#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:29,043 INFO L290 TraceCheckUtils]: 15: Hoare triple {9213#(not (= main_~p4~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {9213#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:29,043 INFO L290 TraceCheckUtils]: 16: Hoare triple {9213#(not (= main_~p4~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {9213#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:29,043 INFO L290 TraceCheckUtils]: 17: Hoare triple {9213#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {9213#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:29,043 INFO L290 TraceCheckUtils]: 18: Hoare triple {9213#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {9213#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:29,044 INFO L290 TraceCheckUtils]: 19: Hoare triple {9213#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {9213#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:29,044 INFO L290 TraceCheckUtils]: 20: Hoare triple {9213#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {9209#false} is VALID [2022-04-27 15:10:29,044 INFO L290 TraceCheckUtils]: 21: Hoare triple {9209#false} assume 0 != ~p5~0; {9209#false} is VALID [2022-04-27 15:10:29,044 INFO L290 TraceCheckUtils]: 22: Hoare triple {9209#false} assume 1 != ~lk5~0; {9209#false} is VALID [2022-04-27 15:10:29,044 INFO L290 TraceCheckUtils]: 23: Hoare triple {9209#false} assume !false; {9209#false} is VALID [2022-04-27 15:10:29,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:29,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:29,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236983025] [2022-04-27 15:10:29,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236983025] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:29,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:29,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:29,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434262722] [2022-04-27 15:10:29,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:29,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-27 15:10:29,045 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:29,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:29,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:29,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:29,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:29,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:29,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:29,058 INFO L87 Difference]: Start difference. First operand 449 states and 727 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:29,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:29,205 INFO L93 Difference]: Finished difference Result 673 states and 1085 transitions. [2022-04-27 15:10:29,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:29,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-27 15:10:29,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:29,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:29,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2022-04-27 15:10:29,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:29,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2022-04-27 15:10:29,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 160 transitions. [2022-04-27 15:10:29,318 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-27 15:10:29,326 INFO L225 Difference]: With dead ends: 673 [2022-04-27 15:10:29,326 INFO L226 Difference]: Without dead ends: 459 [2022-04-27 15:10:29,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:29,327 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 115 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:29,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 94 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:29,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2022-04-27 15:10:29,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 457. [2022-04-27 15:10:29,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:29,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 459 states. Second operand has 457 states, 453 states have (on average 1.598233995584989) internal successors, (724), 453 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:29,335 INFO L74 IsIncluded]: Start isIncluded. First operand 459 states. Second operand has 457 states, 453 states have (on average 1.598233995584989) internal successors, (724), 453 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:29,336 INFO L87 Difference]: Start difference. First operand 459 states. Second operand has 457 states, 453 states have (on average 1.598233995584989) internal successors, (724), 453 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:29,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:29,344 INFO L93 Difference]: Finished difference Result 459 states and 728 transitions. [2022-04-27 15:10:29,344 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 728 transitions. [2022-04-27 15:10:29,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:29,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:29,345 INFO L74 IsIncluded]: Start isIncluded. First operand has 457 states, 453 states have (on average 1.598233995584989) internal successors, (724), 453 states have internal predecessors, (724), 2 states have call successors, (2), 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 459 states. [2022-04-27 15:10:29,345 INFO L87 Difference]: Start difference. First operand has 457 states, 453 states have (on average 1.598233995584989) internal successors, (724), 453 states have internal predecessors, (724), 2 states have call successors, (2), 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 459 states. [2022-04-27 15:10:29,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:29,354 INFO L93 Difference]: Finished difference Result 459 states and 728 transitions. [2022-04-27 15:10:29,354 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 728 transitions. [2022-04-27 15:10:29,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:29,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:29,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:29,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:29,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 453 states have (on average 1.598233995584989) internal successors, (724), 453 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:29,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 727 transitions. [2022-04-27 15:10:29,363 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 727 transitions. Word has length 24 [2022-04-27 15:10:29,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:29,363 INFO L495 AbstractCegarLoop]: Abstraction has 457 states and 727 transitions. [2022-04-27 15:10:29,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:29,363 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 727 transitions. [2022-04-27 15:10:29,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 15:10:29,364 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:29,364 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:29,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-27 15:10:29,364 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:29,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:29,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1231644095, now seen corresponding path program 1 times [2022-04-27 15:10:29,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:29,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941732027] [2022-04-27 15:10:29,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:29,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:29,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:29,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:29,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:29,421 INFO L290 TraceCheckUtils]: 0: Hoare triple {11328#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {11322#true} is VALID [2022-04-27 15:10:29,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {11322#true} assume true; {11322#true} is VALID [2022-04-27 15:10:29,421 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11322#true} {11322#true} #183#return; {11322#true} is VALID [2022-04-27 15:10:29,422 INFO L272 TraceCheckUtils]: 0: Hoare triple {11322#true} call ULTIMATE.init(); {11328#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:29,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {11328#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {11322#true} is VALID [2022-04-27 15:10:29,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {11322#true} assume true; {11322#true} is VALID [2022-04-27 15:10:29,423 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11322#true} {11322#true} #183#return; {11322#true} is VALID [2022-04-27 15:10:29,423 INFO L272 TraceCheckUtils]: 4: Hoare triple {11322#true} call #t~ret14 := main(); {11322#true} is VALID [2022-04-27 15:10:29,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {11322#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;havoc ~cond~0; {11322#true} is VALID [2022-04-27 15:10:29,423 INFO L290 TraceCheckUtils]: 6: Hoare triple {11322#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {11322#true} is VALID [2022-04-27 15:10:29,423 INFO L290 TraceCheckUtils]: 7: Hoare triple {11322#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; {11322#true} is VALID [2022-04-27 15:10:29,423 INFO L290 TraceCheckUtils]: 8: Hoare triple {11322#true} assume !(0 != ~p1~0); {11322#true} is VALID [2022-04-27 15:10:29,423 INFO L290 TraceCheckUtils]: 9: Hoare triple {11322#true} assume !(0 != ~p2~0); {11322#true} is VALID [2022-04-27 15:10:29,423 INFO L290 TraceCheckUtils]: 10: Hoare triple {11322#true} assume !(0 != ~p3~0); {11322#true} is VALID [2022-04-27 15:10:29,423 INFO L290 TraceCheckUtils]: 11: Hoare triple {11322#true} assume !(0 != ~p4~0); {11322#true} is VALID [2022-04-27 15:10:29,424 INFO L290 TraceCheckUtils]: 12: Hoare triple {11322#true} assume 0 != ~p5~0;~lk5~0 := 1; {11327#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:29,424 INFO L290 TraceCheckUtils]: 13: Hoare triple {11327#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {11327#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:29,424 INFO L290 TraceCheckUtils]: 14: Hoare triple {11327#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {11327#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:29,424 INFO L290 TraceCheckUtils]: 15: Hoare triple {11327#(= main_~lk5~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {11327#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:29,424 INFO L290 TraceCheckUtils]: 16: Hoare triple {11327#(= main_~lk5~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {11327#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:29,425 INFO L290 TraceCheckUtils]: 17: Hoare triple {11327#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {11327#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:29,425 INFO L290 TraceCheckUtils]: 18: Hoare triple {11327#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {11327#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:29,425 INFO L290 TraceCheckUtils]: 19: Hoare triple {11327#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {11327#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:29,425 INFO L290 TraceCheckUtils]: 20: Hoare triple {11327#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {11327#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:29,426 INFO L290 TraceCheckUtils]: 21: Hoare triple {11327#(= main_~lk5~0 1)} assume 0 != ~p5~0; {11327#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:29,426 INFO L290 TraceCheckUtils]: 22: Hoare triple {11327#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {11323#false} is VALID [2022-04-27 15:10:29,426 INFO L290 TraceCheckUtils]: 23: Hoare triple {11323#false} assume !false; {11323#false} is VALID [2022-04-27 15:10:29,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:29,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:29,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941732027] [2022-04-27 15:10:29,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941732027] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:29,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:29,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:29,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309733457] [2022-04-27 15:10:29,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:29,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-27 15:10:29,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:29,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:29,439 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:29,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:29,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:29,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:29,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:29,441 INFO L87 Difference]: Start difference. First operand 457 states and 727 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:29,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:29,569 INFO L93 Difference]: Finished difference Result 813 states and 1313 transitions. [2022-04-27 15:10:29,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:29,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-27 15:10:29,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:29,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:29,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-27 15:10:29,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:29,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-27 15:10:29,571 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 103 transitions. [2022-04-27 15:10:29,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:29,649 INFO L225 Difference]: With dead ends: 813 [2022-04-27 15:10:29,649 INFO L226 Difference]: Without dead ends: 811 [2022-04-27 15:10:29,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:29,650 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 123 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:29,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 68 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:29,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2022-04-27 15:10:29,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 649. [2022-04-27 15:10:29,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:29,660 INFO L82 GeneralOperation]: Start isEquivalent. First operand 811 states. Second operand has 649 states, 645 states have (on average 1.5565891472868216) internal successors, (1004), 645 states have internal predecessors, (1004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:29,660 INFO L74 IsIncluded]: Start isIncluded. First operand 811 states. Second operand has 649 states, 645 states have (on average 1.5565891472868216) internal successors, (1004), 645 states have internal predecessors, (1004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:29,661 INFO L87 Difference]: Start difference. First operand 811 states. Second operand has 649 states, 645 states have (on average 1.5565891472868216) internal successors, (1004), 645 states have internal predecessors, (1004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:29,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:29,681 INFO L93 Difference]: Finished difference Result 811 states and 1296 transitions. [2022-04-27 15:10:29,682 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1296 transitions. [2022-04-27 15:10:29,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:29,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:29,683 INFO L74 IsIncluded]: Start isIncluded. First operand has 649 states, 645 states have (on average 1.5565891472868216) internal successors, (1004), 645 states have internal predecessors, (1004), 2 states have call successors, (2), 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 811 states. [2022-04-27 15:10:29,684 INFO L87 Difference]: Start difference. First operand has 649 states, 645 states have (on average 1.5565891472868216) internal successors, (1004), 645 states have internal predecessors, (1004), 2 states have call successors, (2), 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 811 states. [2022-04-27 15:10:29,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:29,705 INFO L93 Difference]: Finished difference Result 811 states and 1296 transitions. [2022-04-27 15:10:29,705 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1296 transitions. [2022-04-27 15:10:29,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:29,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:29,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:29,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:29,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 645 states have (on average 1.5565891472868216) internal successors, (1004), 645 states have internal predecessors, (1004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:29,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1007 transitions. [2022-04-27 15:10:29,720 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1007 transitions. Word has length 24 [2022-04-27 15:10:29,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:29,721 INFO L495 AbstractCegarLoop]: Abstraction has 649 states and 1007 transitions. [2022-04-27 15:10:29,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:29,721 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1007 transitions. [2022-04-27 15:10:29,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 15:10:29,721 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:29,721 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:29,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-27 15:10:29,722 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:29,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:29,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1489809533, now seen corresponding path program 1 times [2022-04-27 15:10:29,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:29,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734182641] [2022-04-27 15:10:29,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:29,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:29,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:29,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:29,751 INFO L290 TraceCheckUtils]: 0: Hoare triple {14486#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {14480#true} is VALID [2022-04-27 15:10:29,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {14480#true} assume true; {14480#true} is VALID [2022-04-27 15:10:29,751 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14480#true} {14480#true} #183#return; {14480#true} is VALID [2022-04-27 15:10:29,752 INFO L272 TraceCheckUtils]: 0: Hoare triple {14480#true} call ULTIMATE.init(); {14486#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:29,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {14486#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {14480#true} is VALID [2022-04-27 15:10:29,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {14480#true} assume true; {14480#true} is VALID [2022-04-27 15:10:29,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14480#true} {14480#true} #183#return; {14480#true} is VALID [2022-04-27 15:10:29,752 INFO L272 TraceCheckUtils]: 4: Hoare triple {14480#true} call #t~ret14 := main(); {14480#true} is VALID [2022-04-27 15:10:29,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {14480#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;havoc ~cond~0; {14480#true} is VALID [2022-04-27 15:10:29,752 INFO L290 TraceCheckUtils]: 6: Hoare triple {14480#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {14480#true} is VALID [2022-04-27 15:10:29,752 INFO L290 TraceCheckUtils]: 7: Hoare triple {14480#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; {14480#true} is VALID [2022-04-27 15:10:29,752 INFO L290 TraceCheckUtils]: 8: Hoare triple {14480#true} assume !(0 != ~p1~0); {14480#true} is VALID [2022-04-27 15:10:29,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {14480#true} assume !(0 != ~p2~0); {14480#true} is VALID [2022-04-27 15:10:29,752 INFO L290 TraceCheckUtils]: 10: Hoare triple {14480#true} assume !(0 != ~p3~0); {14480#true} is VALID [2022-04-27 15:10:29,753 INFO L290 TraceCheckUtils]: 11: Hoare triple {14480#true} assume !(0 != ~p4~0); {14480#true} is VALID [2022-04-27 15:10:29,753 INFO L290 TraceCheckUtils]: 12: Hoare triple {14480#true} assume !(0 != ~p5~0); {14485#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:29,753 INFO L290 TraceCheckUtils]: 13: Hoare triple {14485#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {14485#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:29,753 INFO L290 TraceCheckUtils]: 14: Hoare triple {14485#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {14485#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:29,754 INFO L290 TraceCheckUtils]: 15: Hoare triple {14485#(= main_~p5~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {14485#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:29,754 INFO L290 TraceCheckUtils]: 16: Hoare triple {14485#(= main_~p5~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {14485#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:29,754 INFO L290 TraceCheckUtils]: 17: Hoare triple {14485#(= main_~p5~0 0)} assume !(0 != ~p1~0); {14485#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:29,754 INFO L290 TraceCheckUtils]: 18: Hoare triple {14485#(= main_~p5~0 0)} assume !(0 != ~p2~0); {14485#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:29,755 INFO L290 TraceCheckUtils]: 19: Hoare triple {14485#(= main_~p5~0 0)} assume !(0 != ~p3~0); {14485#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:29,755 INFO L290 TraceCheckUtils]: 20: Hoare triple {14485#(= main_~p5~0 0)} assume !(0 != ~p4~0); {14485#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:29,755 INFO L290 TraceCheckUtils]: 21: Hoare triple {14485#(= main_~p5~0 0)} assume 0 != ~p5~0; {14481#false} is VALID [2022-04-27 15:10:29,755 INFO L290 TraceCheckUtils]: 22: Hoare triple {14481#false} assume 1 != ~lk5~0; {14481#false} is VALID [2022-04-27 15:10:29,755 INFO L290 TraceCheckUtils]: 23: Hoare triple {14481#false} assume !false; {14481#false} is VALID [2022-04-27 15:10:29,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:29,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:29,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734182641] [2022-04-27 15:10:29,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734182641] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:29,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:29,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:29,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883564514] [2022-04-27 15:10:29,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:29,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-27 15:10:29,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:29,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:29,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:29,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:29,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:29,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:29,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:29,768 INFO L87 Difference]: Start difference. First operand 649 states and 1007 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:29,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:29,936 INFO L93 Difference]: Finished difference Result 1501 states and 2337 transitions. [2022-04-27 15:10:29,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:29,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-27 15:10:29,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:29,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:29,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 162 transitions. [2022-04-27 15:10:29,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:29,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 162 transitions. [2022-04-27 15:10:29,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 162 transitions. [2022-04-27 15:10:30,024 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-27 15:10:30,048 INFO L225 Difference]: With dead ends: 1501 [2022-04-27 15:10:30,048 INFO L226 Difference]: Without dead ends: 875 [2022-04-27 15:10:30,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:30,050 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 109 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:30,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 95 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:30,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2022-04-27 15:10:30,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 873. [2022-04-27 15:10:30,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:30,064 INFO L82 GeneralOperation]: Start isEquivalent. First operand 875 states. Second operand has 873 states, 869 states have (on average 1.532796317606444) internal successors, (1332), 869 states have internal predecessors, (1332), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:30,065 INFO L74 IsIncluded]: Start isIncluded. First operand 875 states. Second operand has 873 states, 869 states have (on average 1.532796317606444) internal successors, (1332), 869 states have internal predecessors, (1332), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:30,066 INFO L87 Difference]: Start difference. First operand 875 states. Second operand has 873 states, 869 states have (on average 1.532796317606444) internal successors, (1332), 869 states have internal predecessors, (1332), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:30,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:30,090 INFO L93 Difference]: Finished difference Result 875 states and 1336 transitions. [2022-04-27 15:10:30,090 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1336 transitions. [2022-04-27 15:10:30,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:30,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:30,092 INFO L74 IsIncluded]: Start isIncluded. First operand has 873 states, 869 states have (on average 1.532796317606444) internal successors, (1332), 869 states have internal predecessors, (1332), 2 states have call successors, (2), 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 875 states. [2022-04-27 15:10:30,093 INFO L87 Difference]: Start difference. First operand has 873 states, 869 states have (on average 1.532796317606444) internal successors, (1332), 869 states have internal predecessors, (1332), 2 states have call successors, (2), 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 875 states. [2022-04-27 15:10:30,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:30,116 INFO L93 Difference]: Finished difference Result 875 states and 1336 transitions. [2022-04-27 15:10:30,117 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1336 transitions. [2022-04-27 15:10:30,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:30,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:30,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:30,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:30,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 869 states have (on average 1.532796317606444) internal successors, (1332), 869 states have internal predecessors, (1332), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:30,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1335 transitions. [2022-04-27 15:10:30,142 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1335 transitions. Word has length 24 [2022-04-27 15:10:30,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:30,142 INFO L495 AbstractCegarLoop]: Abstraction has 873 states and 1335 transitions. [2022-04-27 15:10:30,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:30,143 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1335 transitions. [2022-04-27 15:10:30,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 15:10:30,143 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:30,143 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:30,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-27 15:10:30,144 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:30,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:30,144 INFO L85 PathProgramCache]: Analyzing trace with hash -473523648, now seen corresponding path program 1 times [2022-04-27 15:10:30,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:30,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441225162] [2022-04-27 15:10:30,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:30,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:30,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:30,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {18716#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {18710#true} is VALID [2022-04-27 15:10:30,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {18710#true} assume true; {18710#true} is VALID [2022-04-27 15:10:30,169 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18710#true} {18710#true} #183#return; {18710#true} is VALID [2022-04-27 15:10:30,170 INFO L272 TraceCheckUtils]: 0: Hoare triple {18710#true} call ULTIMATE.init(); {18716#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:30,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {18716#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {18710#true} is VALID [2022-04-27 15:10:30,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {18710#true} assume true; {18710#true} is VALID [2022-04-27 15:10:30,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18710#true} {18710#true} #183#return; {18710#true} is VALID [2022-04-27 15:10:30,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {18710#true} call #t~ret14 := main(); {18710#true} is VALID [2022-04-27 15:10:30,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {18710#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;havoc ~cond~0; {18710#true} is VALID [2022-04-27 15:10:30,170 INFO L290 TraceCheckUtils]: 6: Hoare triple {18710#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {18710#true} is VALID [2022-04-27 15:10:30,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {18710#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; {18710#true} is VALID [2022-04-27 15:10:30,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {18710#true} assume !(0 != ~p1~0); {18710#true} is VALID [2022-04-27 15:10:30,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {18710#true} assume !(0 != ~p2~0); {18710#true} is VALID [2022-04-27 15:10:30,170 INFO L290 TraceCheckUtils]: 10: Hoare triple {18710#true} assume !(0 != ~p3~0); {18710#true} is VALID [2022-04-27 15:10:30,170 INFO L290 TraceCheckUtils]: 11: Hoare triple {18710#true} assume !(0 != ~p4~0); {18710#true} is VALID [2022-04-27 15:10:30,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {18710#true} assume 0 != ~p5~0;~lk5~0 := 1; {18715#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:10:30,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {18715#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {18715#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:10:30,171 INFO L290 TraceCheckUtils]: 14: Hoare triple {18715#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {18715#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:10:30,171 INFO L290 TraceCheckUtils]: 15: Hoare triple {18715#(not (= main_~p5~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {18715#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:10:30,172 INFO L290 TraceCheckUtils]: 16: Hoare triple {18715#(not (= main_~p5~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {18715#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:10:30,172 INFO L290 TraceCheckUtils]: 17: Hoare triple {18715#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {18715#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:10:30,172 INFO L290 TraceCheckUtils]: 18: Hoare triple {18715#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {18715#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:10:30,172 INFO L290 TraceCheckUtils]: 19: Hoare triple {18715#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {18715#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:10:30,173 INFO L290 TraceCheckUtils]: 20: Hoare triple {18715#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {18715#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:10:30,173 INFO L290 TraceCheckUtils]: 21: Hoare triple {18715#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {18711#false} is VALID [2022-04-27 15:10:30,173 INFO L290 TraceCheckUtils]: 22: Hoare triple {18711#false} assume 0 != ~p6~0; {18711#false} is VALID [2022-04-27 15:10:30,173 INFO L290 TraceCheckUtils]: 23: Hoare triple {18711#false} assume 1 != ~lk6~0; {18711#false} is VALID [2022-04-27 15:10:30,173 INFO L290 TraceCheckUtils]: 24: Hoare triple {18711#false} assume !false; {18711#false} is VALID [2022-04-27 15:10:30,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:30,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:30,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441225162] [2022-04-27 15:10:30,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441225162] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:30,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:30,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:30,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251393980] [2022-04-27 15:10:30,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:30,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 15:10:30,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:30,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:30,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:30,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:30,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:30,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:30,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:30,186 INFO L87 Difference]: Start difference. First operand 873 states and 1335 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:30,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:30,351 INFO L93 Difference]: Finished difference Result 1309 states and 1993 transitions. [2022-04-27 15:10:30,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:30,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 15:10:30,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:30,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:30,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 157 transitions. [2022-04-27 15:10:30,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:30,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 157 transitions. [2022-04-27 15:10:30,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 157 transitions. [2022-04-27 15:10:30,439 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:30,464 INFO L225 Difference]: With dead ends: 1309 [2022-04-27 15:10:30,464 INFO L226 Difference]: Without dead ends: 891 [2022-04-27 15:10:30,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:30,466 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 114 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:30,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 91 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:30,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2022-04-27 15:10:30,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 889. [2022-04-27 15:10:30,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:30,482 INFO L82 GeneralOperation]: Start isEquivalent. First operand 891 states. Second operand has 889 states, 885 states have (on average 1.505084745762712) internal successors, (1332), 885 states have internal predecessors, (1332), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:30,483 INFO L74 IsIncluded]: Start isIncluded. First operand 891 states. Second operand has 889 states, 885 states have (on average 1.505084745762712) internal successors, (1332), 885 states have internal predecessors, (1332), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:30,484 INFO L87 Difference]: Start difference. First operand 891 states. Second operand has 889 states, 885 states have (on average 1.505084745762712) internal successors, (1332), 885 states have internal predecessors, (1332), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:30,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:30,508 INFO L93 Difference]: Finished difference Result 891 states and 1336 transitions. [2022-04-27 15:10:30,508 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1336 transitions. [2022-04-27 15:10:30,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:30,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:30,511 INFO L74 IsIncluded]: Start isIncluded. First operand has 889 states, 885 states have (on average 1.505084745762712) internal successors, (1332), 885 states have internal predecessors, (1332), 2 states have call successors, (2), 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 891 states. [2022-04-27 15:10:30,511 INFO L87 Difference]: Start difference. First operand has 889 states, 885 states have (on average 1.505084745762712) internal successors, (1332), 885 states have internal predecessors, (1332), 2 states have call successors, (2), 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 891 states. [2022-04-27 15:10:30,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:30,536 INFO L93 Difference]: Finished difference Result 891 states and 1336 transitions. [2022-04-27 15:10:30,536 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1336 transitions. [2022-04-27 15:10:30,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:30,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:30,538 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:30,538 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:30,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 885 states have (on average 1.505084745762712) internal successors, (1332), 885 states have internal predecessors, (1332), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:30,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1335 transitions. [2022-04-27 15:10:30,566 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1335 transitions. Word has length 25 [2022-04-27 15:10:30,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:30,566 INFO L495 AbstractCegarLoop]: Abstraction has 889 states and 1335 transitions. [2022-04-27 15:10:30,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:30,566 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1335 transitions. [2022-04-27 15:10:30,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 15:10:30,567 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:30,567 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:30,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-27 15:10:30,567 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:30,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:30,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1060329662, now seen corresponding path program 1 times [2022-04-27 15:10:30,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:30,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946694154] [2022-04-27 15:10:30,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:30,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:30,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:30,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:30,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:30,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {22802#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {22796#true} is VALID [2022-04-27 15:10:30,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {22796#true} assume true; {22796#true} is VALID [2022-04-27 15:10:30,594 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22796#true} {22796#true} #183#return; {22796#true} is VALID [2022-04-27 15:10:30,594 INFO L272 TraceCheckUtils]: 0: Hoare triple {22796#true} call ULTIMATE.init(); {22802#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:30,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {22802#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {22796#true} is VALID [2022-04-27 15:10:30,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {22796#true} assume true; {22796#true} is VALID [2022-04-27 15:10:30,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22796#true} {22796#true} #183#return; {22796#true} is VALID [2022-04-27 15:10:30,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {22796#true} call #t~ret14 := main(); {22796#true} is VALID [2022-04-27 15:10:30,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {22796#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;havoc ~cond~0; {22796#true} is VALID [2022-04-27 15:10:30,594 INFO L290 TraceCheckUtils]: 6: Hoare triple {22796#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {22796#true} is VALID [2022-04-27 15:10:30,594 INFO L290 TraceCheckUtils]: 7: Hoare triple {22796#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; {22796#true} is VALID [2022-04-27 15:10:30,594 INFO L290 TraceCheckUtils]: 8: Hoare triple {22796#true} assume !(0 != ~p1~0); {22796#true} is VALID [2022-04-27 15:10:30,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {22796#true} assume !(0 != ~p2~0); {22796#true} is VALID [2022-04-27 15:10:30,595 INFO L290 TraceCheckUtils]: 10: Hoare triple {22796#true} assume !(0 != ~p3~0); {22796#true} is VALID [2022-04-27 15:10:30,595 INFO L290 TraceCheckUtils]: 11: Hoare triple {22796#true} assume !(0 != ~p4~0); {22796#true} is VALID [2022-04-27 15:10:30,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {22796#true} assume !(0 != ~p5~0); {22796#true} is VALID [2022-04-27 15:10:30,596 INFO L290 TraceCheckUtils]: 13: Hoare triple {22796#true} assume 0 != ~p6~0;~lk6~0 := 1; {22801#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:30,599 INFO L290 TraceCheckUtils]: 14: Hoare triple {22801#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {22801#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:30,599 INFO L290 TraceCheckUtils]: 15: Hoare triple {22801#(= main_~lk6~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {22801#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:30,599 INFO L290 TraceCheckUtils]: 16: Hoare triple {22801#(= main_~lk6~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {22801#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:30,600 INFO L290 TraceCheckUtils]: 17: Hoare triple {22801#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {22801#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:30,600 INFO L290 TraceCheckUtils]: 18: Hoare triple {22801#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {22801#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:30,600 INFO L290 TraceCheckUtils]: 19: Hoare triple {22801#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {22801#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:30,600 INFO L290 TraceCheckUtils]: 20: Hoare triple {22801#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {22801#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:30,600 INFO L290 TraceCheckUtils]: 21: Hoare triple {22801#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {22801#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:30,601 INFO L290 TraceCheckUtils]: 22: Hoare triple {22801#(= main_~lk6~0 1)} assume 0 != ~p6~0; {22801#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:30,601 INFO L290 TraceCheckUtils]: 23: Hoare triple {22801#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {22797#false} is VALID [2022-04-27 15:10:30,601 INFO L290 TraceCheckUtils]: 24: Hoare triple {22797#false} assume !false; {22797#false} is VALID [2022-04-27 15:10:30,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:30,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:30,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946694154] [2022-04-27 15:10:30,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946694154] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:30,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:30,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:30,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482174800] [2022-04-27 15:10:30,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:30,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 15:10:30,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:30,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:30,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:30,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:30,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:30,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:30,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:30,615 INFO L87 Difference]: Start difference. First operand 889 states and 1335 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:30,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:30,795 INFO L93 Difference]: Finished difference Result 1549 states and 2361 transitions. [2022-04-27 15:10:30,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:30,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 15:10:30,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:30,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:30,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-27 15:10:30,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:30,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-27 15:10:30,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 99 transitions. [2022-04-27 15:10:30,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:30,922 INFO L225 Difference]: With dead ends: 1549 [2022-04-27 15:10:30,923 INFO L226 Difference]: Without dead ends: 1547 [2022-04-27 15:10:30,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:30,924 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 116 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:30,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 67 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:30,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2022-04-27 15:10:30,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1289. [2022-04-27 15:10:30,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:30,945 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1547 states. Second operand has 1289 states, 1285 states have (on average 1.4599221789883268) internal successors, (1876), 1285 states have internal predecessors, (1876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:30,946 INFO L74 IsIncluded]: Start isIncluded. First operand 1547 states. Second operand has 1289 states, 1285 states have (on average 1.4599221789883268) internal successors, (1876), 1285 states have internal predecessors, (1876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:30,947 INFO L87 Difference]: Start difference. First operand 1547 states. Second operand has 1289 states, 1285 states have (on average 1.4599221789883268) internal successors, (1876), 1285 states have internal predecessors, (1876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:31,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:31,012 INFO L93 Difference]: Finished difference Result 1547 states and 2328 transitions. [2022-04-27 15:10:31,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2328 transitions. [2022-04-27 15:10:31,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:31,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:31,016 INFO L74 IsIncluded]: Start isIncluded. First operand has 1289 states, 1285 states have (on average 1.4599221789883268) internal successors, (1876), 1285 states have internal predecessors, (1876), 2 states have call successors, (2), 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 1547 states. [2022-04-27 15:10:31,018 INFO L87 Difference]: Start difference. First operand has 1289 states, 1285 states have (on average 1.4599221789883268) internal successors, (1876), 1285 states have internal predecessors, (1876), 2 states have call successors, (2), 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 1547 states. [2022-04-27 15:10:31,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:31,084 INFO L93 Difference]: Finished difference Result 1547 states and 2328 transitions. [2022-04-27 15:10:31,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2328 transitions. [2022-04-27 15:10:31,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:31,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:31,086 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:31,086 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:31,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 1285 states have (on average 1.4599221789883268) internal successors, (1876), 1285 states have internal predecessors, (1876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:31,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1879 transitions. [2022-04-27 15:10:31,132 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1879 transitions. Word has length 25 [2022-04-27 15:10:31,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:31,132 INFO L495 AbstractCegarLoop]: Abstraction has 1289 states and 1879 transitions. [2022-04-27 15:10:31,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:31,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1879 transitions. [2022-04-27 15:10:31,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 15:10:31,133 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:31,133 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:31,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-27 15:10:31,133 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:31,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:31,134 INFO L85 PathProgramCache]: Analyzing trace with hash -802164224, now seen corresponding path program 1 times [2022-04-27 15:10:31,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:31,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165243543] [2022-04-27 15:10:31,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:31,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:31,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:31,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:31,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:31,163 INFO L290 TraceCheckUtils]: 0: Hoare triple {28856#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {28850#true} is VALID [2022-04-27 15:10:31,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {28850#true} assume true; {28850#true} is VALID [2022-04-27 15:10:31,164 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28850#true} {28850#true} #183#return; {28850#true} is VALID [2022-04-27 15:10:31,164 INFO L272 TraceCheckUtils]: 0: Hoare triple {28850#true} call ULTIMATE.init(); {28856#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:31,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {28856#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {28850#true} is VALID [2022-04-27 15:10:31,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {28850#true} assume true; {28850#true} is VALID [2022-04-27 15:10:31,164 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28850#true} {28850#true} #183#return; {28850#true} is VALID [2022-04-27 15:10:31,164 INFO L272 TraceCheckUtils]: 4: Hoare triple {28850#true} call #t~ret14 := main(); {28850#true} is VALID [2022-04-27 15:10:31,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {28850#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;havoc ~cond~0; {28850#true} is VALID [2022-04-27 15:10:31,164 INFO L290 TraceCheckUtils]: 6: Hoare triple {28850#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {28850#true} is VALID [2022-04-27 15:10:31,164 INFO L290 TraceCheckUtils]: 7: Hoare triple {28850#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; {28850#true} is VALID [2022-04-27 15:10:31,164 INFO L290 TraceCheckUtils]: 8: Hoare triple {28850#true} assume !(0 != ~p1~0); {28850#true} is VALID [2022-04-27 15:10:31,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {28850#true} assume !(0 != ~p2~0); {28850#true} is VALID [2022-04-27 15:10:31,165 INFO L290 TraceCheckUtils]: 10: Hoare triple {28850#true} assume !(0 != ~p3~0); {28850#true} is VALID [2022-04-27 15:10:31,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {28850#true} assume !(0 != ~p4~0); {28850#true} is VALID [2022-04-27 15:10:31,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {28850#true} assume !(0 != ~p5~0); {28850#true} is VALID [2022-04-27 15:10:31,165 INFO L290 TraceCheckUtils]: 13: Hoare triple {28850#true} assume !(0 != ~p6~0); {28855#(= main_~p6~0 0)} is VALID [2022-04-27 15:10:31,165 INFO L290 TraceCheckUtils]: 14: Hoare triple {28855#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {28855#(= main_~p6~0 0)} is VALID [2022-04-27 15:10:31,165 INFO L290 TraceCheckUtils]: 15: Hoare triple {28855#(= main_~p6~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {28855#(= main_~p6~0 0)} is VALID [2022-04-27 15:10:31,166 INFO L290 TraceCheckUtils]: 16: Hoare triple {28855#(= main_~p6~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {28855#(= main_~p6~0 0)} is VALID [2022-04-27 15:10:31,166 INFO L290 TraceCheckUtils]: 17: Hoare triple {28855#(= main_~p6~0 0)} assume !(0 != ~p1~0); {28855#(= main_~p6~0 0)} is VALID [2022-04-27 15:10:31,166 INFO L290 TraceCheckUtils]: 18: Hoare triple {28855#(= main_~p6~0 0)} assume !(0 != ~p2~0); {28855#(= main_~p6~0 0)} is VALID [2022-04-27 15:10:31,166 INFO L290 TraceCheckUtils]: 19: Hoare triple {28855#(= main_~p6~0 0)} assume !(0 != ~p3~0); {28855#(= main_~p6~0 0)} is VALID [2022-04-27 15:10:31,166 INFO L290 TraceCheckUtils]: 20: Hoare triple {28855#(= main_~p6~0 0)} assume !(0 != ~p4~0); {28855#(= main_~p6~0 0)} is VALID [2022-04-27 15:10:31,167 INFO L290 TraceCheckUtils]: 21: Hoare triple {28855#(= main_~p6~0 0)} assume !(0 != ~p5~0); {28855#(= main_~p6~0 0)} is VALID [2022-04-27 15:10:31,167 INFO L290 TraceCheckUtils]: 22: Hoare triple {28855#(= main_~p6~0 0)} assume 0 != ~p6~0; {28851#false} is VALID [2022-04-27 15:10:31,167 INFO L290 TraceCheckUtils]: 23: Hoare triple {28851#false} assume 1 != ~lk6~0; {28851#false} is VALID [2022-04-27 15:10:31,167 INFO L290 TraceCheckUtils]: 24: Hoare triple {28851#false} assume !false; {28851#false} is VALID [2022-04-27 15:10:31,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:31,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:31,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165243543] [2022-04-27 15:10:31,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165243543] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:31,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:31,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:31,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700727903] [2022-04-27 15:10:31,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:31,168 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 15:10:31,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:31,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:31,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:31,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:31,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:31,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:31,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:31,181 INFO L87 Difference]: Start difference. First operand 1289 states and 1879 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:31,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:31,524 INFO L93 Difference]: Finished difference Result 2957 states and 4313 transitions. [2022-04-27 15:10:31,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:31,525 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 15:10:31,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:31,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:31,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-27 15:10:31,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:31,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-27 15:10:31,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 159 transitions. [2022-04-27 15:10:31,611 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-27 15:10:31,694 INFO L225 Difference]: With dead ends: 2957 [2022-04-27 15:10:31,694 INFO L226 Difference]: Without dead ends: 1707 [2022-04-27 15:10:31,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:31,696 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 103 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:31,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 97 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:31,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2022-04-27 15:10:31,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1705. [2022-04-27 15:10:31,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:31,721 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1707 states. Second operand has 1705 states, 1701 states have (on average 1.4320987654320987) internal successors, (2436), 1701 states have internal predecessors, (2436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:31,723 INFO L74 IsIncluded]: Start isIncluded. First operand 1707 states. Second operand has 1705 states, 1701 states have (on average 1.4320987654320987) internal successors, (2436), 1701 states have internal predecessors, (2436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:31,724 INFO L87 Difference]: Start difference. First operand 1707 states. Second operand has 1705 states, 1701 states have (on average 1.4320987654320987) internal successors, (2436), 1701 states have internal predecessors, (2436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:31,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:31,797 INFO L93 Difference]: Finished difference Result 1707 states and 2440 transitions. [2022-04-27 15:10:31,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2440 transitions. [2022-04-27 15:10:31,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:31,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:31,801 INFO L74 IsIncluded]: Start isIncluded. First operand has 1705 states, 1701 states have (on average 1.4320987654320987) internal successors, (2436), 1701 states have internal predecessors, (2436), 2 states have call successors, (2), 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 1707 states. [2022-04-27 15:10:31,802 INFO L87 Difference]: Start difference. First operand has 1705 states, 1701 states have (on average 1.4320987654320987) internal successors, (2436), 1701 states have internal predecessors, (2436), 2 states have call successors, (2), 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 1707 states. [2022-04-27 15:10:31,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:31,876 INFO L93 Difference]: Finished difference Result 1707 states and 2440 transitions. [2022-04-27 15:10:31,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2440 transitions. [2022-04-27 15:10:31,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:31,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:31,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:31,878 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:31,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1705 states, 1701 states have (on average 1.4320987654320987) internal successors, (2436), 1701 states have internal predecessors, (2436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:31,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 2439 transitions. [2022-04-27 15:10:31,957 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 2439 transitions. Word has length 25 [2022-04-27 15:10:31,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:31,957 INFO L495 AbstractCegarLoop]: Abstraction has 1705 states and 2439 transitions. [2022-04-27 15:10:31,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:31,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 2439 transitions. [2022-04-27 15:10:31,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 15:10:31,959 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:31,959 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:31,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-27 15:10:31,959 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:31,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:31,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1489734258, now seen corresponding path program 1 times [2022-04-27 15:10:31,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:31,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027600554] [2022-04-27 15:10:31,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:31,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:31,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:31,989 INFO L290 TraceCheckUtils]: 0: Hoare triple {37118#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {37112#true} is VALID [2022-04-27 15:10:31,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {37112#true} assume true; {37112#true} is VALID [2022-04-27 15:10:31,989 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37112#true} {37112#true} #183#return; {37112#true} is VALID [2022-04-27 15:10:31,990 INFO L272 TraceCheckUtils]: 0: Hoare triple {37112#true} call ULTIMATE.init(); {37118#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:31,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {37118#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {37112#true} is VALID [2022-04-27 15:10:31,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {37112#true} assume true; {37112#true} is VALID [2022-04-27 15:10:31,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37112#true} {37112#true} #183#return; {37112#true} is VALID [2022-04-27 15:10:31,990 INFO L272 TraceCheckUtils]: 4: Hoare triple {37112#true} call #t~ret14 := main(); {37112#true} is VALID [2022-04-27 15:10:31,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {37112#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;havoc ~cond~0; {37112#true} is VALID [2022-04-27 15:10:31,990 INFO L290 TraceCheckUtils]: 6: Hoare triple {37112#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {37112#true} is VALID [2022-04-27 15:10:31,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {37112#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; {37112#true} is VALID [2022-04-27 15:10:31,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {37112#true} assume !(0 != ~p1~0); {37112#true} is VALID [2022-04-27 15:10:31,990 INFO L290 TraceCheckUtils]: 9: Hoare triple {37112#true} assume !(0 != ~p2~0); {37112#true} is VALID [2022-04-27 15:10:31,990 INFO L290 TraceCheckUtils]: 10: Hoare triple {37112#true} assume !(0 != ~p3~0); {37112#true} is VALID [2022-04-27 15:10:31,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {37112#true} assume !(0 != ~p4~0); {37112#true} is VALID [2022-04-27 15:10:31,990 INFO L290 TraceCheckUtils]: 12: Hoare triple {37112#true} assume !(0 != ~p5~0); {37112#true} is VALID [2022-04-27 15:10:31,991 INFO L290 TraceCheckUtils]: 13: Hoare triple {37112#true} assume 0 != ~p6~0;~lk6~0 := 1; {37117#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:10:31,991 INFO L290 TraceCheckUtils]: 14: Hoare triple {37117#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {37117#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:10:31,991 INFO L290 TraceCheckUtils]: 15: Hoare triple {37117#(not (= main_~p6~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {37117#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:10:31,991 INFO L290 TraceCheckUtils]: 16: Hoare triple {37117#(not (= main_~p6~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {37117#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:10:31,992 INFO L290 TraceCheckUtils]: 17: Hoare triple {37117#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {37117#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:10:31,992 INFO L290 TraceCheckUtils]: 18: Hoare triple {37117#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {37117#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:10:31,992 INFO L290 TraceCheckUtils]: 19: Hoare triple {37117#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {37117#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:10:31,992 INFO L290 TraceCheckUtils]: 20: Hoare triple {37117#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {37117#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:10:31,992 INFO L290 TraceCheckUtils]: 21: Hoare triple {37117#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {37117#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:10:31,993 INFO L290 TraceCheckUtils]: 22: Hoare triple {37117#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {37113#false} is VALID [2022-04-27 15:10:31,993 INFO L290 TraceCheckUtils]: 23: Hoare triple {37113#false} assume 0 != ~p7~0; {37113#false} is VALID [2022-04-27 15:10:31,993 INFO L290 TraceCheckUtils]: 24: Hoare triple {37113#false} assume 1 != ~lk7~0; {37113#false} is VALID [2022-04-27 15:10:31,993 INFO L290 TraceCheckUtils]: 25: Hoare triple {37113#false} assume !false; {37113#false} is VALID [2022-04-27 15:10:31,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:31,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:31,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027600554] [2022-04-27 15:10:31,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027600554] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:31,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:31,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:31,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608630105] [2022-04-27 15:10:31,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:31,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 15:10:31,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:31,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:32,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:32,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:32,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:32,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:32,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:32,008 INFO L87 Difference]: Start difference. First operand 1705 states and 2439 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:32,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:32,293 INFO L93 Difference]: Finished difference Result 2557 states and 3641 transitions. [2022-04-27 15:10:32,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:32,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 15:10:32,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:32,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:32,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2022-04-27 15:10:32,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:32,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2022-04-27 15:10:32,295 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 154 transitions. [2022-04-27 15:10:32,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:32,490 INFO L225 Difference]: With dead ends: 2557 [2022-04-27 15:10:32,490 INFO L226 Difference]: Without dead ends: 1739 [2022-04-27 15:10:32,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:32,492 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 113 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:32,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 88 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:32,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2022-04-27 15:10:32,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1737. [2022-04-27 15:10:32,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:32,520 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1739 states. Second operand has 1737 states, 1733 states have (on average 1.4056549336410848) internal successors, (2436), 1733 states have internal predecessors, (2436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:32,521 INFO L74 IsIncluded]: Start isIncluded. First operand 1739 states. Second operand has 1737 states, 1733 states have (on average 1.4056549336410848) internal successors, (2436), 1733 states have internal predecessors, (2436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:32,522 INFO L87 Difference]: Start difference. First operand 1739 states. Second operand has 1737 states, 1733 states have (on average 1.4056549336410848) internal successors, (2436), 1733 states have internal predecessors, (2436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:32,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:32,597 INFO L93 Difference]: Finished difference Result 1739 states and 2440 transitions. [2022-04-27 15:10:32,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2440 transitions. [2022-04-27 15:10:32,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:32,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:32,601 INFO L74 IsIncluded]: Start isIncluded. First operand has 1737 states, 1733 states have (on average 1.4056549336410848) internal successors, (2436), 1733 states have internal predecessors, (2436), 2 states have call successors, (2), 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 1739 states. [2022-04-27 15:10:32,602 INFO L87 Difference]: Start difference. First operand has 1737 states, 1733 states have (on average 1.4056549336410848) internal successors, (2436), 1733 states have internal predecessors, (2436), 2 states have call successors, (2), 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 1739 states. [2022-04-27 15:10:32,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:32,678 INFO L93 Difference]: Finished difference Result 1739 states and 2440 transitions. [2022-04-27 15:10:32,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2440 transitions. [2022-04-27 15:10:32,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:32,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:32,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:32,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:32,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1737 states, 1733 states have (on average 1.4056549336410848) internal successors, (2436), 1733 states have internal predecessors, (2436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:32,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1737 states and 2439 transitions. [2022-04-27 15:10:32,783 INFO L78 Accepts]: Start accepts. Automaton has 1737 states and 2439 transitions. Word has length 26 [2022-04-27 15:10:32,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:32,783 INFO L495 AbstractCegarLoop]: Abstraction has 1737 states and 2439 transitions. [2022-04-27 15:10:32,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:32,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 2439 transitions. [2022-04-27 15:10:32,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 15:10:32,784 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:32,784 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:32,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-27 15:10:32,785 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:32,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:32,785 INFO L85 PathProgramCache]: Analyzing trace with hash 902928244, now seen corresponding path program 1 times [2022-04-27 15:10:32,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:32,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047994438] [2022-04-27 15:10:32,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:32,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:32,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:32,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:32,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:32,808 INFO L290 TraceCheckUtils]: 0: Hoare triple {45076#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {45070#true} is VALID [2022-04-27 15:10:32,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {45070#true} assume true; {45070#true} is VALID [2022-04-27 15:10:32,808 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45070#true} {45070#true} #183#return; {45070#true} is VALID [2022-04-27 15:10:32,808 INFO L272 TraceCheckUtils]: 0: Hoare triple {45070#true} call ULTIMATE.init(); {45076#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:32,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {45076#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {45070#true} is VALID [2022-04-27 15:10:32,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {45070#true} assume true; {45070#true} is VALID [2022-04-27 15:10:32,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45070#true} {45070#true} #183#return; {45070#true} is VALID [2022-04-27 15:10:32,809 INFO L272 TraceCheckUtils]: 4: Hoare triple {45070#true} call #t~ret14 := main(); {45070#true} is VALID [2022-04-27 15:10:32,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {45070#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;havoc ~cond~0; {45070#true} is VALID [2022-04-27 15:10:32,809 INFO L290 TraceCheckUtils]: 6: Hoare triple {45070#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {45070#true} is VALID [2022-04-27 15:10:32,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {45070#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; {45070#true} is VALID [2022-04-27 15:10:32,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {45070#true} assume !(0 != ~p1~0); {45070#true} is VALID [2022-04-27 15:10:32,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {45070#true} assume !(0 != ~p2~0); {45070#true} is VALID [2022-04-27 15:10:32,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {45070#true} assume !(0 != ~p3~0); {45070#true} is VALID [2022-04-27 15:10:32,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {45070#true} assume !(0 != ~p4~0); {45070#true} is VALID [2022-04-27 15:10:32,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {45070#true} assume !(0 != ~p5~0); {45070#true} is VALID [2022-04-27 15:10:32,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {45070#true} assume !(0 != ~p6~0); {45070#true} is VALID [2022-04-27 15:10:32,809 INFO L290 TraceCheckUtils]: 14: Hoare triple {45070#true} assume 0 != ~p7~0;~lk7~0 := 1; {45075#(= main_~lk7~0 1)} is VALID [2022-04-27 15:10:32,809 INFO L290 TraceCheckUtils]: 15: Hoare triple {45075#(= main_~lk7~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {45075#(= main_~lk7~0 1)} is VALID [2022-04-27 15:10:32,810 INFO L290 TraceCheckUtils]: 16: Hoare triple {45075#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {45075#(= main_~lk7~0 1)} is VALID [2022-04-27 15:10:32,810 INFO L290 TraceCheckUtils]: 17: Hoare triple {45075#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {45075#(= main_~lk7~0 1)} is VALID [2022-04-27 15:10:32,810 INFO L290 TraceCheckUtils]: 18: Hoare triple {45075#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {45075#(= main_~lk7~0 1)} is VALID [2022-04-27 15:10:32,810 INFO L290 TraceCheckUtils]: 19: Hoare triple {45075#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {45075#(= main_~lk7~0 1)} is VALID [2022-04-27 15:10:32,811 INFO L290 TraceCheckUtils]: 20: Hoare triple {45075#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {45075#(= main_~lk7~0 1)} is VALID [2022-04-27 15:10:32,811 INFO L290 TraceCheckUtils]: 21: Hoare triple {45075#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {45075#(= main_~lk7~0 1)} is VALID [2022-04-27 15:10:32,811 INFO L290 TraceCheckUtils]: 22: Hoare triple {45075#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {45075#(= main_~lk7~0 1)} is VALID [2022-04-27 15:10:32,811 INFO L290 TraceCheckUtils]: 23: Hoare triple {45075#(= main_~lk7~0 1)} assume 0 != ~p7~0; {45075#(= main_~lk7~0 1)} is VALID [2022-04-27 15:10:32,811 INFO L290 TraceCheckUtils]: 24: Hoare triple {45075#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {45071#false} is VALID [2022-04-27 15:10:32,811 INFO L290 TraceCheckUtils]: 25: Hoare triple {45071#false} assume !false; {45071#false} is VALID [2022-04-27 15:10:32,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:32,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:32,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047994438] [2022-04-27 15:10:32,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047994438] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:32,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:32,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:32,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855846021] [2022-04-27 15:10:32,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:32,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 15:10:32,812 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:32,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:32,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:32,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:32,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:32,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:32,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:32,826 INFO L87 Difference]: Start difference. First operand 1737 states and 2439 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:33,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:33,150 INFO L93 Difference]: Finished difference Result 2957 states and 4201 transitions. [2022-04-27 15:10:33,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:33,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 15:10:33,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:33,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:33,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-04-27 15:10:33,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:33,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-04-27 15:10:33,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 95 transitions. [2022-04-27 15:10:33,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:33,438 INFO L225 Difference]: With dead ends: 2957 [2022-04-27 15:10:33,438 INFO L226 Difference]: Without dead ends: 2955 [2022-04-27 15:10:33,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:33,439 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 109 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:33,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 66 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:33,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2022-04-27 15:10:33,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2569. [2022-04-27 15:10:33,478 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:33,481 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2955 states. Second operand has 2569 states, 2565 states have (on average 1.3614035087719298) internal successors, (3492), 2565 states have internal predecessors, (3492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:33,483 INFO L74 IsIncluded]: Start isIncluded. First operand 2955 states. Second operand has 2569 states, 2565 states have (on average 1.3614035087719298) internal successors, (3492), 2565 states have internal predecessors, (3492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:33,485 INFO L87 Difference]: Start difference. First operand 2955 states. Second operand has 2569 states, 2565 states have (on average 1.3614035087719298) internal successors, (3492), 2565 states have internal predecessors, (3492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:33,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:33,682 INFO L93 Difference]: Finished difference Result 2955 states and 4136 transitions. [2022-04-27 15:10:33,682 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 4136 transitions. [2022-04-27 15:10:33,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:33,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:33,687 INFO L74 IsIncluded]: Start isIncluded. First operand has 2569 states, 2565 states have (on average 1.3614035087719298) internal successors, (3492), 2565 states have internal predecessors, (3492), 2 states have call successors, (2), 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 2955 states. [2022-04-27 15:10:33,689 INFO L87 Difference]: Start difference. First operand has 2569 states, 2565 states have (on average 1.3614035087719298) internal successors, (3492), 2565 states have internal predecessors, (3492), 2 states have call successors, (2), 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 2955 states. [2022-04-27 15:10:33,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:33,888 INFO L93 Difference]: Finished difference Result 2955 states and 4136 transitions. [2022-04-27 15:10:33,888 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 4136 transitions. [2022-04-27 15:10:33,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:33,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:33,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:33,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:33,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2569 states, 2565 states have (on average 1.3614035087719298) internal successors, (3492), 2565 states have internal predecessors, (3492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:34,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2569 states and 3495 transitions. [2022-04-27 15:10:34,059 INFO L78 Accepts]: Start accepts. Automaton has 2569 states and 3495 transitions. Word has length 26 [2022-04-27 15:10:34,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:34,059 INFO L495 AbstractCegarLoop]: Abstraction has 2569 states and 3495 transitions. [2022-04-27 15:10:34,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:34,060 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 3495 transitions. [2022-04-27 15:10:34,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 15:10:34,061 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:34,062 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:34,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-27 15:10:34,062 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:34,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:34,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1161093682, now seen corresponding path program 1 times [2022-04-27 15:10:34,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:34,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463618359] [2022-04-27 15:10:34,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:34,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:34,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:34,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:34,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:34,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {56730#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {56724#true} is VALID [2022-04-27 15:10:34,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {56724#true} assume true; {56724#true} is VALID [2022-04-27 15:10:34,089 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56724#true} {56724#true} #183#return; {56724#true} is VALID [2022-04-27 15:10:34,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {56724#true} call ULTIMATE.init(); {56730#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:34,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {56730#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {56724#true} is VALID [2022-04-27 15:10:34,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {56724#true} assume true; {56724#true} is VALID [2022-04-27 15:10:34,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56724#true} {56724#true} #183#return; {56724#true} is VALID [2022-04-27 15:10:34,090 INFO L272 TraceCheckUtils]: 4: Hoare triple {56724#true} call #t~ret14 := main(); {56724#true} is VALID [2022-04-27 15:10:34,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {56724#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;havoc ~cond~0; {56724#true} is VALID [2022-04-27 15:10:34,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {56724#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {56724#true} is VALID [2022-04-27 15:10:34,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {56724#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; {56724#true} is VALID [2022-04-27 15:10:34,090 INFO L290 TraceCheckUtils]: 8: Hoare triple {56724#true} assume !(0 != ~p1~0); {56724#true} is VALID [2022-04-27 15:10:34,090 INFO L290 TraceCheckUtils]: 9: Hoare triple {56724#true} assume !(0 != ~p2~0); {56724#true} is VALID [2022-04-27 15:10:34,090 INFO L290 TraceCheckUtils]: 10: Hoare triple {56724#true} assume !(0 != ~p3~0); {56724#true} is VALID [2022-04-27 15:10:34,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {56724#true} assume !(0 != ~p4~0); {56724#true} is VALID [2022-04-27 15:10:34,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {56724#true} assume !(0 != ~p5~0); {56724#true} is VALID [2022-04-27 15:10:34,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {56724#true} assume !(0 != ~p6~0); {56724#true} is VALID [2022-04-27 15:10:34,090 INFO L290 TraceCheckUtils]: 14: Hoare triple {56724#true} assume !(0 != ~p7~0); {56729#(= main_~p7~0 0)} is VALID [2022-04-27 15:10:34,090 INFO L290 TraceCheckUtils]: 15: Hoare triple {56729#(= main_~p7~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {56729#(= main_~p7~0 0)} is VALID [2022-04-27 15:10:34,091 INFO L290 TraceCheckUtils]: 16: Hoare triple {56729#(= main_~p7~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {56729#(= main_~p7~0 0)} is VALID [2022-04-27 15:10:34,091 INFO L290 TraceCheckUtils]: 17: Hoare triple {56729#(= main_~p7~0 0)} assume !(0 != ~p1~0); {56729#(= main_~p7~0 0)} is VALID [2022-04-27 15:10:34,091 INFO L290 TraceCheckUtils]: 18: Hoare triple {56729#(= main_~p7~0 0)} assume !(0 != ~p2~0); {56729#(= main_~p7~0 0)} is VALID [2022-04-27 15:10:34,091 INFO L290 TraceCheckUtils]: 19: Hoare triple {56729#(= main_~p7~0 0)} assume !(0 != ~p3~0); {56729#(= main_~p7~0 0)} is VALID [2022-04-27 15:10:34,092 INFO L290 TraceCheckUtils]: 20: Hoare triple {56729#(= main_~p7~0 0)} assume !(0 != ~p4~0); {56729#(= main_~p7~0 0)} is VALID [2022-04-27 15:10:34,092 INFO L290 TraceCheckUtils]: 21: Hoare triple {56729#(= main_~p7~0 0)} assume !(0 != ~p5~0); {56729#(= main_~p7~0 0)} is VALID [2022-04-27 15:10:34,092 INFO L290 TraceCheckUtils]: 22: Hoare triple {56729#(= main_~p7~0 0)} assume !(0 != ~p6~0); {56729#(= main_~p7~0 0)} is VALID [2022-04-27 15:10:34,092 INFO L290 TraceCheckUtils]: 23: Hoare triple {56729#(= main_~p7~0 0)} assume 0 != ~p7~0; {56725#false} is VALID [2022-04-27 15:10:34,092 INFO L290 TraceCheckUtils]: 24: Hoare triple {56725#false} assume 1 != ~lk7~0; {56725#false} is VALID [2022-04-27 15:10:34,092 INFO L290 TraceCheckUtils]: 25: Hoare triple {56725#false} assume !false; {56725#false} is VALID [2022-04-27 15:10:34,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:34,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:34,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463618359] [2022-04-27 15:10:34,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463618359] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:34,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:34,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:34,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208852911] [2022-04-27 15:10:34,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:34,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 15:10:34,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:34,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:34,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:34,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:34,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:34,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:34,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:34,107 INFO L87 Difference]: Start difference. First operand 2569 states and 3495 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:35,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:35,052 INFO L93 Difference]: Finished difference Result 5837 states and 7913 transitions. [2022-04-27 15:10:35,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:35,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 15:10:35,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:35,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:35,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2022-04-27 15:10:35,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:35,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2022-04-27 15:10:35,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 156 transitions. [2022-04-27 15:10:35,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:35,462 INFO L225 Difference]: With dead ends: 5837 [2022-04-27 15:10:35,462 INFO L226 Difference]: Without dead ends: 3339 [2022-04-27 15:10:35,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:35,465 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 97 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:35,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 99 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:35,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2022-04-27 15:10:35,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 3337. [2022-04-27 15:10:35,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:35,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3339 states. Second operand has 3337 states, 3333 states have (on average 1.326132613261326) internal successors, (4420), 3333 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:35,521 INFO L74 IsIncluded]: Start isIncluded. First operand 3339 states. Second operand has 3337 states, 3333 states have (on average 1.326132613261326) internal successors, (4420), 3333 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:35,523 INFO L87 Difference]: Start difference. First operand 3339 states. Second operand has 3337 states, 3333 states have (on average 1.326132613261326) internal successors, (4420), 3333 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:35,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:35,813 INFO L93 Difference]: Finished difference Result 3339 states and 4424 transitions. [2022-04-27 15:10:35,813 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 4424 transitions. [2022-04-27 15:10:35,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:35,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:35,820 INFO L74 IsIncluded]: Start isIncluded. First operand has 3337 states, 3333 states have (on average 1.326132613261326) internal successors, (4420), 3333 states have internal predecessors, (4420), 2 states have call successors, (2), 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 3339 states. [2022-04-27 15:10:35,822 INFO L87 Difference]: Start difference. First operand has 3337 states, 3333 states have (on average 1.326132613261326) internal successors, (4420), 3333 states have internal predecessors, (4420), 2 states have call successors, (2), 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 3339 states. [2022-04-27 15:10:36,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:36,113 INFO L93 Difference]: Finished difference Result 3339 states and 4424 transitions. [2022-04-27 15:10:36,113 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 4424 transitions. [2022-04-27 15:10:36,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:36,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:36,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:36,117 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:36,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3337 states, 3333 states have (on average 1.326132613261326) internal successors, (4420), 3333 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:36,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3337 states to 3337 states and 4423 transitions. [2022-04-27 15:10:36,440 INFO L78 Accepts]: Start accepts. Automaton has 3337 states and 4423 transitions. Word has length 26 [2022-04-27 15:10:36,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:36,440 INFO L495 AbstractCegarLoop]: Abstraction has 3337 states and 4423 transitions. [2022-04-27 15:10:36,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:36,441 INFO L276 IsEmpty]: Start isEmpty. Operand 3337 states and 4423 transitions. [2022-04-27 15:10:36,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 15:10:36,443 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:36,443 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:36,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-27 15:10:36,443 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:36,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:36,443 INFO L85 PathProgramCache]: Analyzing trace with hash -2073779755, now seen corresponding path program 1 times [2022-04-27 15:10:36,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:36,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323759671] [2022-04-27 15:10:36,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:36,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:36,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:36,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:36,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:36,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {72928#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {72922#true} is VALID [2022-04-27 15:10:36,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {72922#true} assume true; {72922#true} is VALID [2022-04-27 15:10:36,466 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {72922#true} {72922#true} #183#return; {72922#true} is VALID [2022-04-27 15:10:36,467 INFO L272 TraceCheckUtils]: 0: Hoare triple {72922#true} call ULTIMATE.init(); {72928#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:36,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {72928#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {72922#true} is VALID [2022-04-27 15:10:36,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {72922#true} assume true; {72922#true} is VALID [2022-04-27 15:10:36,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {72922#true} {72922#true} #183#return; {72922#true} is VALID [2022-04-27 15:10:36,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {72922#true} call #t~ret14 := main(); {72922#true} is VALID [2022-04-27 15:10:36,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {72922#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;havoc ~cond~0; {72922#true} is VALID [2022-04-27 15:10:36,467 INFO L290 TraceCheckUtils]: 6: Hoare triple {72922#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {72922#true} is VALID [2022-04-27 15:10:36,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {72922#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; {72922#true} is VALID [2022-04-27 15:10:36,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {72922#true} assume !(0 != ~p1~0); {72922#true} is VALID [2022-04-27 15:10:36,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {72922#true} assume !(0 != ~p2~0); {72922#true} is VALID [2022-04-27 15:10:36,467 INFO L290 TraceCheckUtils]: 10: Hoare triple {72922#true} assume !(0 != ~p3~0); {72922#true} is VALID [2022-04-27 15:10:36,467 INFO L290 TraceCheckUtils]: 11: Hoare triple {72922#true} assume !(0 != ~p4~0); {72922#true} is VALID [2022-04-27 15:10:36,468 INFO L290 TraceCheckUtils]: 12: Hoare triple {72922#true} assume !(0 != ~p5~0); {72922#true} is VALID [2022-04-27 15:10:36,468 INFO L290 TraceCheckUtils]: 13: Hoare triple {72922#true} assume !(0 != ~p6~0); {72922#true} is VALID [2022-04-27 15:10:36,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {72922#true} assume 0 != ~p7~0;~lk7~0 := 1; {72927#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:10:36,468 INFO L290 TraceCheckUtils]: 15: Hoare triple {72927#(not (= main_~p7~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {72927#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:10:36,468 INFO L290 TraceCheckUtils]: 16: Hoare triple {72927#(not (= main_~p7~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {72927#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:10:36,468 INFO L290 TraceCheckUtils]: 17: Hoare triple {72927#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {72927#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:10:36,469 INFO L290 TraceCheckUtils]: 18: Hoare triple {72927#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {72927#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:10:36,469 INFO L290 TraceCheckUtils]: 19: Hoare triple {72927#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {72927#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:10:36,469 INFO L290 TraceCheckUtils]: 20: Hoare triple {72927#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {72927#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:10:36,469 INFO L290 TraceCheckUtils]: 21: Hoare triple {72927#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {72927#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:10:36,470 INFO L290 TraceCheckUtils]: 22: Hoare triple {72927#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {72927#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:10:36,473 INFO L290 TraceCheckUtils]: 23: Hoare triple {72927#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {72923#false} is VALID [2022-04-27 15:10:36,473 INFO L290 TraceCheckUtils]: 24: Hoare triple {72923#false} assume 0 != ~p8~0; {72923#false} is VALID [2022-04-27 15:10:36,473 INFO L290 TraceCheckUtils]: 25: Hoare triple {72923#false} assume 1 != ~lk8~0; {72923#false} is VALID [2022-04-27 15:10:36,473 INFO L290 TraceCheckUtils]: 26: Hoare triple {72923#false} assume !false; {72923#false} is VALID [2022-04-27 15:10:36,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:36,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:36,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323759671] [2022-04-27 15:10:36,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323759671] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:36,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:36,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:36,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539582683] [2022-04-27 15:10:36,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:36,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 15:10:36,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:36,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:36,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:36,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:36,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:36,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:36,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:36,488 INFO L87 Difference]: Start difference. First operand 3337 states and 4423 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:37,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:37,264 INFO L93 Difference]: Finished difference Result 5005 states and 6601 transitions. [2022-04-27 15:10:37,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:37,264 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 15:10:37,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:37,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:37,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-27 15:10:37,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:37,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-27 15:10:37,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 151 transitions. [2022-04-27 15:10:37,351 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-27 15:10:37,694 INFO L225 Difference]: With dead ends: 5005 [2022-04-27 15:10:37,694 INFO L226 Difference]: Without dead ends: 3403 [2022-04-27 15:10:37,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:37,697 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 112 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:37,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 85 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:37,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3403 states. [2022-04-27 15:10:37,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3403 to 3401. [2022-04-27 15:10:37,758 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:37,762 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3403 states. Second operand has 3401 states, 3397 states have (on average 1.3011480718280837) internal successors, (4420), 3397 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:37,765 INFO L74 IsIncluded]: Start isIncluded. First operand 3403 states. Second operand has 3401 states, 3397 states have (on average 1.3011480718280837) internal successors, (4420), 3397 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:37,767 INFO L87 Difference]: Start difference. First operand 3403 states. Second operand has 3401 states, 3397 states have (on average 1.3011480718280837) internal successors, (4420), 3397 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:38,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:38,070 INFO L93 Difference]: Finished difference Result 3403 states and 4424 transitions. [2022-04-27 15:10:38,070 INFO L276 IsEmpty]: Start isEmpty. Operand 3403 states and 4424 transitions. [2022-04-27 15:10:38,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:38,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:38,076 INFO L74 IsIncluded]: Start isIncluded. First operand has 3401 states, 3397 states have (on average 1.3011480718280837) internal successors, (4420), 3397 states have internal predecessors, (4420), 2 states have call successors, (2), 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 3403 states. [2022-04-27 15:10:38,078 INFO L87 Difference]: Start difference. First operand has 3401 states, 3397 states have (on average 1.3011480718280837) internal successors, (4420), 3397 states have internal predecessors, (4420), 2 states have call successors, (2), 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 3403 states. [2022-04-27 15:10:38,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:38,379 INFO L93 Difference]: Finished difference Result 3403 states and 4424 transitions. [2022-04-27 15:10:38,379 INFO L276 IsEmpty]: Start isEmpty. Operand 3403 states and 4424 transitions. [2022-04-27 15:10:38,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:38,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:38,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:38,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:38,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3401 states, 3397 states have (on average 1.3011480718280837) internal successors, (4420), 3397 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:38,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3401 states to 3401 states and 4423 transitions. [2022-04-27 15:10:38,708 INFO L78 Accepts]: Start accepts. Automaton has 3401 states and 4423 transitions. Word has length 27 [2022-04-27 15:10:38,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:38,708 INFO L495 AbstractCegarLoop]: Abstraction has 3401 states and 4423 transitions. [2022-04-27 15:10:38,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:38,708 INFO L276 IsEmpty]: Start isEmpty. Operand 3401 states and 4423 transitions. [2022-04-27 15:10:38,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 15:10:38,710 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:38,710 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:38,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-27 15:10:38,711 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:38,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:38,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1634381527, now seen corresponding path program 1 times [2022-04-27 15:10:38,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:38,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810558327] [2022-04-27 15:10:38,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:38,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:38,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:38,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:38,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:38,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {88486#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {88480#true} is VALID [2022-04-27 15:10:38,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {88480#true} assume true; {88480#true} is VALID [2022-04-27 15:10:38,734 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {88480#true} {88480#true} #183#return; {88480#true} is VALID [2022-04-27 15:10:38,735 INFO L272 TraceCheckUtils]: 0: Hoare triple {88480#true} call ULTIMATE.init(); {88486#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:38,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {88486#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {88480#true} is VALID [2022-04-27 15:10:38,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {88480#true} assume true; {88480#true} is VALID [2022-04-27 15:10:38,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {88480#true} {88480#true} #183#return; {88480#true} is VALID [2022-04-27 15:10:38,735 INFO L272 TraceCheckUtils]: 4: Hoare triple {88480#true} call #t~ret14 := main(); {88480#true} is VALID [2022-04-27 15:10:38,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {88480#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;havoc ~cond~0; {88480#true} is VALID [2022-04-27 15:10:38,735 INFO L290 TraceCheckUtils]: 6: Hoare triple {88480#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {88480#true} is VALID [2022-04-27 15:10:38,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {88480#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; {88480#true} is VALID [2022-04-27 15:10:38,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {88480#true} assume !(0 != ~p1~0); {88480#true} is VALID [2022-04-27 15:10:38,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {88480#true} assume !(0 != ~p2~0); {88480#true} is VALID [2022-04-27 15:10:38,735 INFO L290 TraceCheckUtils]: 10: Hoare triple {88480#true} assume !(0 != ~p3~0); {88480#true} is VALID [2022-04-27 15:10:38,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {88480#true} assume !(0 != ~p4~0); {88480#true} is VALID [2022-04-27 15:10:38,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {88480#true} assume !(0 != ~p5~0); {88480#true} is VALID [2022-04-27 15:10:38,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {88480#true} assume !(0 != ~p6~0); {88480#true} is VALID [2022-04-27 15:10:38,735 INFO L290 TraceCheckUtils]: 14: Hoare triple {88480#true} assume !(0 != ~p7~0); {88480#true} is VALID [2022-04-27 15:10:38,736 INFO L290 TraceCheckUtils]: 15: Hoare triple {88480#true} assume 0 != ~p8~0;~lk8~0 := 1; {88485#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:38,736 INFO L290 TraceCheckUtils]: 16: Hoare triple {88485#(= main_~lk8~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {88485#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:38,736 INFO L290 TraceCheckUtils]: 17: Hoare triple {88485#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {88485#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:38,736 INFO L290 TraceCheckUtils]: 18: Hoare triple {88485#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {88485#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:38,737 INFO L290 TraceCheckUtils]: 19: Hoare triple {88485#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {88485#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:38,737 INFO L290 TraceCheckUtils]: 20: Hoare triple {88485#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {88485#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:38,737 INFO L290 TraceCheckUtils]: 21: Hoare triple {88485#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {88485#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:38,737 INFO L290 TraceCheckUtils]: 22: Hoare triple {88485#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {88485#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:38,737 INFO L290 TraceCheckUtils]: 23: Hoare triple {88485#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {88485#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:38,738 INFO L290 TraceCheckUtils]: 24: Hoare triple {88485#(= main_~lk8~0 1)} assume 0 != ~p8~0; {88485#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:38,738 INFO L290 TraceCheckUtils]: 25: Hoare triple {88485#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {88481#false} is VALID [2022-04-27 15:10:38,738 INFO L290 TraceCheckUtils]: 26: Hoare triple {88481#false} assume !false; {88481#false} is VALID [2022-04-27 15:10:38,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:38,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:38,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810558327] [2022-04-27 15:10:38,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810558327] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:38,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:38,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:38,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526313429] [2022-04-27 15:10:38,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:38,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 15:10:38,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:38,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:38,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:38,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:38,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:38,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:38,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:38,753 INFO L87 Difference]: Start difference. First operand 3401 states and 4423 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:39,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:39,704 INFO L93 Difference]: Finished difference Result 5645 states and 7369 transitions. [2022-04-27 15:10:39,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:39,704 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 15:10:39,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:39,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:39,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-27 15:10:39,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:39,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-27 15:10:39,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 91 transitions. [2022-04-27 15:10:39,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:40,604 INFO L225 Difference]: With dead ends: 5645 [2022-04-27 15:10:40,604 INFO L226 Difference]: Without dead ends: 5643 [2022-04-27 15:10:40,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:40,605 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 102 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:40,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 65 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:40,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5643 states. [2022-04-27 15:10:40,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5643 to 5129. [2022-04-27 15:10:40,662 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:40,667 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5643 states. Second operand has 5129 states, 5125 states have (on average 1.2620487804878049) internal successors, (6468), 5125 states have internal predecessors, (6468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:40,672 INFO L74 IsIncluded]: Start isIncluded. First operand 5643 states. Second operand has 5129 states, 5125 states have (on average 1.2620487804878049) internal successors, (6468), 5125 states have internal predecessors, (6468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:40,676 INFO L87 Difference]: Start difference. First operand 5643 states. Second operand has 5129 states, 5125 states have (on average 1.2620487804878049) internal successors, (6468), 5125 states have internal predecessors, (6468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:41,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:41,444 INFO L93 Difference]: Finished difference Result 5643 states and 7240 transitions. [2022-04-27 15:10:41,444 INFO L276 IsEmpty]: Start isEmpty. Operand 5643 states and 7240 transitions. [2022-04-27 15:10:41,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:41,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:41,454 INFO L74 IsIncluded]: Start isIncluded. First operand has 5129 states, 5125 states have (on average 1.2620487804878049) internal successors, (6468), 5125 states have internal predecessors, (6468), 2 states have call successors, (2), 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 5643 states. [2022-04-27 15:10:41,457 INFO L87 Difference]: Start difference. First operand has 5129 states, 5125 states have (on average 1.2620487804878049) internal successors, (6468), 5125 states have internal predecessors, (6468), 2 states have call successors, (2), 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 5643 states. [2022-04-27 15:10:42,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:42,231 INFO L93 Difference]: Finished difference Result 5643 states and 7240 transitions. [2022-04-27 15:10:42,231 INFO L276 IsEmpty]: Start isEmpty. Operand 5643 states and 7240 transitions. [2022-04-27 15:10:42,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:42,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:42,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:42,236 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:42,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5129 states, 5125 states have (on average 1.2620487804878049) internal successors, (6468), 5125 states have internal predecessors, (6468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:42,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5129 states to 5129 states and 6471 transitions. [2022-04-27 15:10:42,977 INFO L78 Accepts]: Start accepts. Automaton has 5129 states and 6471 transitions. Word has length 27 [2022-04-27 15:10:42,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:42,977 INFO L495 AbstractCegarLoop]: Abstraction has 5129 states and 6471 transitions. [2022-04-27 15:10:42,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:42,977 INFO L276 IsEmpty]: Start isEmpty. Operand 5129 states and 6471 transitions. [2022-04-27 15:10:42,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 15:10:42,981 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:42,981 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:42,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-27 15:10:42,982 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:42,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:42,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1892546965, now seen corresponding path program 1 times [2022-04-27 15:10:42,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:42,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899494070] [2022-04-27 15:10:42,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:42,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:42,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:43,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:43,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {110956#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {110950#true} is VALID [2022-04-27 15:10:43,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {110950#true} assume true; {110950#true} is VALID [2022-04-27 15:10:43,025 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {110950#true} {110950#true} #183#return; {110950#true} is VALID [2022-04-27 15:10:43,025 INFO L272 TraceCheckUtils]: 0: Hoare triple {110950#true} call ULTIMATE.init(); {110956#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:43,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {110956#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {110950#true} is VALID [2022-04-27 15:10:43,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {110950#true} assume true; {110950#true} is VALID [2022-04-27 15:10:43,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {110950#true} {110950#true} #183#return; {110950#true} is VALID [2022-04-27 15:10:43,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {110950#true} call #t~ret14 := main(); {110950#true} is VALID [2022-04-27 15:10:43,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {110950#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;havoc ~cond~0; {110950#true} is VALID [2022-04-27 15:10:43,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {110950#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {110950#true} is VALID [2022-04-27 15:10:43,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {110950#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; {110950#true} is VALID [2022-04-27 15:10:43,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {110950#true} assume !(0 != ~p1~0); {110950#true} is VALID [2022-04-27 15:10:43,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {110950#true} assume !(0 != ~p2~0); {110950#true} is VALID [2022-04-27 15:10:43,026 INFO L290 TraceCheckUtils]: 10: Hoare triple {110950#true} assume !(0 != ~p3~0); {110950#true} is VALID [2022-04-27 15:10:43,026 INFO L290 TraceCheckUtils]: 11: Hoare triple {110950#true} assume !(0 != ~p4~0); {110950#true} is VALID [2022-04-27 15:10:43,026 INFO L290 TraceCheckUtils]: 12: Hoare triple {110950#true} assume !(0 != ~p5~0); {110950#true} is VALID [2022-04-27 15:10:43,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {110950#true} assume !(0 != ~p6~0); {110950#true} is VALID [2022-04-27 15:10:43,026 INFO L290 TraceCheckUtils]: 14: Hoare triple {110950#true} assume !(0 != ~p7~0); {110950#true} is VALID [2022-04-27 15:10:43,026 INFO L290 TraceCheckUtils]: 15: Hoare triple {110950#true} assume !(0 != ~p8~0); {110955#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:43,026 INFO L290 TraceCheckUtils]: 16: Hoare triple {110955#(= main_~p8~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {110955#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:43,027 INFO L290 TraceCheckUtils]: 17: Hoare triple {110955#(= main_~p8~0 0)} assume !(0 != ~p1~0); {110955#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:43,027 INFO L290 TraceCheckUtils]: 18: Hoare triple {110955#(= main_~p8~0 0)} assume !(0 != ~p2~0); {110955#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:43,027 INFO L290 TraceCheckUtils]: 19: Hoare triple {110955#(= main_~p8~0 0)} assume !(0 != ~p3~0); {110955#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:43,027 INFO L290 TraceCheckUtils]: 20: Hoare triple {110955#(= main_~p8~0 0)} assume !(0 != ~p4~0); {110955#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:43,028 INFO L290 TraceCheckUtils]: 21: Hoare triple {110955#(= main_~p8~0 0)} assume !(0 != ~p5~0); {110955#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:43,028 INFO L290 TraceCheckUtils]: 22: Hoare triple {110955#(= main_~p8~0 0)} assume !(0 != ~p6~0); {110955#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:43,028 INFO L290 TraceCheckUtils]: 23: Hoare triple {110955#(= main_~p8~0 0)} assume !(0 != ~p7~0); {110955#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:43,028 INFO L290 TraceCheckUtils]: 24: Hoare triple {110955#(= main_~p8~0 0)} assume 0 != ~p8~0; {110951#false} is VALID [2022-04-27 15:10:43,028 INFO L290 TraceCheckUtils]: 25: Hoare triple {110951#false} assume 1 != ~lk8~0; {110951#false} is VALID [2022-04-27 15:10:43,028 INFO L290 TraceCheckUtils]: 26: Hoare triple {110951#false} assume !false; {110951#false} is VALID [2022-04-27 15:10:43,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:43,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:43,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899494070] [2022-04-27 15:10:43,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899494070] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:43,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:43,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:43,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996389441] [2022-04-27 15:10:43,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:43,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 15:10:43,029 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:43,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:43,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:43,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:43,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:43,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:43,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:43,053 INFO L87 Difference]: Start difference. First operand 5129 states and 6471 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:46,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:46,557 INFO L93 Difference]: Finished difference Result 11533 states and 14409 transitions. [2022-04-27 15:10:46,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:46,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 15:10:46,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:46,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:46,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2022-04-27 15:10:46,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:46,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2022-04-27 15:10:46,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 153 transitions. [2022-04-27 15:10:46,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:47,842 INFO L225 Difference]: With dead ends: 11533 [2022-04-27 15:10:47,842 INFO L226 Difference]: Without dead ends: 6539 [2022-04-27 15:10:47,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:47,846 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 91 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:47,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 101 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:47,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6539 states. [2022-04-27 15:10:47,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6539 to 6537. [2022-04-27 15:10:47,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:47,942 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6539 states. Second operand has 6537 states, 6533 states have (on average 1.2153681310270932) internal successors, (7940), 6533 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:47,948 INFO L74 IsIncluded]: Start isIncluded. First operand 6539 states. Second operand has 6537 states, 6533 states have (on average 1.2153681310270932) internal successors, (7940), 6533 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:47,953 INFO L87 Difference]: Start difference. First operand 6539 states. Second operand has 6537 states, 6533 states have (on average 1.2153681310270932) internal successors, (7940), 6533 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:49,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:49,088 INFO L93 Difference]: Finished difference Result 6539 states and 7944 transitions. [2022-04-27 15:10:49,088 INFO L276 IsEmpty]: Start isEmpty. Operand 6539 states and 7944 transitions. [2022-04-27 15:10:49,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:49,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:49,097 INFO L74 IsIncluded]: Start isIncluded. First operand has 6537 states, 6533 states have (on average 1.2153681310270932) internal successors, (7940), 6533 states have internal predecessors, (7940), 2 states have call successors, (2), 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 6539 states. [2022-04-27 15:10:49,101 INFO L87 Difference]: Start difference. First operand has 6537 states, 6533 states have (on average 1.2153681310270932) internal successors, (7940), 6533 states have internal predecessors, (7940), 2 states have call successors, (2), 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 6539 states. [2022-04-27 15:10:50,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:50,244 INFO L93 Difference]: Finished difference Result 6539 states and 7944 transitions. [2022-04-27 15:10:50,244 INFO L276 IsEmpty]: Start isEmpty. Operand 6539 states and 7944 transitions. [2022-04-27 15:10:50,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:50,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:50,249 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:50,249 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:50,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6537 states, 6533 states have (on average 1.2153681310270932) internal successors, (7940), 6533 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:51,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6537 states to 6537 states and 7943 transitions. [2022-04-27 15:10:51,456 INFO L78 Accepts]: Start accepts. Automaton has 6537 states and 7943 transitions. Word has length 27 [2022-04-27 15:10:51,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:51,456 INFO L495 AbstractCegarLoop]: Abstraction has 6537 states and 7943 transitions. [2022-04-27 15:10:51,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:51,456 INFO L276 IsEmpty]: Start isEmpty. Operand 6537 states and 7943 transitions. [2022-04-27 15:10:51,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 15:10:51,459 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:51,459 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:51,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-27 15:10:51,459 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:51,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:51,459 INFO L85 PathProgramCache]: Analyzing trace with hash -873564121, now seen corresponding path program 1 times [2022-04-27 15:10:51,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:51,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603721615] [2022-04-27 15:10:51,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:51,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:51,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:51,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:51,497 INFO L290 TraceCheckUtils]: 0: Hoare triple {142770#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {142764#true} is VALID [2022-04-27 15:10:51,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {142764#true} assume true; {142764#true} is VALID [2022-04-27 15:10:51,497 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {142764#true} {142764#true} #183#return; {142764#true} is VALID [2022-04-27 15:10:51,497 INFO L272 TraceCheckUtils]: 0: Hoare triple {142764#true} call ULTIMATE.init(); {142770#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:51,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {142770#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {142764#true} is VALID [2022-04-27 15:10:51,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {142764#true} assume true; {142764#true} is VALID [2022-04-27 15:10:51,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {142764#true} {142764#true} #183#return; {142764#true} is VALID [2022-04-27 15:10:51,498 INFO L272 TraceCheckUtils]: 4: Hoare triple {142764#true} call #t~ret14 := main(); {142764#true} is VALID [2022-04-27 15:10:51,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {142764#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;havoc ~cond~0; {142764#true} is VALID [2022-04-27 15:10:51,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {142764#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {142764#true} is VALID [2022-04-27 15:10:51,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {142764#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; {142764#true} is VALID [2022-04-27 15:10:51,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {142764#true} assume !(0 != ~p1~0); {142764#true} is VALID [2022-04-27 15:10:51,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {142764#true} assume !(0 != ~p2~0); {142764#true} is VALID [2022-04-27 15:10:51,498 INFO L290 TraceCheckUtils]: 10: Hoare triple {142764#true} assume !(0 != ~p3~0); {142764#true} is VALID [2022-04-27 15:10:51,498 INFO L290 TraceCheckUtils]: 11: Hoare triple {142764#true} assume !(0 != ~p4~0); {142764#true} is VALID [2022-04-27 15:10:51,498 INFO L290 TraceCheckUtils]: 12: Hoare triple {142764#true} assume !(0 != ~p5~0); {142764#true} is VALID [2022-04-27 15:10:51,498 INFO L290 TraceCheckUtils]: 13: Hoare triple {142764#true} assume !(0 != ~p6~0); {142764#true} is VALID [2022-04-27 15:10:51,498 INFO L290 TraceCheckUtils]: 14: Hoare triple {142764#true} assume !(0 != ~p7~0); {142764#true} is VALID [2022-04-27 15:10:51,498 INFO L290 TraceCheckUtils]: 15: Hoare triple {142764#true} assume 0 != ~p8~0;~lk8~0 := 1; {142769#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:51,499 INFO L290 TraceCheckUtils]: 16: Hoare triple {142769#(not (= main_~p8~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {142769#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:51,499 INFO L290 TraceCheckUtils]: 17: Hoare triple {142769#(not (= main_~p8~0 0))} assume !(0 != ~p1~0); {142769#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:51,499 INFO L290 TraceCheckUtils]: 18: Hoare triple {142769#(not (= main_~p8~0 0))} assume !(0 != ~p2~0); {142769#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:51,499 INFO L290 TraceCheckUtils]: 19: Hoare triple {142769#(not (= main_~p8~0 0))} assume !(0 != ~p3~0); {142769#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:51,499 INFO L290 TraceCheckUtils]: 20: Hoare triple {142769#(not (= main_~p8~0 0))} assume !(0 != ~p4~0); {142769#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:51,500 INFO L290 TraceCheckUtils]: 21: Hoare triple {142769#(not (= main_~p8~0 0))} assume !(0 != ~p5~0); {142769#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:51,500 INFO L290 TraceCheckUtils]: 22: Hoare triple {142769#(not (= main_~p8~0 0))} assume !(0 != ~p6~0); {142769#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:51,500 INFO L290 TraceCheckUtils]: 23: Hoare triple {142769#(not (= main_~p8~0 0))} assume !(0 != ~p7~0); {142769#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:51,500 INFO L290 TraceCheckUtils]: 24: Hoare triple {142769#(not (= main_~p8~0 0))} assume !(0 != ~p8~0); {142765#false} is VALID [2022-04-27 15:10:51,500 INFO L290 TraceCheckUtils]: 25: Hoare triple {142765#false} assume 0 != ~p9~0; {142765#false} is VALID [2022-04-27 15:10:51,500 INFO L290 TraceCheckUtils]: 26: Hoare triple {142765#false} assume 1 != ~lk9~0; {142765#false} is VALID [2022-04-27 15:10:51,500 INFO L290 TraceCheckUtils]: 27: Hoare triple {142765#false} assume !false; {142765#false} is VALID [2022-04-27 15:10:51,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:51,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:51,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603721615] [2022-04-27 15:10:51,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603721615] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:51,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:51,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:51,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17541135] [2022-04-27 15:10:51,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:51,502 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 15:10:51,502 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:51,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:51,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:51,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:51,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:51,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:51,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:51,514 INFO L87 Difference]: Start difference. First operand 6537 states and 7943 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:53,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:53,902 INFO L93 Difference]: Finished difference Result 9805 states and 11849 transitions. [2022-04-27 15:10:53,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:53,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 15:10:53,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:53,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:53,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-04-27 15:10:53,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:53,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-04-27 15:10:53,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 148 transitions. [2022-04-27 15:10:53,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:55,233 INFO L225 Difference]: With dead ends: 9805 [2022-04-27 15:10:55,233 INFO L226 Difference]: Without dead ends: 6667 [2022-04-27 15:10:55,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:55,235 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 111 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:55,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 82 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:55,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6667 states. [2022-04-27 15:10:55,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6667 to 6665. [2022-04-27 15:10:55,330 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:55,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6667 states. Second operand has 6665 states, 6661 states have (on average 1.1920132112295452) internal successors, (7940), 6661 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:55,340 INFO L74 IsIncluded]: Start isIncluded. First operand 6667 states. Second operand has 6665 states, 6661 states have (on average 1.1920132112295452) internal successors, (7940), 6661 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:55,345 INFO L87 Difference]: Start difference. First operand 6667 states. Second operand has 6665 states, 6661 states have (on average 1.1920132112295452) internal successors, (7940), 6661 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:56,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:56,502 INFO L93 Difference]: Finished difference Result 6667 states and 7944 transitions. [2022-04-27 15:10:56,502 INFO L276 IsEmpty]: Start isEmpty. Operand 6667 states and 7944 transitions. [2022-04-27 15:10:56,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:56,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:56,512 INFO L74 IsIncluded]: Start isIncluded. First operand has 6665 states, 6661 states have (on average 1.1920132112295452) internal successors, (7940), 6661 states have internal predecessors, (7940), 2 states have call successors, (2), 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 6667 states. [2022-04-27 15:10:56,516 INFO L87 Difference]: Start difference. First operand has 6665 states, 6661 states have (on average 1.1920132112295452) internal successors, (7940), 6661 states have internal predecessors, (7940), 2 states have call successors, (2), 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 6667 states. [2022-04-27 15:10:57,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:57,695 INFO L93 Difference]: Finished difference Result 6667 states and 7944 transitions. [2022-04-27 15:10:57,695 INFO L276 IsEmpty]: Start isEmpty. Operand 6667 states and 7944 transitions. [2022-04-27 15:10:57,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:57,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:57,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:57,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:57,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6665 states, 6661 states have (on average 1.1920132112295452) internal successors, (7940), 6661 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:59,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6665 states to 6665 states and 7943 transitions. [2022-04-27 15:10:59,065 INFO L78 Accepts]: Start accepts. Automaton has 6665 states and 7943 transitions. Word has length 28 [2022-04-27 15:10:59,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:59,065 INFO L495 AbstractCegarLoop]: Abstraction has 6665 states and 7943 transitions. [2022-04-27 15:10:59,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:59,065 INFO L276 IsEmpty]: Start isEmpty. Operand 6665 states and 7943 transitions. [2022-04-27 15:10:59,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 15:10:59,067 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:59,067 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:59,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-27 15:10:59,079 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:59,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:59,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1460370135, now seen corresponding path program 1 times [2022-04-27 15:10:59,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:59,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853131050] [2022-04-27 15:10:59,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:59,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:59,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:59,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:59,122 INFO L290 TraceCheckUtils]: 0: Hoare triple {173240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {173234#true} is VALID [2022-04-27 15:10:59,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {173234#true} assume true; {173234#true} is VALID [2022-04-27 15:10:59,122 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {173234#true} {173234#true} #183#return; {173234#true} is VALID [2022-04-27 15:10:59,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {173234#true} call ULTIMATE.init(); {173240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:59,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {173240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {173234#true} is VALID [2022-04-27 15:10:59,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {173234#true} assume true; {173234#true} is VALID [2022-04-27 15:10:59,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {173234#true} {173234#true} #183#return; {173234#true} is VALID [2022-04-27 15:10:59,123 INFO L272 TraceCheckUtils]: 4: Hoare triple {173234#true} call #t~ret14 := main(); {173234#true} is VALID [2022-04-27 15:10:59,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {173234#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;havoc ~cond~0; {173234#true} is VALID [2022-04-27 15:10:59,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {173234#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {173234#true} is VALID [2022-04-27 15:10:59,123 INFO L290 TraceCheckUtils]: 7: Hoare triple {173234#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; {173234#true} is VALID [2022-04-27 15:10:59,123 INFO L290 TraceCheckUtils]: 8: Hoare triple {173234#true} assume !(0 != ~p1~0); {173234#true} is VALID [2022-04-27 15:10:59,123 INFO L290 TraceCheckUtils]: 9: Hoare triple {173234#true} assume !(0 != ~p2~0); {173234#true} is VALID [2022-04-27 15:10:59,123 INFO L290 TraceCheckUtils]: 10: Hoare triple {173234#true} assume !(0 != ~p3~0); {173234#true} is VALID [2022-04-27 15:10:59,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {173234#true} assume !(0 != ~p4~0); {173234#true} is VALID [2022-04-27 15:10:59,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {173234#true} assume !(0 != ~p5~0); {173234#true} is VALID [2022-04-27 15:10:59,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {173234#true} assume !(0 != ~p6~0); {173234#true} is VALID [2022-04-27 15:10:59,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {173234#true} assume !(0 != ~p7~0); {173234#true} is VALID [2022-04-27 15:10:59,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {173234#true} assume !(0 != ~p8~0); {173234#true} is VALID [2022-04-27 15:10:59,124 INFO L290 TraceCheckUtils]: 16: Hoare triple {173234#true} assume 0 != ~p9~0;~lk9~0 := 1; {173239#(= main_~lk9~0 1)} is VALID [2022-04-27 15:10:59,124 INFO L290 TraceCheckUtils]: 17: Hoare triple {173239#(= main_~lk9~0 1)} assume !(0 != ~p1~0); {173239#(= main_~lk9~0 1)} is VALID [2022-04-27 15:10:59,124 INFO L290 TraceCheckUtils]: 18: Hoare triple {173239#(= main_~lk9~0 1)} assume !(0 != ~p2~0); {173239#(= main_~lk9~0 1)} is VALID [2022-04-27 15:10:59,124 INFO L290 TraceCheckUtils]: 19: Hoare triple {173239#(= main_~lk9~0 1)} assume !(0 != ~p3~0); {173239#(= main_~lk9~0 1)} is VALID [2022-04-27 15:10:59,125 INFO L290 TraceCheckUtils]: 20: Hoare triple {173239#(= main_~lk9~0 1)} assume !(0 != ~p4~0); {173239#(= main_~lk9~0 1)} is VALID [2022-04-27 15:10:59,125 INFO L290 TraceCheckUtils]: 21: Hoare triple {173239#(= main_~lk9~0 1)} assume !(0 != ~p5~0); {173239#(= main_~lk9~0 1)} is VALID [2022-04-27 15:10:59,125 INFO L290 TraceCheckUtils]: 22: Hoare triple {173239#(= main_~lk9~0 1)} assume !(0 != ~p6~0); {173239#(= main_~lk9~0 1)} is VALID [2022-04-27 15:10:59,125 INFO L290 TraceCheckUtils]: 23: Hoare triple {173239#(= main_~lk9~0 1)} assume !(0 != ~p7~0); {173239#(= main_~lk9~0 1)} is VALID [2022-04-27 15:10:59,126 INFO L290 TraceCheckUtils]: 24: Hoare triple {173239#(= main_~lk9~0 1)} assume !(0 != ~p8~0); {173239#(= main_~lk9~0 1)} is VALID [2022-04-27 15:10:59,126 INFO L290 TraceCheckUtils]: 25: Hoare triple {173239#(= main_~lk9~0 1)} assume 0 != ~p9~0; {173239#(= main_~lk9~0 1)} is VALID [2022-04-27 15:10:59,126 INFO L290 TraceCheckUtils]: 26: Hoare triple {173239#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {173235#false} is VALID [2022-04-27 15:10:59,126 INFO L290 TraceCheckUtils]: 27: Hoare triple {173235#false} assume !false; {173235#false} is VALID [2022-04-27 15:10:59,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:59,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:59,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853131050] [2022-04-27 15:10:59,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853131050] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:59,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:59,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:59,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570522075] [2022-04-27 15:10:59,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:59,127 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 15:10:59,127 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:59,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:59,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:59,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:59,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:59,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:59,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:59,143 INFO L87 Difference]: Start difference. First operand 6665 states and 7943 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:02,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:11:02,144 INFO L93 Difference]: Finished difference Result 10763 states and 12680 transitions. [2022-04-27 15:11:02,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:11:02,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 15:11:02,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:11:02,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:02,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2022-04-27 15:11:02,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:02,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2022-04-27 15:11:02,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 86 transitions. [2022-04-27 15:11:02,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:11:05,118 INFO L225 Difference]: With dead ends: 10763 [2022-04-27 15:11:05,118 INFO L226 Difference]: Without dead ends: 10761 [2022-04-27 15:11:05,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:11:05,119 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 94 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:11:05,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 63 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:11:05,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10761 states. [2022-04-27 15:11:05,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10761 to 10249. [2022-04-27 15:11:05,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:11:05,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10761 states. Second operand has 10249 states, 10245 states have (on average 1.16232308443143) internal successors, (11908), 10245 states have internal predecessors, (11908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:05,236 INFO L74 IsIncluded]: Start isIncluded. First operand 10761 states. Second operand has 10249 states, 10245 states have (on average 1.16232308443143) internal successors, (11908), 10245 states have internal predecessors, (11908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:05,245 INFO L87 Difference]: Start difference. First operand 10761 states. Second operand has 10249 states, 10245 states have (on average 1.16232308443143) internal successors, (11908), 10245 states have internal predecessors, (11908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:08,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:11:08,104 INFO L93 Difference]: Finished difference Result 10761 states and 12423 transitions. [2022-04-27 15:11:08,104 INFO L276 IsEmpty]: Start isEmpty. Operand 10761 states and 12423 transitions. [2022-04-27 15:11:08,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:11:08,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:11:08,120 INFO L74 IsIncluded]: Start isIncluded. First operand has 10249 states, 10245 states have (on average 1.16232308443143) internal successors, (11908), 10245 states have internal predecessors, (11908), 2 states have call successors, (2), 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 10761 states. [2022-04-27 15:11:08,146 INFO L87 Difference]: Start difference. First operand has 10249 states, 10245 states have (on average 1.16232308443143) internal successors, (11908), 10245 states have internal predecessors, (11908), 2 states have call successors, (2), 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 10761 states. [2022-04-27 15:11:11,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:11:11,030 INFO L93 Difference]: Finished difference Result 10761 states and 12423 transitions. [2022-04-27 15:11:11,030 INFO L276 IsEmpty]: Start isEmpty. Operand 10761 states and 12423 transitions. [2022-04-27 15:11:11,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:11:11,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:11:11,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:11:11,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:11:11,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10249 states, 10245 states have (on average 1.16232308443143) internal successors, (11908), 10245 states have internal predecessors, (11908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:13,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10249 states to 10249 states and 11911 transitions. [2022-04-27 15:11:13,697 INFO L78 Accepts]: Start accepts. Automaton has 10249 states and 11911 transitions. Word has length 28 [2022-04-27 15:11:13,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:11:13,697 INFO L495 AbstractCegarLoop]: Abstraction has 10249 states and 11911 transitions. [2022-04-27 15:11:13,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:13,698 INFO L276 IsEmpty]: Start isEmpty. Operand 10249 states and 11911 transitions. [2022-04-27 15:11:13,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 15:11:13,702 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:11:13,702 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:11:13,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-27 15:11:13,702 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:11:13,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:11:13,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1202204697, now seen corresponding path program 1 times [2022-04-27 15:11:13,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:11:13,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8485372] [2022-04-27 15:11:13,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:11:13,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:11:13,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:11:13,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:11:13,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:11:13,724 INFO L290 TraceCheckUtils]: 0: Hoare triple {216567#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {216561#true} is VALID [2022-04-27 15:11:13,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {216561#true} assume true; {216561#true} is VALID [2022-04-27 15:11:13,724 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {216561#true} {216561#true} #183#return; {216561#true} is VALID [2022-04-27 15:11:13,724 INFO L272 TraceCheckUtils]: 0: Hoare triple {216561#true} call ULTIMATE.init(); {216567#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:11:13,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {216567#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {216561#true} is VALID [2022-04-27 15:11:13,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {216561#true} assume true; {216561#true} is VALID [2022-04-27 15:11:13,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {216561#true} {216561#true} #183#return; {216561#true} is VALID [2022-04-27 15:11:13,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {216561#true} call #t~ret14 := main(); {216561#true} is VALID [2022-04-27 15:11:13,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {216561#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;havoc ~cond~0; {216561#true} is VALID [2022-04-27 15:11:13,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {216561#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {216561#true} is VALID [2022-04-27 15:11:13,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {216561#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; {216561#true} is VALID [2022-04-27 15:11:13,725 INFO L290 TraceCheckUtils]: 8: Hoare triple {216561#true} assume !(0 != ~p1~0); {216561#true} is VALID [2022-04-27 15:11:13,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {216561#true} assume !(0 != ~p2~0); {216561#true} is VALID [2022-04-27 15:11:13,725 INFO L290 TraceCheckUtils]: 10: Hoare triple {216561#true} assume !(0 != ~p3~0); {216561#true} is VALID [2022-04-27 15:11:13,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {216561#true} assume !(0 != ~p4~0); {216561#true} is VALID [2022-04-27 15:11:13,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {216561#true} assume !(0 != ~p5~0); {216561#true} is VALID [2022-04-27 15:11:13,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {216561#true} assume !(0 != ~p6~0); {216561#true} is VALID [2022-04-27 15:11:13,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {216561#true} assume !(0 != ~p7~0); {216561#true} is VALID [2022-04-27 15:11:13,725 INFO L290 TraceCheckUtils]: 15: Hoare triple {216561#true} assume !(0 != ~p8~0); {216561#true} is VALID [2022-04-27 15:11:13,725 INFO L290 TraceCheckUtils]: 16: Hoare triple {216561#true} assume !(0 != ~p9~0); {216566#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:13,725 INFO L290 TraceCheckUtils]: 17: Hoare triple {216566#(= main_~p9~0 0)} assume !(0 != ~p1~0); {216566#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:13,725 INFO L290 TraceCheckUtils]: 18: Hoare triple {216566#(= main_~p9~0 0)} assume !(0 != ~p2~0); {216566#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:13,726 INFO L290 TraceCheckUtils]: 19: Hoare triple {216566#(= main_~p9~0 0)} assume !(0 != ~p3~0); {216566#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:13,726 INFO L290 TraceCheckUtils]: 20: Hoare triple {216566#(= main_~p9~0 0)} assume !(0 != ~p4~0); {216566#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:13,726 INFO L290 TraceCheckUtils]: 21: Hoare triple {216566#(= main_~p9~0 0)} assume !(0 != ~p5~0); {216566#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:13,726 INFO L290 TraceCheckUtils]: 22: Hoare triple {216566#(= main_~p9~0 0)} assume !(0 != ~p6~0); {216566#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:13,727 INFO L290 TraceCheckUtils]: 23: Hoare triple {216566#(= main_~p9~0 0)} assume !(0 != ~p7~0); {216566#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:13,727 INFO L290 TraceCheckUtils]: 24: Hoare triple {216566#(= main_~p9~0 0)} assume !(0 != ~p8~0); {216566#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:13,727 INFO L290 TraceCheckUtils]: 25: Hoare triple {216566#(= main_~p9~0 0)} assume 0 != ~p9~0; {216562#false} is VALID [2022-04-27 15:11:13,727 INFO L290 TraceCheckUtils]: 26: Hoare triple {216562#false} assume 1 != ~lk9~0; {216562#false} is VALID [2022-04-27 15:11:13,727 INFO L290 TraceCheckUtils]: 27: Hoare triple {216562#false} assume !false; {216562#false} is VALID [2022-04-27 15:11:13,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:11:13,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:11:13,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8485372] [2022-04-27 15:11:13,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8485372] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:11:13,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:11:13,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:11:13,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224928954] [2022-04-27 15:11:13,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:11:13,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 15:11:13,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:11:13,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:13,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:11:13,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:11:13,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:11:13,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:11:13,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:11:13,742 INFO L87 Difference]: Start difference. First operand 10249 states and 11911 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:26,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:11:26,455 INFO L93 Difference]: Finished difference Result 22793 states and 25991 transitions. [2022-04-27 15:11:26,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:11:26,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 15:11:26,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:11:26,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:26,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-04-27 15:11:26,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:26,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-04-27 15:11:26,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 148 transitions. [2022-04-27 15:11:26,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:11:26,553 INFO L225 Difference]: With dead ends: 22793 [2022-04-27 15:11:26,553 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 15:11:26,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:11:26,566 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 82 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:11:26,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 102 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:11:26,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 15:11:26,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 15:11:26,567 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:11:26,567 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 15:11:26,567 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 15:11:26,567 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 15:11:26,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:11:26,567 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 15:11:26,567 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 15:11:26,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:11:26,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:11:26,567 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 15:11:26,567 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 15:11:26,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:11:26,567 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 15:11:26,567 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 15:11:26,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:11:26,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:11:26,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:11:26,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:11:26,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 15:11:26,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 15:11:26,568 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2022-04-27 15:11:26,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:11:26,568 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 15:11:26,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:26,568 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 15:11:26,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:11:26,570 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 15:11:26,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-27 15:11:26,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 15:12:00,348 WARN L232 SmtUtils]: Spent 33.76s on a formula simplification that was a NOOP. DAG size: 2098 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-27 15:12:00,391 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-27 15:12:00,391 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-27 15:12:00,391 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-27 15:12:00,391 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 15:12:00,392 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 15:12:00,392 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 15:12:00,392 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 15:12:00,392 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 15:12:00,392 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 15:12:00,392 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 15:12:00,392 INFO L899 garLoopResultBuilder]: For program point L126-1(lines 38 146) no Hoare annotation was computed. [2022-04-27 15:12:00,392 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 6 151) no Hoare annotation was computed. [2022-04-27 15:12:00,392 INFO L899 garLoopResultBuilder]: For program point L102(line 102) no Hoare annotation was computed. [2022-04-27 15:12:00,392 INFO L899 garLoopResultBuilder]: For program point L127(line 127) no Hoare annotation was computed. [2022-04-27 15:12:00,392 INFO L899 garLoopResultBuilder]: For program point L111-1(lines 38 146) no Hoare annotation was computed. [2022-04-27 15:12:00,393 INFO L899 garLoopResultBuilder]: For program point L136-1(lines 38 146) no Hoare annotation was computed. [2022-04-27 15:12:00,393 INFO L899 garLoopResultBuilder]: For program point L95-1(lines 38 146) no Hoare annotation was computed. [2022-04-27 15:12:00,393 INFO L899 garLoopResultBuilder]: For program point L87-1(lines 38 146) no Hoare annotation was computed. [2022-04-27 15:12:00,393 INFO L899 garLoopResultBuilder]: For program point L112(line 112) no Hoare annotation was computed. [2022-04-27 15:12:00,393 INFO L899 garLoopResultBuilder]: For program point L79-1(lines 38 146) no Hoare annotation was computed. [2022-04-27 15:12:00,393 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 6 151) no Hoare annotation was computed. [2022-04-27 15:12:00,393 INFO L899 garLoopResultBuilder]: For program point L137(line 137) no Hoare annotation was computed. [2022-04-27 15:12:00,393 INFO L899 garLoopResultBuilder]: For program point L71-1(lines 38 146) no Hoare annotation was computed. [2022-04-27 15:12:00,393 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 149) no Hoare annotation was computed. [2022-04-27 15:12:00,394 INFO L899 garLoopResultBuilder]: For program point L63(lines 63 65) no Hoare annotation was computed. [2022-04-27 15:12:00,394 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 6 151) the Hoare annotation is: true [2022-04-27 15:12:00,394 INFO L899 garLoopResultBuilder]: For program point L63-2(lines 38 146) no Hoare annotation was computed. [2022-04-27 15:12:00,394 INFO L899 garLoopResultBuilder]: For program point L121-1(lines 38 146) no Hoare annotation was computed. [2022-04-27 15:12:00,394 INFO L899 garLoopResultBuilder]: For program point L122(line 122) no Hoare annotation was computed. [2022-04-27 15:12:00,394 INFO L902 garLoopResultBuilder]: At program point L147(lines 7 151) the Hoare annotation is: true [2022-04-27 15:12:00,394 INFO L899 garLoopResultBuilder]: For program point L106-1(lines 38 146) no Hoare annotation was computed. [2022-04-27 15:12:00,394 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 42) no Hoare annotation was computed. [2022-04-27 15:12:00,394 INFO L899 garLoopResultBuilder]: For program point L131-1(lines 38 146) no Hoare annotation was computed. [2022-04-27 15:12:00,394 INFO L899 garLoopResultBuilder]: For program point L107(line 107) no Hoare annotation was computed. [2022-04-27 15:12:00,394 INFO L899 garLoopResultBuilder]: For program point L132(line 132) no Hoare annotation was computed. [2022-04-27 15:12:00,394 INFO L899 garLoopResultBuilder]: For program point L91-1(lines 38 146) no Hoare annotation was computed. [2022-04-27 15:12:00,394 INFO L899 garLoopResultBuilder]: For program point L116-1(lines 38 146) no Hoare annotation was computed. [2022-04-27 15:12:00,394 INFO L899 garLoopResultBuilder]: For program point L83-1(lines 38 146) no Hoare annotation was computed. [2022-04-27 15:12:00,394 INFO L902 garLoopResultBuilder]: At program point L141-1(lines 38 146) the Hoare annotation is: true [2022-04-27 15:12:00,395 INFO L899 garLoopResultBuilder]: For program point L75-1(lines 38 146) no Hoare annotation was computed. [2022-04-27 15:12:00,395 INFO L899 garLoopResultBuilder]: For program point L67-1(lines 38 146) no Hoare annotation was computed. [2022-04-27 15:12:00,395 INFO L899 garLoopResultBuilder]: For program point L117(line 117) no Hoare annotation was computed. [2022-04-27 15:12:00,395 INFO L899 garLoopResultBuilder]: For program point L142(line 142) no Hoare annotation was computed. [2022-04-27 15:12:00,395 INFO L895 garLoopResultBuilder]: At program point L142-1(lines 7 151) the Hoare annotation is: false [2022-04-27 15:12:00,395 INFO L899 garLoopResultBuilder]: For program point L101-1(lines 38 146) no Hoare annotation was computed. [2022-04-27 15:12:00,397 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:12:00,399 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 15:12:00,401 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 15:12:00,401 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 15:12:00,402 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 15:12:00,402 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 15:12:00,402 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 15:12:00,402 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-27 15:12:00,402 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 15:12:00,402 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 15:12:00,402 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 15:12:00,402 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-27 15:12:00,402 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-27 15:12:00,402 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 15:12:00,402 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2022-04-27 15:12:00,402 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2022-04-27 15:12:00,402 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 15:12:00,402 WARN L170 areAnnotationChecker]: L63-2 has no Hoare annotation [2022-04-27 15:12:00,402 WARN L170 areAnnotationChecker]: L63-2 has no Hoare annotation [2022-04-27 15:12:00,402 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-04-27 15:12:00,402 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-04-27 15:12:00,402 WARN L170 areAnnotationChecker]: L71-1 has no Hoare annotation [2022-04-27 15:12:00,402 WARN L170 areAnnotationChecker]: L71-1 has no Hoare annotation [2022-04-27 15:12:00,402 WARN L170 areAnnotationChecker]: L75-1 has no Hoare annotation [2022-04-27 15:12:00,402 WARN L170 areAnnotationChecker]: L75-1 has no Hoare annotation [2022-04-27 15:12:00,402 WARN L170 areAnnotationChecker]: L79-1 has no Hoare annotation [2022-04-27 15:12:00,402 WARN L170 areAnnotationChecker]: L79-1 has no Hoare annotation [2022-04-27 15:12:00,403 WARN L170 areAnnotationChecker]: L83-1 has no Hoare annotation [2022-04-27 15:12:00,403 WARN L170 areAnnotationChecker]: L83-1 has no Hoare annotation [2022-04-27 15:12:00,403 WARN L170 areAnnotationChecker]: L87-1 has no Hoare annotation [2022-04-27 15:12:00,403 WARN L170 areAnnotationChecker]: L87-1 has no Hoare annotation [2022-04-27 15:12:00,403 WARN L170 areAnnotationChecker]: L91-1 has no Hoare annotation [2022-04-27 15:12:00,403 WARN L170 areAnnotationChecker]: L91-1 has no Hoare annotation [2022-04-27 15:12:00,403 WARN L170 areAnnotationChecker]: L95-1 has no Hoare annotation [2022-04-27 15:12:00,403 WARN L170 areAnnotationChecker]: L95-1 has no Hoare annotation [2022-04-27 15:12:00,403 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2022-04-27 15:12:00,403 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2022-04-27 15:12:00,403 WARN L170 areAnnotationChecker]: L101-1 has no Hoare annotation [2022-04-27 15:12:00,403 WARN L170 areAnnotationChecker]: L101-1 has no Hoare annotation [2022-04-27 15:12:00,403 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2022-04-27 15:12:00,403 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 15:12:00,403 WARN L170 areAnnotationChecker]: L107 has no Hoare annotation [2022-04-27 15:12:00,403 WARN L170 areAnnotationChecker]: L107 has no Hoare annotation [2022-04-27 15:12:00,403 WARN L170 areAnnotationChecker]: L106-1 has no Hoare annotation [2022-04-27 15:12:00,403 WARN L170 areAnnotationChecker]: L106-1 has no Hoare annotation [2022-04-27 15:12:00,403 WARN L170 areAnnotationChecker]: L112 has no Hoare annotation [2022-04-27 15:12:00,403 WARN L170 areAnnotationChecker]: L112 has no Hoare annotation [2022-04-27 15:12:00,403 WARN L170 areAnnotationChecker]: L111-1 has no Hoare annotation [2022-04-27 15:12:00,403 WARN L170 areAnnotationChecker]: L111-1 has no Hoare annotation [2022-04-27 15:12:00,403 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-04-27 15:12:00,403 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-04-27 15:12:00,403 WARN L170 areAnnotationChecker]: L116-1 has no Hoare annotation [2022-04-27 15:12:00,403 WARN L170 areAnnotationChecker]: L116-1 has no Hoare annotation [2022-04-27 15:12:00,403 WARN L170 areAnnotationChecker]: L122 has no Hoare annotation [2022-04-27 15:12:00,403 WARN L170 areAnnotationChecker]: L122 has no Hoare annotation [2022-04-27 15:12:00,404 WARN L170 areAnnotationChecker]: L121-1 has no Hoare annotation [2022-04-27 15:12:00,404 WARN L170 areAnnotationChecker]: L121-1 has no Hoare annotation [2022-04-27 15:12:00,404 WARN L170 areAnnotationChecker]: L127 has no Hoare annotation [2022-04-27 15:12:00,404 WARN L170 areAnnotationChecker]: L127 has no Hoare annotation [2022-04-27 15:12:00,404 WARN L170 areAnnotationChecker]: L126-1 has no Hoare annotation [2022-04-27 15:12:00,404 WARN L170 areAnnotationChecker]: L126-1 has no Hoare annotation [2022-04-27 15:12:00,404 WARN L170 areAnnotationChecker]: L132 has no Hoare annotation [2022-04-27 15:12:00,404 WARN L170 areAnnotationChecker]: L132 has no Hoare annotation [2022-04-27 15:12:00,404 WARN L170 areAnnotationChecker]: L131-1 has no Hoare annotation [2022-04-27 15:12:00,404 WARN L170 areAnnotationChecker]: L131-1 has no Hoare annotation [2022-04-27 15:12:00,404 WARN L170 areAnnotationChecker]: L137 has no Hoare annotation [2022-04-27 15:12:00,404 WARN L170 areAnnotationChecker]: L137 has no Hoare annotation [2022-04-27 15:12:00,404 WARN L170 areAnnotationChecker]: L136-1 has no Hoare annotation [2022-04-27 15:12:00,404 WARN L170 areAnnotationChecker]: L136-1 has no Hoare annotation [2022-04-27 15:12:00,404 WARN L170 areAnnotationChecker]: L142 has no Hoare annotation [2022-04-27 15:12:00,404 WARN L170 areAnnotationChecker]: L142 has no Hoare annotation [2022-04-27 15:12:00,404 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 15:12:00,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 03:12:00 BoogieIcfgContainer [2022-04-27 15:12:00,410 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 15:12:00,410 INFO L158 Benchmark]: Toolchain (without parser) took 95833.53ms. Allocated memory was 195.0MB in the beginning and 558.9MB in the end (delta: 363.9MB). Free memory was 144.0MB in the beginning and 173.1MB in the end (delta: -29.2MB). Peak memory consumption was 362.8MB. Max. memory is 8.0GB. [2022-04-27 15:12:00,410 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 195.0MB. Free memory is still 161.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 15:12:00,410 INFO L158 Benchmark]: CACSL2BoogieTranslator took 167.11ms. Allocated memory is still 195.0MB. Free memory was 143.8MB in the beginning and 168.8MB in the end (delta: -25.0MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. [2022-04-27 15:12:00,411 INFO L158 Benchmark]: Boogie Preprocessor took 23.45ms. Allocated memory is still 195.0MB. Free memory was 168.8MB in the beginning and 167.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 15:12:00,411 INFO L158 Benchmark]: RCFGBuilder took 335.65ms. Allocated memory is still 195.0MB. Free memory was 167.2MB in the beginning and 153.6MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-27 15:12:00,411 INFO L158 Benchmark]: TraceAbstraction took 95302.47ms. Allocated memory was 195.0MB in the beginning and 558.9MB in the end (delta: 363.9MB). Free memory was 153.2MB in the beginning and 173.1MB in the end (delta: -20.0MB). Peak memory consumption was 372.7MB. Max. memory is 8.0GB. [2022-04-27 15:12:00,413 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 195.0MB. Free memory is still 161.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 167.11ms. Allocated memory is still 195.0MB. Free memory was 143.8MB in the beginning and 168.8MB in the end (delta: -25.0MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.45ms. Allocated memory is still 195.0MB. Free memory was 168.8MB in the beginning and 167.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 335.65ms. Allocated memory is still 195.0MB. Free memory was 167.2MB in the beginning and 153.6MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 95302.47ms. Allocated memory was 195.0MB in the beginning and 558.9MB in the end (delta: 363.9MB). Free memory was 153.2MB in the beginning and 173.1MB in the end (delta: -20.0MB). Peak memory consumption was 372.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 149]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 95.3s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 37.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 33.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2859 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2859 mSDsluCounter, 2145 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 177 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1367 IncrementalHoareTripleChecker+Invalid, 1426 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 1968 mSDtfsCounter, 1367 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10249occurred in iteration=24, InterpolantAutomatonStates: 100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 22.3s AutomataMinimizationTime, 25 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 522 NumberOfFragments, 13 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 33.8s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 606 NumberOfCodeBlocks, 606 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 581 ConstructedInterpolants, 0 QuantifiedInterpolants, 1262 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-04-27 15:12:00,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...